About the Execution of ITS-Tools for SafeBus-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?FFFFFF?FFT?FFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264700724.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is SafeBus-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264700724
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SafeBus-COL-10-LTLFireability-00
FORMULA_NAME SafeBus-COL-10-LTLFireability-01
FORMULA_NAME SafeBus-COL-10-LTLFireability-02
FORMULA_NAME SafeBus-COL-10-LTLFireability-03
FORMULA_NAME SafeBus-COL-10-LTLFireability-04
FORMULA_NAME SafeBus-COL-10-LTLFireability-05
FORMULA_NAME SafeBus-COL-10-LTLFireability-06
FORMULA_NAME SafeBus-COL-10-LTLFireability-07
FORMULA_NAME SafeBus-COL-10-LTLFireability-08
FORMULA_NAME SafeBus-COL-10-LTLFireability-09
FORMULA_NAME SafeBus-COL-10-LTLFireability-10
FORMULA_NAME SafeBus-COL-10-LTLFireability-11
FORMULA_NAME SafeBus-COL-10-LTLFireability-12
FORMULA_NAME SafeBus-COL-10-LTLFireability-13
FORMULA_NAME SafeBus-COL-10-LTLFireability-14
FORMULA_NAME SafeBus-COL-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749155913691
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-05 20:38:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 20:38:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:38:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-05 20:38:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 20:38:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 557 ms
[2025-06-05 20:38:35] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2025-06-05 20:38:35] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 20:38:35] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 5 ms.
[2025-06-05 20:38:35] [INFO ] Skeletonized 13 HLPN properties in 1 ms. Removed 3 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA SafeBus-COL-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8 resets) in 1013 ms. (39 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 1/1 properties
// Phase 1: matrix 14 rows 17 cols
[2025-06-05 20:38:36] [INFO ] Computed 7 invariants in 4 ms
[2025-06-05 20:38:36] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 17/31 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/17 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 184ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA SafeBus-COL-10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:38:36] [INFO ] Flatten gal took : 24 ms
[2025-06-05 20:38:36] [INFO ] Flatten gal took : 4 ms
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2025-06-05 20:38:36] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 83 ms.
[2025-06-05 20:38:36] [INFO ] Unfolded 13 HLPN properties in 2 ms.
[2025-06-05 20:38:36] [INFO ] Reduced 80 identical enabling conditions.
[2025-06-05 20:38:36] [INFO ] Reduced 80 identical enabling conditions.
[2025-06-05 20:38:36] [INFO ] Reduced 80 identical enabling conditions.
[2025-06-05 20:38:36] [INFO ] Reduced 80 identical enabling conditions.
[2025-06-05 20:38:36] [INFO ] Reduced 80 identical enabling conditions.
[2025-06-05 20:38:36] [INFO ] Reduced 80 identical enabling conditions.
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 20 places and 20 transitions.
Support contains 295 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 34 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2025-06-05 20:38:37] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-05 20:38:37] [INFO ] Computed 45 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:38:37] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-06-05 20:38:37] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-05 20:38:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:38:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:38:37] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2025-06-05 20:38:38] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-05 20:38:38] [INFO ] Invariant cache hit.
[2025-06-05 20:38:38] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:50] [INFO ] Deduced a trap composed of 32 places in 387 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:50] [INFO ] Deduced a trap composed of 32 places in 281 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:50] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:51] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:51] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:51] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:52] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:52] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:52] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:52] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:53] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:53] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:53] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:54] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:54] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:54] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:55] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:55] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:55] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:56] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:57] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:57] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:58] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:58] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:58] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:58] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:59] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:59] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:38:59] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:00] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:00] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:09] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:10] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:10] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:10] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 21 ms to minimize.
SMT process timed out in 32630ms, After SMT, problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 32652ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33538 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 295 out of 306 places after structural reductions.
[2025-06-05 20:39:11] [INFO ] Flatten gal took : 403 ms
[2025-06-05 20:39:12] [INFO ] Flatten gal took : 245 ms
[2025-06-05 20:39:13] [INFO ] Input system was already deterministic with 1531 transitions.
Reduction of identical properties reduced properties to check from 22 to 16
RANDOM walk for 3306 steps (0 resets) in 344 ms. (9 steps per ms) remains 0/16 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&X(F(!p1))) U X((p0 U p2)))))'
Support contains 41 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 29 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:39:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:39:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:39:14] [INFO ] Implicit Places using invariants in 425 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 441 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 11 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 481 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 401 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), p1]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-00
Product exploration explored 100000 steps with 3596 reset in 489 ms.
Product exploration explored 100000 steps with 3604 reset in 383 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), p1]
RANDOM walk for 132 steps (0 resets) in 10 ms. (12 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 7 factoid took 289 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), p1]
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), p1]
[2025-06-05 20:39:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2025-06-05 20:39:17] [INFO ] Computed 35 invariants in 47 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:39:18] [INFO ] [Real]Absence check using 14 positive place invariants in 145 ms returned sat
[2025-06-05 20:39:18] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 245 ms returned sat
[2025-06-05 20:39:24] [INFO ] [Real]Absence check using state equation in 5856 ms returned sat
[2025-06-05 20:39:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:39:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 95 ms returned sat
[2025-06-05 20:39:25] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 125 ms returned sat
[2025-06-05 20:39:26] [INFO ] [Nat]Absence check using state equation in 1069 ms returned sat
[2025-06-05 20:39:26] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:39:26] [INFO ] [Nat]Added 111 Read/Feed constraints in 103 ms returned sat
[2025-06-05 20:39:26] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 86 ms.
[2025-06-05 20:39:26] [INFO ] Added : 1 causal constraints over 1 iterations in 241 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 41 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 15 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:39:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:39:26] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-06-05 20:39:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:39:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:39:28] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:39:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:39:28] [INFO ] Invariant cache hit.
[2025-06-05 20:39:28] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:39] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:39] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:40] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:40] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:40] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:41] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:41] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:41] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:41] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:42] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:42] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:42] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:42] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:43] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:43] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:43] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:44] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:44] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:44] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:44] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:46] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:46] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:46] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:46] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:47] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:47] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:47] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:48] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:48] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:48] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:49] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:57] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:57] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:58] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:58] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:58] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:58] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:39:59] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:00] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 74 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 39/74 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:04] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:04] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:05] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:05] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:05] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:06] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:06] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:06] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:06] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:07] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:07] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:08] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:08] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:09] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:16] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:16] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:16] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:18] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:18] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:18] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 94 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61981ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61992ms
Finished structural reductions in LTL mode , in 1 iterations and 64168 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 102 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), p1]
RANDOM walk for 130 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), p1]
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), p1]
[2025-06-05 20:40:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:40:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:40:32] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2025-06-05 20:40:32] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 199 ms returned sat
[2025-06-05 20:40:38] [INFO ] [Real]Absence check using state equation in 5838 ms returned sat
[2025-06-05 20:40:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:40:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2025-06-05 20:40:39] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 82 ms returned sat
[2025-06-05 20:40:40] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2025-06-05 20:40:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:40:40] [INFO ] [Nat]Added 111 Read/Feed constraints in 111 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:40] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 5 ms to minimize.
[2025-06-05 20:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2025-06-05 20:40:41] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 77 ms.
[2025-06-05 20:40:41] [INFO ] Added : 1 causal constraints over 1 iterations in 249 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 257 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), p1]
Product exploration explored 100000 steps with 3628 reset in 345 ms.
Product exploration explored 100000 steps with 3646 reset in 367 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), p1]
Support contains 41 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 241 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:40:43] [INFO ] Redundant transitions in 161 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:40:43] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:40:43] [INFO ] Invariant cache hit.
[2025-06-05 20:40:43] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:54] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:54] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:54] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:54] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:55] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:55] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:55] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:55] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:56] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:56] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:56] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:56] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:57] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:57] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:57] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:58] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:58] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:58] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:59] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:40:59] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:00] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:00] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:01] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:01] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:01] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:01] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:02] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:02] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:02] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:03] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:03] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:12] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:12] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:12] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:13] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:13] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:13] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:14] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:14] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 74 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 39/74 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:18] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:19] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:19] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:19] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:19] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:20] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:20] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:20] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:21] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:21] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:22] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:22] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:23] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:23] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:30] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:30] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:31] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:32] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:33] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:41:33] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 94 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61964ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61969ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62382 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin8626856061546301722
[2025-06-05 20:41:45] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8626856061546301722
Running compilation step : cd /tmp/ltsmin8626856061546301722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8626856061546301722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8626856061546301722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 41 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 12 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:41:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:41:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:41:48] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-06-05 20:41:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:41:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:41:48] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:41:50] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:41:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:41:50] [INFO ] Invariant cache hit.
[2025-06-05 20:41:50] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:01] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:01] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:01] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:02] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:02] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:02] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:03] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:03] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:03] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:03] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:04] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:04] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:04] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:04] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:05] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:05] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:05] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:06] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:06] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:06] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:07] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:08] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:08] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:08] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:09] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:09] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:09] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:10] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:10] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:10] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:11] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:19] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:19] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:20] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:20] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:20] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:21] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:22] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:42:22] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 26 ms to minimize.
SMT process timed out in 31966ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 31971ms
Finished structural reductions in LTL mode , in 1 iterations and 34147 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin11931864775505664962
[2025-06-05 20:42:22] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11931864775505664962
Running compilation step : cd /tmp/ltsmin11931864775505664962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11931864775505664962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11931864775505664962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-05 20:42:25] [INFO ] Flatten gal took : 101 ms
[2025-06-05 20:42:25] [INFO ] Flatten gal took : 66 ms
[2025-06-05 20:42:25] [INFO ] Time to serialize gal into /tmp/LTL6422542919191628045.gal : 18 ms
[2025-06-05 20:42:25] [INFO ] Time to serialize properties into /tmp/LTL6976032360914902062.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6422542919191628045.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3817493788855859251.hoa' '-atoms' '/tmp/LTL6976032360914902062.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6976032360914902062.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3817493788855859251.hoa
Detected timeout of ITS tools.
[2025-06-05 20:42:41] [INFO ] Flatten gal took : 61 ms
[2025-06-05 20:42:41] [INFO ] Flatten gal took : 61 ms
[2025-06-05 20:42:41] [INFO ] Time to serialize gal into /tmp/LTL1464782451030049728.gal : 13 ms
[2025-06-05 20:42:41] [INFO ] Time to serialize properties into /tmp/LTL12718403450826002568.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1464782451030049728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12718403450826002568.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((F("((((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_1>=1)&&(FMC_1>=1)))||(((cable_used_4>=1)&&(FMC_4>=1))||((cable_used_5>=1)&...1372
Formula 0 simplified : X((G!"((((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_1>=1)&&(FMC_1>=1)))||(((cable_used_4>=1)&&(FMC_4>=1))||((cable_used_5>=1)&&(...1358
Detected timeout of ITS tools.
[2025-06-05 20:42:56] [INFO ] Flatten gal took : 60 ms
[2025-06-05 20:42:56] [INFO ] Applying decomposition
[2025-06-05 20:42:56] [INFO ] Flatten gal took : 78 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/graph6864779851815598939.txt' '-o' '/tmp/graph6864779851815598939.bin' '-w' '/tmp/graph6864779851815598939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6864779851815598939.bin' '-l' '-1' '-v' '-w' '/tmp/graph6864779851815598939.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:42:56] [INFO ] Decomposing Gal with order
[2025-06-05 20:42:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:42:57] [INFO ] Removed a total of 3402 redundant transitions.
[2025-06-05 20:42:57] [INFO ] Flatten gal took : 776 ms
[2025-06-05 20:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 569 labels/synchronizations in 103 ms.
[2025-06-05 20:42:57] [INFO ] Time to serialize gal into /tmp/LTL8176257842729204800.gal : 11 ms
[2025-06-05 20:42:57] [INFO ] Time to serialize properties into /tmp/LTL8051519934504367270.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8176257842729204800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8051519934504367270.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(((F("((((((i0.u1.cable_used_0>=1)&&(i5.u10.FMC_0>=1))||((i0.u1.cable_used_1>=1)&&(i5.u9.FMC_1>=1)))||(((i0.u1.cable_used_4>=1)&&(...1899
Formula 0 simplified : X((G!"((((((i0.u1.cable_used_0>=1)&&(i5.u10.FMC_0>=1))||((i0.u1.cable_used_1>=1)&&(i5.u9.FMC_1>=1)))||(((i0.u1.cable_used_4>=1)&&(i5...1885
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-00 finished in 238555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 108 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:43:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-05 20:43:12] [INFO ] Computed 45 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:43:13] [INFO ] Implicit Places using invariants in 635 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 639 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 111 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 860 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-02
Product exploration explored 100000 steps with 3871 reset in 362 ms.
Product exploration explored 100000 steps with 3858 reset in 403 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 112 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2025-06-05 20:43:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2025-06-05 20:43:15] [INFO ] Computed 35 invariants in 6 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:43:15] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2025-06-05 20:43:15] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 114 ms returned sat
[2025-06-05 20:43:16] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2025-06-05 20:43:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:43:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2025-06-05 20:43:17] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 501 ms returned sat
[2025-06-05 20:43:18] [INFO ] [Nat]Absence check using state equation in 882 ms returned sat
[2025-06-05 20:43:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:43:18] [INFO ] [Nat]Added 111 Read/Feed constraints in 105 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:18] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 6 ms to minimize.
[2025-06-05 20:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-06-05 20:43:18] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 69 ms.
[2025-06-05 20:43:18] [INFO ] Added : 2 causal constraints over 2 iterations in 242 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 102 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:43:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:43:19] [INFO ] Implicit Places using invariants in 428 ms returned []
[2025-06-05 20:43:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:43:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:43:21] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:43:21] [INFO ] Redundant transitions in 31 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:43:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:43:21] [INFO ] Invariant cache hit.
[2025-06-05 20:43:21] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:32] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:33] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:33] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:33] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:33] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:34] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:34] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:34] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:34] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:35] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:35] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:35] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:35] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:36] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:36] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:36] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:37] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:37] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:37] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:38] [INFO ] Deduced a trap composed of 32 places in 832 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:39] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:40] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:40] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:40] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:40] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:41] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:41] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:41] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:42] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:42] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:42] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:51] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:51] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:51] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:52] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:52] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:52] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 72 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 37/72 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:56] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:04] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:05] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:06] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:06] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:06] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:06] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:07] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:07] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:07] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:07] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:08] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:08] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:12] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:12] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:12] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:12] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:13] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:13] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:13] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:17] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 93 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61986ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61990ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64512 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 92 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2025-06-05 20:44:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:44:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:44:24] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2025-06-05 20:44:24] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 92 ms returned sat
[2025-06-05 20:44:27] [INFO ] [Real]Absence check using state equation in 3071 ms returned sat
[2025-06-05 20:44:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:44:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2025-06-05 20:44:28] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 265 ms returned sat
[2025-06-05 20:44:29] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2025-06-05 20:44:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:44:29] [INFO ] [Nat]Added 111 Read/Feed constraints in 109 ms returned sat
[2025-06-05 20:44:29] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 73 ms.
[2025-06-05 20:44:29] [INFO ] Added : 0 causal constraints over 0 iterations in 205 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3859 reset in 391 ms.
Product exploration explored 100000 steps with 3842 reset in 346 ms.
Built C files in :
/tmp/ltsmin2391139087468651895
[2025-06-05 20:44:30] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2025-06-05 20:44:30] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2391139087468651895
Running compilation step : cd /tmp/ltsmin2391139087468651895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2944 ms.
Running link step : cd /tmp/ltsmin2391139087468651895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin2391139087468651895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3516197961337221986.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 96 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:44:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:44:46] [INFO ] Implicit Places using invariants in 538 ms returned []
[2025-06-05 20:44:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:44:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:44:46] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:44:47] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:44:48] [INFO ] Redundant transitions in 81 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:44:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:44:48] [INFO ] Invariant cache hit.
[2025-06-05 20:44:48] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:59] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:59] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:59] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:00] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:00] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:00] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:00] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:01] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:01] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:01] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:01] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:02] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:02] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:02] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:02] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:03] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:03] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:03] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:04] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:04] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:05] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:05] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:05] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:06] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:06] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:06] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:07] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:07] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:07] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:07] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:08] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:17] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:17] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:17] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:18] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:18] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:18] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:19] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:19] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 74 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 39/74 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:24] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:24] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:24] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:25] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:25] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:25] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:25] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:25] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:26] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:26] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:27] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:27] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:28] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:28] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:35] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:36] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:36] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:37] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:37] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:45:38] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 94 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61869ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61873ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64385 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin16320472892516411399
[2025-06-05 20:45:49] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2025-06-05 20:45:49] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16320472892516411399
Running compilation step : cd /tmp/ltsmin16320472892516411399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2945 ms.
Running link step : cd /tmp/ltsmin16320472892516411399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16320472892516411399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1940470335659561033.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 20:46:05] [INFO ] Flatten gal took : 55 ms
[2025-06-05 20:46:05] [INFO ] Flatten gal took : 52 ms
[2025-06-05 20:46:05] [INFO ] Time to serialize gal into /tmp/LTL12130533271742216506.gal : 10 ms
[2025-06-05 20:46:05] [INFO ] Time to serialize properties into /tmp/LTL5834759919436515147.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12130533271742216506.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16153894263933536095.hoa' '-atoms' '/tmp/LTL5834759919436515147.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5834759919436515147.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16153894263933536095.hoa
Detected timeout of ITS tools.
[2025-06-05 20:46:20] [INFO ] Flatten gal took : 52 ms
[2025-06-05 20:46:20] [INFO ] Flatten gal took : 52 ms
[2025-06-05 20:46:20] [INFO ] Time to serialize gal into /tmp/LTL11528059416967197550.gal : 8 ms
[2025-06-05 20:46:20] [INFO ] Time to serialize properties into /tmp/LTL6936993085652261656.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11528059416967197550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6936993085652261656.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((MSG_6>=1)&&(wait_msg_6>=1))||((MSG_2>=1)&&(wait_msg_2>=1)))||(((MSG_4>=1)&&(wait_msg_4>=1))||((MSG_8>=1)&&(wait_msg_8>=1...360
Formula 0 simplified : FG!"((((((MSG_6>=1)&&(wait_msg_6>=1))||((MSG_2>=1)&&(wait_msg_2>=1)))||(((MSG_4>=1)&&(wait_msg_4>=1))||((MSG_8>=1)&&(wait_msg_8>=1))...354
Detected timeout of ITS tools.
[2025-06-05 20:46:35] [INFO ] Flatten gal took : 50 ms
[2025-06-05 20:46:35] [INFO ] Applying decomposition
[2025-06-05 20:46:35] [INFO ] Flatten gal took : 51 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/graph17270917172090792505.txt' '-o' '/tmp/graph17270917172090792505.bin' '-w' '/tmp/graph17270917172090792505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17270917172090792505.bin' '-l' '-1' '-v' '-w' '/tmp/graph17270917172090792505.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:46:35] [INFO ] Decomposing Gal with order
[2025-06-05 20:46:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:46:36] [INFO ] Removed a total of 1767 redundant transitions.
[2025-06-05 20:46:36] [INFO ] Flatten gal took : 216 ms
[2025-06-05 20:46:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 722 labels/synchronizations in 45 ms.
[2025-06-05 20:46:36] [INFO ] Time to serialize gal into /tmp/LTL833972707507684842.gal : 10 ms
[2025-06-05 20:46:36] [INFO ] Time to serialize properties into /tmp/LTL7036146066178543714.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL833972707507684842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7036146066178543714.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((i4.u11.MSG_6>=1)&&(u0.wait_msg_6>=1))||((i4.u11.MSG_2>=1)&&(u0.wait_msg_2>=1)))||(((i4.u11.MSG_4>=1)&&(i3.u5.wait_msg_4>...463
Formula 0 simplified : FG!"((((((i4.u11.MSG_6>=1)&&(u0.wait_msg_6>=1))||((i4.u11.MSG_2>=1)&&(u0.wait_msg_2>=1)))||(((i4.u11.MSG_4>=1)&&(i3.u5.wait_msg_4>=1...457
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-02 finished in 218324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1||(p2 U X(p3))))))'
Support contains 143 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:46:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-05 20:46:51] [INFO ] Computed 45 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:51] [INFO ] Implicit Places using invariants in 210 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 211 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 408 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-COL-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-03 finished in 685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(!p0))))))))'
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:46:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:52] [INFO ] Implicit Places using invariants in 478 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 481 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 499 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-05 finished in 817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 102 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:46:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:53] [INFO ] Implicit Places using invariants in 466 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 470 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 114 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2025-06-05 20:46:53] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2025-06-05 20:46:53] [INFO ] Computed 35 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:53] [INFO ] Implicit Places using invariants in 422 ms returned []
[2025-06-05 20:46:53] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2025-06-05 20:46:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:46:55] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2910 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 587 ms.
Stack based approach found an accepted trace after 419 steps with 0 reset with depth 420 and stack size 420 in 4 ms.
FORMULA SafeBus-COL-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-06 finished in 3555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(p1))||p0))&&X(F(p2))))'
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 11 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:46:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-05 20:46:56] [INFO ] Computed 45 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:56] [INFO ] Implicit Places using invariants in 378 ms returned []
[2025-06-05 20:46:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:46:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:56] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:46:58] [INFO ] Implicit Places using invariants and state equation in 2149 ms returned []
Implicit Place search using SMT with State Equation took 2529 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:46:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:46:58] [INFO ] Invariant cache hit.
[2025-06-05 20:46:58] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:10] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:10] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:10] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:11] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:11] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:11] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:11] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:12] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:12] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:12] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:12] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:13] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:13] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:13] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:14] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:14] [INFO ] Deduced a trap composed of 32 places in 290 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:14] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:14] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:15] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:15] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:16] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:17] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:17] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:17] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:17] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:18] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:18] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:18] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:19] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:19] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:19] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:20] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:20] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:20] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:20] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:29] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:29] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:30] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:30] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:30] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 85 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:45] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:47] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:48] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:48] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:48] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:48] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:48] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:49] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:49] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:49] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:49] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:50] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 103 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62192ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62196ms
Finished structural reductions in LTL mode , in 1 iterations and 64744 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-07
Product exploration explored 100000 steps with 13348 reset in 471 ms.
Product exploration explored 100000 steps with 13428 reset in 484 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 263 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 95 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 378 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-06-05 20:48:03] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:48:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:48:04] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-06-05 20:48:04] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 315 ms returned sat
[2025-06-05 20:48:04] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2025-06-05 20:48:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:48:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2025-06-05 20:48:05] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 35 ms returned sat
[2025-06-05 20:48:06] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2025-06-05 20:48:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:48:06] [INFO ] [Nat]Added 111 Read/Feed constraints in 74 ms returned sat
[2025-06-05 20:48:06] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 45 ms.
[2025-06-05 20:48:06] [INFO ] Added : 1 causal constraints over 1 iterations in 183 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-05 20:48:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:48:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:48:07] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2025-06-05 20:48:08] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 803 ms returned sat
[2025-06-05 20:48:11] [INFO ] [Real]Absence check using state equation in 2871 ms returned sat
[2025-06-05 20:48:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:48:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2025-06-05 20:48:12] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 54 ms returned sat
[2025-06-05 20:48:14] [INFO ] [Nat]Absence check using state equation in 1764 ms returned sat
[2025-06-05 20:48:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:48:14] [INFO ] [Nat]Added 111 Read/Feed constraints in 89 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:14] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:14] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 7 ms to minimize.
[2025-06-05 20:48:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2025-06-05 20:48:14] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 42 ms.
[2025-06-05 20:48:15] [INFO ] Added : 4 causal constraints over 3 iterations in 314 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 11 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:48:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:15] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-06-05 20:48:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:48:17] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 2523 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:48:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:48:17] [INFO ] Invariant cache hit.
[2025-06-05 20:48:17] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:28] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:28] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:29] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:29] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:29] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:29] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:30] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:30] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:30] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:31] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:31] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:31] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:32] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:32] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:32] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:32] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:33] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:33] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:33] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:33] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:35] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:35] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:35] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:36] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:36] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:36] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:37] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:37] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:37] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:38] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:38] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:38] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:39] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:39] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:39] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:48] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:48] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:49] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:49] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:49] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 21 ms to minimize.
SMT process timed out in 31933ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 31937ms
Finished structural reductions in LTL mode , in 1 iterations and 34477 ms. Remains : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 120 steps (0 resets) in 12 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 385 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-06-05 20:48:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:48:51] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-06-05 20:48:51] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 319 ms returned sat
[2025-06-05 20:48:52] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2025-06-05 20:48:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:48:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2025-06-05 20:48:52] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 35 ms returned sat
[2025-06-05 20:48:53] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2025-06-05 20:48:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:48:53] [INFO ] [Nat]Added 111 Read/Feed constraints in 73 ms returned sat
[2025-06-05 20:48:54] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 43 ms.
[2025-06-05 20:48:54] [INFO ] Added : 1 causal constraints over 1 iterations in 179 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-05 20:48:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:48:55] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2025-06-05 20:48:55] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 806 ms returned sat
[2025-06-05 20:48:58] [INFO ] [Real]Absence check using state equation in 2859 ms returned sat
[2025-06-05 20:48:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:48:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2025-06-05 20:48:59] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 45 ms returned sat
[2025-06-05 20:49:01] [INFO ] [Nat]Absence check using state equation in 1739 ms returned sat
[2025-06-05 20:49:01] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:49:01] [INFO ] [Nat]Added 111 Read/Feed constraints in 88 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:01] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:02] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 8 ms to minimize.
[2025-06-05 20:49:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2025-06-05 20:49:02] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 49 ms.
[2025-06-05 20:49:02] [INFO ] Added : 4 causal constraints over 3 iterations in 303 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 13322 reset in 473 ms.
Product exploration explored 100000 steps with 13389 reset in 512 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 142 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:49:03] [INFO ] Redundant transitions in 20 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:49:03] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:49:03] [INFO ] Invariant cache hit.
[2025-06-05 20:49:03] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:15] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:15] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:15] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:15] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:16] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:16] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:16] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:17] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:17] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:17] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:17] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:18] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:18] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:18] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:19] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:19] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:19] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:19] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:20] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:20] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:21] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:21] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:22] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:22] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:22] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:23] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:23] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:23] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:24] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:24] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:24] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:25] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:25] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:25] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:25] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:34] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:34] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:35] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:35] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:35] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 85 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:48] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:48] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:48] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:49] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:49] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:50] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:50] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:52] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:54] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:54] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:54] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:54] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:55] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 103 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62103ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62280 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin7628053311147990088
[2025-06-05 20:50:06] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7628053311147990088
Running compilation step : cd /tmp/ltsmin7628053311147990088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7628053311147990088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7628053311147990088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 13 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:50:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:50:09] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-06-05 20:50:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:50:09] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:50:11] [INFO ] Implicit Places using invariants and state equation in 2151 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:50:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:50:11] [INFO ] Invariant cache hit.
[2025-06-05 20:50:11] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:22] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:22] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:22] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:23] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:23] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:23] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:23] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:24] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:24] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:24] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:25] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:25] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:25] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:25] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:26] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:26] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:26] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:27] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:27] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:27] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:28] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:29] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:29] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:29] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:29] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:30] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:30] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:30] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:31] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:31] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:31] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:32] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:32] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:32] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:33] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:41] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:42] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:42] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:42] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:43] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 85 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:55] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:55] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:55] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:56] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:56] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:57] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:57] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:00] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:00] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:00] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:00] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:00] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:01] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:01] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:01] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:01] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:01] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:02] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:51:13] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 30 ms to minimize.
SMT process timed out in 61974ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61979ms
Finished structural reductions in LTL mode , in 1 iterations and 64515 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin7603301420869242485
[2025-06-05 20:51:13] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7603301420869242485
Running compilation step : cd /tmp/ltsmin7603301420869242485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7603301420869242485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7603301420869242485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-05 20:51:16] [INFO ] Flatten gal took : 49 ms
[2025-06-05 20:51:16] [INFO ] Flatten gal took : 50 ms
[2025-06-05 20:51:16] [INFO ] Time to serialize gal into /tmp/LTL5138280349046224276.gal : 8 ms
[2025-06-05 20:51:16] [INFO ] Time to serialize properties into /tmp/LTL1250160012267346845.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5138280349046224276.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4691611960063629957.hoa' '-atoms' '/tmp/LTL1250160012267346845.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1250160012267346845.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4691611960063629957.hoa
Detected timeout of ITS tools.
[2025-06-05 20:51:32] [INFO ] Flatten gal took : 49 ms
[2025-06-05 20:51:32] [INFO ] Flatten gal took : 48 ms
[2025-06-05 20:51:32] [INFO ] Time to serialize gal into /tmp/LTL13459320872566950456.gal : 8 ms
[2025-06-05 20:51:32] [INFO ] Time to serialize properties into /tmp/LTL1441573606387588688.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13459320872566950456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1441573606387588688.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(("(((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_1>=1)&&(FMC_1>=1)))||(((cable_used_4>=1)&&(FMC_4>=1))||((cable_used_5>=1)&&(F...1451
Formula 0 simplified : G(!"(((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_1>=1)&&(FMC_1>=1)))||(((cable_used_4>=1)&&(FMC_4>=1))||((cable_used_5>=1)&&(FMC...1435
Detected timeout of ITS tools.
[2025-06-05 20:51:47] [INFO ] Flatten gal took : 47 ms
[2025-06-05 20:51:47] [INFO ] Applying decomposition
[2025-06-05 20:51:47] [INFO ] Flatten gal took : 48 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/graph6483151090810834665.txt' '-o' '/tmp/graph6483151090810834665.bin' '-w' '/tmp/graph6483151090810834665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6483151090810834665.bin' '-l' '-1' '-v' '-w' '/tmp/graph6483151090810834665.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:51:47] [INFO ] Decomposing Gal with order
[2025-06-05 20:51:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:51:47] [INFO ] Removed a total of 2512 redundant transitions.
[2025-06-05 20:51:47] [INFO ] Flatten gal took : 322 ms
[2025-06-05 20:51:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 952 labels/synchronizations in 68 ms.
[2025-06-05 20:51:47] [INFO ] Time to serialize gal into /tmp/LTL2569908081351484413.gal : 7 ms
[2025-06-05 20:51:47] [INFO ] Time to serialize properties into /tmp/LTL13799651114959481610.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2569908081351484413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13799651114959481610.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(("(((((i0.u14.cable_used_0>=1)&&(i2.i1.u11.FMC_0>=1))||((i0.u14.cable_used_1>=1)&&(i2.i1.u11.FMC_1>=1)))||(((i0.u14.cable_used_4...2185
Formula 0 simplified : G(!"(((((i0.u14.cable_used_0>=1)&&(i2.i1.u11.FMC_0>=1))||((i0.u14.cable_used_1>=1)&&(i2.i1.u11.FMC_1>=1)))||(((i0.u14.cable_used_4>=...2169
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-07 finished in 306742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G((!p1||(X(X(!p2)) U (X(X(G(!p2)))||(!p1&&X(X(!p2))))))))) U p1))'
Support contains 132 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:52:03] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:52:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:52:03] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-06-05 20:52:03] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:52:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:52:03] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:52:05] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:52:05] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:52:05] [INFO ] Invariant cache hit.
[2025-06-05 20:52:05] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:16] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:17] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:17] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:17] [INFO ] Deduced a trap composed of 32 places in 334 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:18] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:18] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:18] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:18] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:19] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:19] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:19] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:19] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:20] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:20] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:20] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:21] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:21] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:21] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:22] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:22] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:23] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:23] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:24] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:24] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:24] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:25] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:25] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:25] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:26] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:26] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:26] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:26] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:27] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:27] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:27] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:37] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:37] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 30 ms to minimize.
SMT process timed out in 32424ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 32430ms
Finished structural reductions in LTL mode , in 1 iterations and 34554 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 463 ms :[(NOT p1), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-08
Product exploration explored 100000 steps with 3474 reset in 790 ms.
Stack based approach found an accepted trace after 37439 steps with 1352 reset with depth 95 and stack size 95 in 244 ms.
FORMULA SafeBus-COL-10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-08 finished in 36097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(X((G(p3)&&p2))&&p1))))))'
Support contains 232 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 3 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:52:39] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:52:39] [INFO ] Implicit Places using invariants in 156 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 175 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 3 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-09
Product exploration timeout after 26070 steps with 0 reset in 10003 ms.
Stack based approach found an accepted trace after 507 steps with 0 reset with depth 508 and stack size 508 in 192 ms.
FORMULA SafeBus-COL-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-09 finished in 10728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(F((p1&&G(p2))))))))'
Support contains 123 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 156 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:52:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:52:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:52:50] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-06-05 20:52:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:52:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:52:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:52:52] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:52:52] [INFO ] Redundant transitions in 19 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:52:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:52:52] [INFO ] Invariant cache hit.
[2025-06-05 20:52:52] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:03] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:03] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:03] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:04] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:04] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:04] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:04] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:05] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:05] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:05] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:06] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:06] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:06] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:06] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:07] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:07] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:07] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:07] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:08] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:08] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:09] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:10] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:10] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:10] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:10] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:11] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:11] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:12] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:12] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:12] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:13] [INFO ] Deduced a trap composed of 32 places in 433 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:13] [INFO ] Deduced a trap composed of 32 places in 473 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:13] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:14] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:14] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:23] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:23] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:23] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:24] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:24] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 20 ms to minimize.
SMT process timed out in 32157ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 32162ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34574 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-11
Product exploration explored 100000 steps with 4113 reset in 1277 ms.
Product exploration explored 100000 steps with 4140 reset in 1298 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 118 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 137 steps (0 resets) in 6 ms. (19 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 306 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2025-06-05 20:53:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:53:30] [INFO ] [Real]Absence check using 21 positive place invariants in 38 ms returned sat
[2025-06-05 20:53:31] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 1809 ms returned sat
[2025-06-05 20:53:33] [INFO ] [Real]Absence check using state equation in 1585 ms returned sat
[2025-06-05 20:53:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:53:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2025-06-05 20:53:35] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 188 ms returned sat
[2025-06-05 20:53:37] [INFO ] [Nat]Absence check using state equation in 1512 ms returned sat
[2025-06-05 20:53:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:53:37] [INFO ] [Nat]Added 111 Read/Feed constraints in 114 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:37] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 14 ms to minimize.
[2025-06-05 20:53:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2025-06-05 20:53:37] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 41 ms.
[2025-06-05 20:53:37] [INFO ] Added : 2 causal constraints over 2 iterations in 248 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2025-06-05 20:53:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:53:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:53:39] [INFO ] [Real]Absence check using 21 positive place invariants in 32 ms returned sat
[2025-06-05 20:53:39] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 234 ms returned sat
[2025-06-05 20:53:42] [INFO ] [Real]Absence check using state equation in 2403 ms returned sat
[2025-06-05 20:53:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:53:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2025-06-05 20:53:43] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 178 ms returned sat
[2025-06-05 20:53:44] [INFO ] [Nat]Absence check using state equation in 1243 ms returned sat
[2025-06-05 20:53:44] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:53:44] [INFO ] [Nat]Added 111 Read/Feed constraints in 162 ms returned sat
[2025-06-05 20:53:45] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 43 ms.
[2025-06-05 20:53:45] [INFO ] Added : 1 causal constraints over 1 iterations in 194 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 123 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 145 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:53:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:53:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:53:45] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-06-05 20:53:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:53:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:53:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:53:47] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 2275 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:53:47] [INFO ] Redundant transitions in 20 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:53:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:53:47] [INFO ] Invariant cache hit.
[2025-06-05 20:53:47] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:59] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:00] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:00] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:00] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:00] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:01] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:01] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:01] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:02] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:02] [INFO ] Deduced a trap composed of 32 places in 393 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:02] [INFO ] Deduced a trap composed of 32 places in 464 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:03] [INFO ] Deduced a trap composed of 32 places in 376 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:03] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:03] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:04] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:04] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:04] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:05] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:05] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:05] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:06] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:07] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:07] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:07] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:08] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:08] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:08] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:09] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:09] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:09] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:09] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:10] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:10] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:10] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:11] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 80 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 35/80 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:33] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:33] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:33] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:34] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:34] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:34] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:34] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:35] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:35] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:37] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:37] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:37] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:37] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:38] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:38] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:38] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:41] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:41] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:42] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:42] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 100 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62316ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62320ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64768 ms. Remains : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 102 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 263 steps (0 resets) in 11 ms. (21 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 13 factoid took 479 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
[2025-06-05 20:54:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:54:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:54:52] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-06-05 20:54:52] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 243 ms returned sat
[2025-06-05 20:54:55] [INFO ] [Real]Absence check using state equation in 2428 ms returned sat
[2025-06-05 20:54:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:54:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2025-06-05 20:54:56] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 179 ms returned sat
[2025-06-05 20:54:57] [INFO ] [Nat]Absence check using state equation in 1189 ms returned sat
[2025-06-05 20:54:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:54:57] [INFO ] [Nat]Added 111 Read/Feed constraints in 163 ms returned sat
[2025-06-05 20:54:57] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 49 ms.
[2025-06-05 20:54:58] [INFO ] Added : 1 causal constraints over 1 iterations in 205 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2025-06-05 20:54:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:54:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:55:00] [INFO ] [Real]Absence check using 21 positive place invariants in 31 ms returned sat
[2025-06-05 20:55:02] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 1792 ms returned sat
[2025-06-05 20:55:03] [INFO ] [Real]Absence check using state equation in 1562 ms returned sat
[2025-06-05 20:55:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 20:55:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2025-06-05 20:55:06] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 180 ms returned sat
[2025-06-05 20:55:07] [INFO ] [Nat]Absence check using state equation in 1527 ms returned sat
[2025-06-05 20:55:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:55:07] [INFO ] [Nat]Added 111 Read/Feed constraints in 114 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:07] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 13 ms to minimize.
[2025-06-05 20:55:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2025-06-05 20:55:07] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 62 ms.
[2025-06-05 20:55:08] [INFO ] Added : 2 causal constraints over 2 iterations in 269 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4067 reset in 1167 ms.
Product exploration explored 100000 steps with 4108 reset in 1191 ms.
Built C files in :
/tmp/ltsmin13746551851662868560
[2025-06-05 20:55:10] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2025-06-05 20:55:10] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13746551851662868560
Running compilation step : cd /tmp/ltsmin13746551851662868560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13746551851662868560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13746551851662868560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 123 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 125 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:55:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:55:14] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-06-05 20:55:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:55:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:55:15] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:55:15] [INFO ] Redundant transitions in 27 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:55:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:55:15] [INFO ] Invariant cache hit.
[2025-06-05 20:55:15] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:26] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:26] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:27] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:27] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:27] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:28] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:28] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:28] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:28] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:29] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:29] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:29] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:29] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:30] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:30] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:30] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:31] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:31] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:31] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:31] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:33] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:33] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:33] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:33] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:34] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:34] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:34] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:35] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:35] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:35] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:36] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:36] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:36] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:36] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:37] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:45] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:46] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:46] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:46] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:46] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 85 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:00] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:00] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:00] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:01] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:01] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:02] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:02] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:04] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:05] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:05] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:05] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:05] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:06] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:06] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:06] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:06] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:06] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:07] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 103 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62017ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62020ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64245 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin18160866676547302464
[2025-06-05 20:56:17] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2025-06-05 20:56:18] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18160866676547302464
Running compilation step : cd /tmp/ltsmin18160866676547302464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18160866676547302464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18160866676547302464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-05 20:56:21] [INFO ] Flatten gal took : 48 ms
[2025-06-05 20:56:21] [INFO ] Flatten gal took : 50 ms
[2025-06-05 20:56:21] [INFO ] Time to serialize gal into /tmp/LTL11912971948024331286.gal : 8 ms
[2025-06-05 20:56:21] [INFO ] Time to serialize properties into /tmp/LTL10152579026861550359.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11912971948024331286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1522179569436273650.hoa' '-atoms' '/tmp/LTL10152579026861550359.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10152579026861550359.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1522179569436273650.hoa
Detected timeout of ITS tools.
[2025-06-05 20:56:36] [INFO ] Flatten gal took : 50 ms
[2025-06-05 20:56:36] [INFO ] Flatten gal took : 50 ms
[2025-06-05 20:56:36] [INFO ] Time to serialize gal into /tmp/LTL10233713379888311368.gal : 8 ms
[2025-06-05 20:56:36] [INFO ] Time to serialize properties into /tmp/LTL3274014469537470817.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10233713379888311368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3274014469537470817.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((((wait_ack_2>=1)&&(ACK>=1))&&(FMCb>=1))||(((wait_ack_81>=1)&&(ACK>=1))&&(FMCb>=1)))||((((wait_ack_64>=1)&&(ACK>=1))&&...4731
Formula 0 simplified : F(G!"((((((((((wait_ack_2>=1)&&(ACK>=1))&&(FMCb>=1))||(((wait_ack_81>=1)&&(ACK>=1))&&(FMCb>=1)))||((((wait_ack_64>=1)&&(ACK>=1))&&(F...4717
Detected timeout of ITS tools.
[2025-06-05 20:56:51] [INFO ] Flatten gal took : 59 ms
[2025-06-05 20:56:51] [INFO ] Applying decomposition
[2025-06-05 20:56:51] [INFO ] Flatten gal took : 50 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/graph12513821885640778813.txt' '-o' '/tmp/graph12513821885640778813.bin' '-w' '/tmp/graph12513821885640778813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12513821885640778813.bin' '-l' '-1' '-v' '-w' '/tmp/graph12513821885640778813.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:56:51] [INFO ] Decomposing Gal with order
[2025-06-05 20:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:56:51] [INFO ] Removed a total of 2295 redundant transitions.
[2025-06-05 20:56:51] [INFO ] Flatten gal took : 168 ms
[2025-06-05 20:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1028 labels/synchronizations in 21 ms.
[2025-06-05 20:56:52] [INFO ] Time to serialize gal into /tmp/LTL8917221056147104401.gal : 8 ms
[2025-06-05 20:56:52] [INFO ] Time to serialize properties into /tmp/LTL9124942811292190291.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8917221056147104401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9124942811292190291.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((((i2.i1.u14.wait_ack_2>=1)&&(i2.i1.u13.ACK>=1))&&(i4.u16.FMCb>=1))||(((i2.i1.u14.wait_ack_81>=1)&&(i2.i1.u13.ACK>=1))...7525
Formula 0 simplified : F(G!"((((((((((i2.i1.u14.wait_ack_2>=1)&&(i2.i1.u13.ACK>=1))&&(i4.u16.FMCb>=1))||(((i2.i1.u14.wait_ack_81>=1)&&(i2.i1.u13.ACK>=1))&&...7511
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-11 finished in 257261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 94 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:57:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:57:07] [INFO ] Implicit Places using invariants in 467 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 469 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 99 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2025-06-05 20:57:07] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2025-06-05 20:57:07] [INFO ] Computed 35 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:57:08] [INFO ] Implicit Places using invariants in 430 ms returned []
[2025-06-05 20:57:08] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2025-06-05 20:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:57:08] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:57:10] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2270 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2934 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-12
Product exploration explored 100000 steps with 1842 reset in 508 ms.
Stack based approach found an accepted trace after 1805 steps with 28 reset with depth 152 and stack size 152 in 10 ms.
FORMULA SafeBus-COL-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-12 finished in 3511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 163 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 103 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:57:10] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-05 20:57:10] [INFO ] Computed 45 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:57:10] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-05 20:57:10] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:57:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:57:11] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:57:11] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:57:11] [INFO ] Redundant transitions in 19 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:57:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:57:11] [INFO ] Invariant cache hit.
[2025-06-05 20:57:11] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:22] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:22] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:23] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:23] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:23] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:23] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:24] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:24] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:24] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:24] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:25] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:25] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:25] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:26] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:26] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:26] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:26] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:27] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:27] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:27] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:28] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:29] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:29] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:29] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:30] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:30] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:30] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:31] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:31] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:31] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:32] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:32] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:32] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:32] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:33] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:41] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:42] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:42] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:42] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:42] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 85 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:55] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:56] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:56] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:57] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:57] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:57] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:58] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:00] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:01] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:01] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:01] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:01] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:01] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:02] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:02] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:02] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:02] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:03] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 103 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61961ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61965ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63029 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 690 ms.
Stack based approach found an accepted trace after 528 steps with 0 reset with depth 529 and stack size 529 in 3 ms.
FORMULA SafeBus-COL-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-13 finished in 63885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F((G(F(!p0))||(F(!p0)&&p1)))&&F((!p2||X(X(p3))))))||(F((X((!p2||X(X(p3))))&&F((G(F(!p0))||(F(!p0)&&p5)))))&&p4))))'
Support contains 60 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:58:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:58:14] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-06-05 20:58:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:58:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:58:17] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 2450 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:58:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:58:17] [INFO ] Invariant cache hit.
[2025-06-05 20:58:17] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:28] [INFO ] Deduced a trap composed of 32 places in 330 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:28] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:28] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:28] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:29] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:29] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:29] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:29] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:30] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:30] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:30] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:31] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:31] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:31] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:31] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:32] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:32] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:32] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:32] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:33] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:34] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:34] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:35] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:35] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:35] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:36] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:36] [INFO ] Deduced a trap composed of 32 places in 410 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:37] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:37] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:37] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:37] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:38] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:38] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:38] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:39] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:47] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:48] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:48] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:48] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:49] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 85 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:00] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:01] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:01] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:02] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:02] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:02] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:03] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:05] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:05] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:06] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:06] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:06] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:06] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:06] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:06] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:07] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:07] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:08] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:19] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 104 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62135ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62138ms
Finished structural reductions in LTL mode , in 1 iterations and 64606 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 813 ms :[(OR p0 (AND p2 (NOT p3))), p0, (AND p2 (NOT p3)), (AND p2 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p2 (NOT p3)), (AND p0 (NOT p3)), (AND p2 (NOT p3)), (AND p2 p0 (NOT p3)), (AND p2 p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 p2 (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 497 ms.
Product exploration explored 100000 steps with 50000 reset in 510 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p4 p5 (NOT p2) (NOT p0) p3), (X (NOT p2)), (X p5), (X p4), (X (NOT (AND p2 (NOT p5)))), (X (NOT (AND p4 (NOT p5)))), (X (NOT p0)), (X (NOT (AND p0 p2 p5))), (X (X (NOT p2))), (X (X p3)), (X (X p5)), (X (X p4)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p5)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p5))))), (X (X (NOT (AND p4 (NOT p5))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 p5))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 20 ms. Reduced automaton from 17 states, 39 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLFireability-14 finished in 66563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(p1 U p2))))))'
Support contains 143 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:59:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:59:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:59:21] [INFO ] Implicit Places using invariants in 179 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 181 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 3 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p2), p0, p0, (AND p0 (NOT p2))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 466 ms.
Product exploration explored 100000 steps with 50000 reset in 474 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLFireability-15 finished in 1351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&X(F(!p1))) U X((p0 U p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(p1))||p0))&&X(F(p2))))'
Found a Shortening insensitive property : SafeBus-COL-10-LTLFireability-07
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 18 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 20:59:22] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:59:23] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-06-05 20:59:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:59:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:59:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 20:59:25] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 2533 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 20:59:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 20:59:25] [INFO ] Invariant cache hit.
[2025-06-05 20:59:25] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:36] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:36] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:37] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:37] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:37] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:37] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:38] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:38] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:38] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:38] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:39] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:39] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:39] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:40] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:40] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:40] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:40] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:41] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:41] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:41] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:42] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:43] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:43] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:43] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:44] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:44] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:44] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:45] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:45] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:45] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:46] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:46] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:46] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:46] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:47] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:56] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:56] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:56] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:56] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:57] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 85 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:09] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:09] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:09] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:10] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:11] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:11] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:11] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:14] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:14] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:15] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:15] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:15] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:15] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:15] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:15] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:15] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:16] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:16] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 103 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62127ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62132ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 64689 ms. Remains : 306/306 places, 1531/1531 transitions.
Running random walk in product with property : SafeBus-COL-10-LTLFireability-07
Product exploration explored 100000 steps with 13332 reset in 457 ms.
Product exploration explored 100000 steps with 13424 reset in 477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 99 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 391 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-06-05 21:00:29] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:00:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 21:00:30] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-06-05 21:00:30] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 317 ms returned sat
[2025-06-05 21:00:31] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2025-06-05 21:00:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 21:00:31] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2025-06-05 21:00:31] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 34 ms returned sat
[2025-06-05 21:00:32] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2025-06-05 21:00:32] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 21:00:32] [INFO ] [Nat]Added 111 Read/Feed constraints in 73 ms returned sat
[2025-06-05 21:00:32] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 42 ms.
[2025-06-05 21:00:33] [INFO ] Added : 1 causal constraints over 1 iterations in 170 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-05 21:00:33] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:00:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 21:00:34] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2025-06-05 21:00:34] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 805 ms returned sat
[2025-06-05 21:00:37] [INFO ] [Real]Absence check using state equation in 2876 ms returned sat
[2025-06-05 21:00:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 21:00:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2025-06-05 21:00:38] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 46 ms returned sat
[2025-06-05 21:00:40] [INFO ] [Nat]Absence check using state equation in 1778 ms returned sat
[2025-06-05 21:00:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 21:00:40] [INFO ] [Nat]Added 111 Read/Feed constraints in 88 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:40] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:40] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 8 ms to minimize.
[2025-06-05 21:00:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2025-06-05 21:00:41] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 48 ms.
[2025-06-05 21:00:41] [INFO ] Added : 4 causal constraints over 3 iterations in 308 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 21:00:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:00:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:00:41] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-06-05 21:00:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:00:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:00:41] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 21:00:43] [INFO ] Implicit Places using invariants and state equation in 2188 ms returned []
Implicit Place search using SMT with State Equation took 2562 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 21:00:43] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:00:43] [INFO ] Invariant cache hit.
[2025-06-05 21:00:43] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:55] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:55] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:55] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:55] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:56] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:56] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:56] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:57] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:57] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:57] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:57] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:58] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:58] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:58] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:58] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:59] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:59] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:59] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:00] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:00] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:01] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:01] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:02] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:02] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:02] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:03] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:03] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:03] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:04] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:04] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:04] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:04] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:05] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:05] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:05] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:14] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:15] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:15] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:15] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:15] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 21 ms to minimize.
SMT process timed out in 31945ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 31948ms
Finished structural reductions in LTL mode , in 1 iterations and 34520 ms. Remains : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 271 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 112 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 370 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-06-05 21:01:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 21:01:17] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-06-05 21:01:18] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 316 ms returned sat
[2025-06-05 21:01:18] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2025-06-05 21:01:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 21:01:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2025-06-05 21:01:19] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 36 ms returned sat
[2025-06-05 21:01:20] [INFO ] [Nat]Absence check using state equation in 934 ms returned sat
[2025-06-05 21:01:20] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 21:01:20] [INFO ] [Nat]Added 111 Read/Feed constraints in 74 ms returned sat
[2025-06-05 21:01:20] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 46 ms.
[2025-06-05 21:01:20] [INFO ] Added : 1 causal constraints over 1 iterations in 178 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-05 21:01:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 21:01:21] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2025-06-05 21:01:22] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 806 ms returned sat
[2025-06-05 21:01:25] [INFO ] [Real]Absence check using state equation in 2867 ms returned sat
[2025-06-05 21:01:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 21:01:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2025-06-05 21:01:26] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 47 ms returned sat
[2025-06-05 21:01:27] [INFO ] [Nat]Absence check using state equation in 1761 ms returned sat
[2025-06-05 21:01:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 21:01:28] [INFO ] [Nat]Added 111 Read/Feed constraints in 87 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:28] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:28] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 8 ms to minimize.
[2025-06-05 21:01:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2025-06-05 21:01:28] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 44 ms.
[2025-06-05 21:01:28] [INFO ] Added : 4 causal constraints over 3 iterations in 296 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 13296 reset in 465 ms.
Product exploration explored 100000 steps with 13329 reset in 484 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 134 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:01:30] [INFO ] Redundant transitions in 21 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-05 21:01:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:01:30] [INFO ] Invariant cache hit.
[2025-06-05 21:01:30] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:41] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:41] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:41] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:42] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:42] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:42] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:43] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:43] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:43] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:43] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:44] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:44] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:44] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:45] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:45] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:45] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:45] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:46] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:46] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:46] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:47] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:48] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:48] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:48] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:49] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:49] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:49] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:50] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:50] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:50] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:51] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:51] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:51] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:51] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:52] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:01] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:01] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:01] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:02] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:02] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 21 ms to minimize.
SMT process timed out in 32227ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 32232ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32400 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin13412281337572805243
[2025-06-05 21:02:02] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13412281337572805243
Running compilation step : cd /tmp/ltsmin13412281337572805243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13412281337572805243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13412281337572805243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-05 21:02:05] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:02:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:02:05] [INFO ] Implicit Places using invariants in 381 ms returned []
[2025-06-05 21:02:05] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:02:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:02:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 21:02:08] [INFO ] Implicit Places using invariants and state equation in 2116 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-05 21:02:08] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-05 21:02:08] [INFO ] Invariant cache hit.
[2025-06-05 21:02:08] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:19] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:19] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:19] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:19] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:20] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:20] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:20] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:21] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:21] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:21] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:21] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:22] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:22] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:22] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:22] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:23] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:23] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:23] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:24] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:24] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:25] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:25] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:26] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:26] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:26] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:27] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:27] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:27] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:28] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:28] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:28] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:28] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:29] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:29] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:29] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:39] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:39] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:39] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:39] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:40] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 85 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:51] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:52] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:52] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:53] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:53] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:54] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:54] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:58] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:58] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:58] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:58] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:58] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:58] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:58] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:59] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 103 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62212ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62217ms
Finished structural reductions in LTL mode , in 1 iterations and 64728 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin765380013222047623
[2025-06-05 21:03:10] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin765380013222047623
Running compilation step : cd /tmp/ltsmin765380013222047623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin765380013222047623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin765380013222047623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-05 21:03:13] [INFO ] Flatten gal took : 48 ms
[2025-06-05 21:03:13] [INFO ] Flatten gal took : 48 ms
[2025-06-05 21:03:13] [INFO ] Time to serialize gal into /tmp/LTL17800144902168870299.gal : 7 ms
[2025-06-05 21:03:13] [INFO ] Time to serialize properties into /tmp/LTL5239955144683984634.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17800144902168870299.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5261237836655898992.hoa' '-atoms' '/tmp/LTL5239955144683984634.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5239955144683984634.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5261237836655898992.hoa
Detected timeout of ITS tools.
[2025-06-05 21:03:28] [INFO ] Flatten gal took : 48 ms
[2025-06-05 21:03:28] [INFO ] Flatten gal took : 47 ms
[2025-06-05 21:03:28] [INFO ] Time to serialize gal into /tmp/LTL5929681059795698668.gal : 7 ms
[2025-06-05 21:03:28] [INFO ] Time to serialize properties into /tmp/LTL2188882552309680144.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5929681059795698668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2188882552309680144.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(("(((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_1>=1)&&(FMC_1>=1)))||(((cable_used_4>=1)&&(FMC_4>=1))||((cable_used_5>=1)&&(F...1451
Formula 0 simplified : G(!"(((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_1>=1)&&(FMC_1>=1)))||(((cable_used_4>=1)&&(FMC_4>=1))||((cable_used_5>=1)&&(FMC...1435
Detected timeout of ITS tools.
[2025-06-05 21:03:43] [INFO ] Flatten gal took : 51 ms
[2025-06-05 21:03:43] [INFO ] Applying decomposition
[2025-06-05 21:03:43] [INFO ] Flatten gal took : 48 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/graph8248424310477137379.txt' '-o' '/tmp/graph8248424310477137379.bin' '-w' '/tmp/graph8248424310477137379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8248424310477137379.bin' '-l' '-1' '-v' '-w' '/tmp/graph8248424310477137379.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:03:44] [INFO ] Decomposing Gal with order
[2025-06-05 21:03:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:03:44] [INFO ] Removed a total of 2579 redundant transitions.
[2025-06-05 21:03:44] [INFO ] Flatten gal took : 150 ms
[2025-06-05 21:03:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 769 labels/synchronizations in 19 ms.
[2025-06-05 21:03:44] [INFO ] Time to serialize gal into /tmp/LTL1689679872570085139.gal : 7 ms
[2025-06-05 21:03:44] [INFO ] Time to serialize properties into /tmp/LTL11169384949245942973.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1689679872570085139.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11169384949245942973.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(("(((((i0.u18.cable_used_0>=1)&&(i1.i1.u15.FMC_0>=1))||((i0.u18.cable_used_1>=1)&&(i1.i1.u15.FMC_1>=1)))||(((i0.u18.cable_used_4...2179
Formula 0 simplified : G(!"(((((i0.u18.cable_used_0>=1)&&(i1.i1.u15.FMC_0>=1))||((i0.u18.cable_used_1>=1)&&(i1.i1.u15.FMC_1>=1)))||(((i0.u18.cable_used_4>=...2163
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-07 finished in 276665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(F((p1&&G(p2))))))))'
[2025-06-05 21:03:59] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6418617835749145620
[2025-06-05 21:03:59] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2025-06-05 21:03:59] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6418617835749145620
Running compilation step : cd /tmp/ltsmin6418617835749145620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-05 21:03:59] [INFO ] Applying decomposition
[2025-06-05 21:03:59] [INFO ] Flatten gal took : 55 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/graph1396701362961307607.txt' '-o' '/tmp/graph1396701362961307607.bin' '-w' '/tmp/graph1396701362961307607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1396701362961307607.bin' '-l' '-1' '-v' '-w' '/tmp/graph1396701362961307607.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:03:59] [INFO ] Decomposing Gal with order
[2025-06-05 21:03:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:03:59] [INFO ] Removed a total of 3559 redundant transitions.
[2025-06-05 21:03:59] [INFO ] Flatten gal took : 137 ms
[2025-06-05 21:03:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 601 labels/synchronizations in 18 ms.
[2025-06-05 21:03:59] [INFO ] Time to serialize gal into /tmp/LTLFireability7240096936136975127.gal : 6 ms
[2025-06-05 21:03:59] [INFO ] Time to serialize properties into /tmp/LTLFireability1552819311835166161.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7240096936136975127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1552819311835166161.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((X(((F("((((((i3.u17.cable_used_0>=1)&&(i2.i1.u14.FMC_0>=1))||((i3.u17.cable_used_1>=1)&&(i2.i1.u14.FMC_1>=1)))||(((i3.u17.cable_use...2105
Formula 0 simplified : X((G!"((((((i3.u17.cable_used_0>=1)&&(i2.i1.u14.FMC_0>=1))||((i3.u17.cable_used_1>=1)&&(i2.i1.u14.FMC_1>=1)))||(((i3.u17.cable_used_...2091
Compilation finished in 3204 ms.
Running link step : cd /tmp/ltsmin6418617835749145620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6418617835749145620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((<>((LTLAPp0==true))&&X(<>(!(LTLAPp1==true)))) U X(((LTLAPp0==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin6418617835749145620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((<>((LTLAPp0==true))&&X(<>(!(LTLAPp1==true)))) U X(((LTLAPp0==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6418617835749145620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 119561 ms.
FORMULA SafeBus-COL-10-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin6418617835749145620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((X(X((LTLAPp4==true)))||(LTLAPp3==true)))&&X(<>((LTLAPp5==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin6418617835749145620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((X(X((LTLAPp4==true)))||(LTLAPp3==true)))&&X(<>((LTLAPp5==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6418617835749145620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp6==true))||X(X(<>(((LTLAPp7==true)&&[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin6418617835749145620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp6==true))||X(X(<>(((LTLAPp7==true)&&[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin6418617835749145620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((<>((LTLAPp0==true))&&X(<>(!(LTLAPp1==true)))) U X(((LTLAPp0==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-05 21:32:30] [INFO ] Applying decomposition
[2025-06-05 21:32:31] [INFO ] Flatten gal took : 647 ms
[2025-06-05 21:32:31] [INFO ] Decomposing Gal with order
[2025-06-05 21:32:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:32:32] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cable_free in partition [AMC_0],[AMC_1, wait_ack_1],[AMC_2, wait_ack_2],[AMC_3, wait_ack_3],[AMC_4, wait_ack_4],[AMC_5, wait_ack_5],[AMC_6, wait_ack_6],[AMC_7, wait_ack_7],[AMC_8, wait_ack_8],[AMC_9, wait_ack_9],[AMC_10, wait_ack_10],[AMC_11],[AMC_12, wait_ack_12],[AMC_13, wait_ack_13],[AMC_14, wait_ack_14],[AMC_15, wait_ack_15],[AMC_16, wait_ack_16],[AMC_17, wait_ack_17],[AMC_18, wait_ack_18],[AMC_19, wait_ack_19],[AMC_20, wait_ack_20],[AMC_21, wait_ack_21],[AMC_22],[AMC_23, wait_ack_23],[AMC_24, wait_ack_24],[AMC_25, wait_ack_25],[AMC_26, wait_ack_26],[AMC_27, wait_ack_27],[AMC_28, wait_ack_28],[AMC_29, wait_ack_29],[AMC_30, wait_ack_30],[AMC_31, wait_ack_31],[AMC_32, wait_ack_32],[AMC_33],[AMC_34, wait_ack_34],[AMC_35, wait_ack_35],[AMC_36, wait_ack_36],[AMC_37, wait_ack_37],[AMC_38, wait_ack_38],[AMC_39, wait_ack_39],[AMC_40, wait_ack_40],[AMC_41, wait_ack_41],[AMC_42, wait_ack_42],[AMC_43, wait_ack_43],[AMC_44],[AMC_45, wait_ack_45],[AMC_46, wait_ack_46],[AMC_47, wait_ack_47],[AMC_48, wait_ack_48],[AMC_49, wait_ack_49],[AMC_50, wait_ack_50],[AMC_51, wait_ack_51],[AMC_52, wait_ack_52],[AMC_53, wait_ack_53],[AMC_54, wait_ack_54],[AMC_55],[AMC_56, wait_ack_56],[AMC_57, wait_ack_57],[AMC_58, wait_ack_58],[AMC_59, wait_ack_59],[AMC_60, wait_ack_60],[AMC_61, wait_ack_61],[AMC_62, wait_ack_62],[AMC_63, wait_ack_63],[AMC_64, wait_ack_64],[AMC_65, wait_ack_65],[AMC_66],[AMC_67, wait_ack_67],[AMC_68, wait_ack_68],[AMC_69, wait_ack_69],[AMC_70, wait_ack_70],[AMC_71, wait_ack_71],[AMC_72, wait_ack_72],[AMC_73, wait_ack_73],[AMC_74, wait_ack_74],[AMC_75, wait_ack_75],[AMC_76, wait_ack_76],[AMC_77],[AMC_78, wait_ack_78],[AMC_79, wait_ack_79],[AMC_80, wait_ack_80],[AMC_81, wait_ack_81],[AMC_82, wait_ack_82],[AMC_83, wait_ack_83],[AMC_84, wait_ack_84],[AMC_85, wait_ack_85],[AMC_86, wait_ack_86],[AMC_87, wait_ack_87],[AMC_88],[AMC_89, wait_ack_89],[AMC_90, wait_ack_90],[AMC_91, wait_ack_91],[AMC_92, wait_ack_92],[AMC_93, wait_ack_93],[AMC_94, wait_ack_94],[AMC_95, wait_ack_95],[AMC_96, wait_ack_96],[AMC_97, wait_ack_97],[AMC_98, wait_ack_98],[AMC_99],[Cpt2_0, Cpt1_0, cable_used_0, FMC_0, wait_cable_0, listen_0, RMC_0, PMC_0, MSG_0, wait_msg_0, loop_em_0],[Cpt2_1, Cpt1_1, cable_used_1, FMC_1, wait_cable_1, listen_1, RMC_1, PMC_1, MSG_1, wait_msg_1, loop_em_1],[Cpt2_2, Cpt1_2, cable_used_2, FMC_2, wait_cable_2, listen_2, RMC_2, PMC_2, MSG_2, wait_msg_2, loop_em_2],[Cpt2_3, Cpt1_3, cable_used_3, FMC_3, wait_cable_3, listen_3, RMC_3, PMC_3, MSG_3, wait_msg_3, loop_em_3],[Cpt2_4, Cpt1_4, cable_used_4, FMC_4, wait_cable_4, listen_4, RMC_4, PMC_4, MSG_4, wait_msg_4, loop_em_4],[Cpt2_5, Cpt1_5, cable_used_5, FMC_5, wait_cable_5, listen_5, RMC_5, PMC_5, MSG_5, wait_msg_5, loop_em_5],[Cpt2_6, Cpt1_6, cable_used_6, FMC_6, wait_cable_6, listen_6, RMC_6, PMC_6, MSG_6, wait_msg_6, loop_em_6],[Cpt2_7, Cpt1_7, cable_used_7, FMC_7, wait_cable_7, listen_7, RMC_7, PMC_7, MSG_7, wait_msg_7, loop_em_7],[Cpt2_8, Cpt1_8, cable_used_8, FMC_8, wait_cable_8, listen_8, RMC_8, PMC_8, MSG_8, wait_msg_8, loop_em_8],[Cpt2_9, Cpt1_9, cable_used_9, FMC_9, wait_cable_9, listen_9, RMC_9, PMC_9, MSG_9, wait_msg_9, loop_em_9],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-05 21:32:32] [INFO ] Flatten gal took : 421 ms
[2025-06-05 21:32:32] [INFO ] Time to serialize gal into /tmp/LTLFireability11367892245192786983.gal : 30 ms
[2025-06-05 21:32:32] [INFO ] Time to serialize properties into /tmp/LTLFireability11655060143829275800.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11367892245192786983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11655060143829275800.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !((X(((F("((((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_1>=1)&&(FMC_1>=1)))||(((cable_used_4>=1)&&(FMC_4>=1))||((cable_used_5>=1)&...1372
Formula 0 simplified : X((G!"((((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_1>=1)&&(FMC_1>=1)))||(((cable_used_4>=1)&&(FMC_4>=1))||((cable_used_5>=1)&&(...1358
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is SafeBus-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889264700724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;