About the Execution of ITS-Tools for PolyORBNT-PT-S05J30
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 | FFFFTFFFF?TFFFF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254400644.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 PolyORBNT-PT-S05J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254400644
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 198K 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 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 46K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 364K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749085712767
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 01:08:33] [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 01:08:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 01:08:34] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2025-06-05 01:08:34] [INFO ] Transformed 489 places.
[2025-06-05 01:08:34] [INFO ] Transformed 1400 transitions.
[2025-06-05 01:08:34] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2025-06-05 01:08:34] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-05 01:08:34] [INFO ] Reduced 555 identical enabling conditions.
[2025-06-05 01:08:34] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 385 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 488 transition count 744
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 488 transition count 744
Applied a total of 2 rules in 40 ms. Remains 488 /489 variables (removed 1) and now considering 744/745 (removed 1) transitions.
Running 738 sub problems to find dead transitions.
[2025-06-05 01:08:34] [INFO ] Flow matrix only has 740 transitions (discarded 4 similar events)
// Phase 1: matrix 740 rows 488 cols
[2025-06-05 01:08:34] [INFO ] Computed 82 invariants in 67 ms
[2025-06-05 01:08:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/488 variables, 11/82 constraints. Problems are: Problem set: 95 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1228 variables, and 82 constraints, problems are : Problem set: 95 solved, 643 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/488 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 643 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 95 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 95 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 95 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 11/488 variables, 11/82 constraints. Problems are: Problem set: 95 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:09] [INFO ] Deduced a trap composed of 24 places in 329 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:14] [INFO ] Deduced a trap composed of 139 places in 292 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:15] [INFO ] Deduced a trap composed of 140 places in 279 ms of which 66 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1228 variables, and 85 constraints, problems are : Problem set: 95 solved, 643 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/488 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/738 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40992ms problems are : Problem set: 95 solved, 643 unsolved
Search for dead transitions found 95 dead transitions in 41017ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2025-06-05 01:09:15] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 488 cols
[2025-06-05 01:09:15] [INFO ] Computed 82 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:09:16] [INFO ] Implicit Places using invariants in 893 ms returned []
[2025-06-05 01:09:16] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:09:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:09:20] [INFO ] Implicit Places using invariants and state equation in 3630 ms returned []
Implicit Place search using SMT with State Equation took 4542 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/489 places, 649/745 transitions.
Applied a total of 0 rules in 11 ms. Remains 488 /488 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45659 ms. Remains : 488/489 places, 649/745 transitions.
Support contains 385 out of 488 places after structural reductions.
[2025-06-05 01:09:20] [INFO ] Flatten gal took : 208 ms
[2025-06-05 01:09:20] [INFO ] Flatten gal took : 85 ms
[2025-06-05 01:09:21] [INFO ] Input system was already deterministic with 649 transitions.
RANDOM walk for 40000 steps (2799 resets) in 1498 ms. (26 steps per ms) remains 5/34 properties
BEST_FIRST walk for 40003 steps (579 resets) in 212 ms. (187 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (673 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (569 resets) in 126 ms. (314 steps per ms) remains 1/3 properties
[2025-06-05 01:09:21] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:09:21] [INFO ] Invariant cache hit.
[2025-06-05 01:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/454 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/487 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 645/1132 variables, 487/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1133 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1133 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1133 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1133/1133 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 488/488 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/454 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/487 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:22] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:22] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:23] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:23] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:23] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:23] [INFO ] Deduced a trap composed of 175 places in 229 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:24] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:24] [INFO ] Deduced a trap composed of 175 places in 219 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:24] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:24] [INFO ] Deduced a trap composed of 175 places in 193 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:25] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:25] [INFO ] Deduced a trap composed of 175 places in 215 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:25] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:25] [INFO ] Deduced a trap composed of 175 places in 186 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:25] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:26] [INFO ] Deduced a trap composed of 175 places in 228 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:26] [INFO ] Deduced a trap composed of 175 places in 218 ms of which 53 ms to minimize.
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Int declared 487/1133 variables, and 99 constraints, problems are : Problem set: 1 solved, 0 unsolved in 4126 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/488 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4770ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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' '!(F(G((p0 U p1))))'
Support contains 34 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 483 transition count 614
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 448 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 448 transition count 579
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 413 transition count 579
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 410 transition count 576
Applied a total of 146 rules in 104 ms. Remains 410 /488 variables (removed 78) and now considering 576/649 (removed 73) transitions.
Running 570 sub problems to find dead transitions.
[2025-06-05 01:09:27] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2025-06-05 01:09:27] [INFO ] Computed 77 invariants in 16 ms
[2025-06-05 01:09:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:31] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:31] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:32] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:32] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:32] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:32] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:33] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:33] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:33] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:33] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:33] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:34] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:34] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:34] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:34] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:35] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:35] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:35] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:35] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:35] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:36] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:37] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:37] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:37] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:37] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:37] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:38] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:38] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:38] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:38] [INFO ] Deduced a trap composed of 106 places in 234 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:39] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:39] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:39] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:39] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:39] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:40] [INFO ] Deduced a trap composed of 104 places in 179 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:40] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:41] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:41] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:41] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/982 variables, and 112 constraints, problems are : Problem set: 0 solved, 570 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:50] [INFO ] Deduced a trap composed of 104 places in 170 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:50] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:51] [INFO ] Deduced a trap composed of 107 places in 209 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:51] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:51] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:51] [INFO ] Deduced a trap composed of 106 places in 193 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:52] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:52] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:52] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:52] [INFO ] Deduced a trap composed of 76 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 01:09:53] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:53] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:53] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:53] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:53] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:54] [INFO ] Deduced a trap composed of 76 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 01:09:54] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:54] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:54] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:54] [INFO ] Deduced a trap composed of 104 places in 187 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:56] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:56] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:56] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:57] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:57] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:57] [INFO ] Deduced a trap composed of 106 places in 191 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:57] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:58] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:58] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:58] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:58] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:58] [INFO ] Deduced a trap composed of 106 places in 192 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:59] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:59] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:59] [INFO ] Deduced a trap composed of 106 places in 183 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:59] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:09:59] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:00] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/982 variables, and 150 constraints, problems are : Problem set: 0 solved, 570 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/570 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40434ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 40437ms
[2025-06-05 01:10:07] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:10:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:10:08] [INFO ] Implicit Places using invariants in 665 ms returned []
[2025-06-05 01:10:08] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:10:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:10:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:10:12] [INFO ] Implicit Places using invariants and state equation in 3906 ms returned []
Implicit Place search using SMT with State Equation took 4576 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:10:12] [INFO ] Redundant transitions in 31 ms returned []
Running 570 sub problems to find dead transitions.
[2025-06-05 01:10:12] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:10:12] [INFO ] Invariant cache hit.
[2025-06-05 01:10:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:16] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:17] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:17] [INFO ] Deduced a trap composed of 104 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:17] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:18] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:18] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:18] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:18] [INFO ] Deduced a trap composed of 104 places in 185 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:18] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:19] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:19] [INFO ] Deduced a trap composed of 104 places in 171 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:19] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:19] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:19] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:20] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:20] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:20] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:20] [INFO ] Deduced a trap composed of 104 places in 204 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:20] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:21] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:22] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:22] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:22] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:23] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:23] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:23] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:23] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:23] [INFO ] Deduced a trap composed of 106 places in 184 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:24] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:24] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:24] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:24] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:24] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:24] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:25] [INFO ] Deduced a trap composed of 107 places in 196 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:25] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:25] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:25] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:26] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:26] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:32] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:32] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:32] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:35] [INFO ] Deduced a trap composed of 76 places in 2284 ms of which 2147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:35] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:35] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:35] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:36] [INFO ] Deduced a trap composed of 104 places in 1228 ms of which 1090 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:37] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:38] [INFO ] Deduced a trap composed of 76 places in 1199 ms of which 1037 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:38] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:41] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:41] [INFO ] Deduced a trap composed of 106 places in 189 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:41] [INFO ] Deduced a trap composed of 106 places in 200 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:41] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:42] [INFO ] Deduced a trap composed of 106 places in 216 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:42] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:42] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:10:42] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 17 ms to minimize.
SMT process timed out in 30435ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 30438ms
Starting structural reductions in SI_LTL mode, iteration 1 : 410/488 places, 576/649 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75605 ms. Remains : 410/488 places, 576/649 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-00
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-00 finished in 75876 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((G(p0)||(!p1 U (p2||G(!p1)))))))))'
Support contains 14 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Applied a total of 0 rules in 23 ms. Remains 488 /488 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:10:42] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 488 cols
[2025-06-05 01:10:42] [INFO ] Computed 82 invariants in 13 ms
[2025-06-05 01:10:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 11/488 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:03] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1133 variables, and 83 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/488 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 11/488 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:21] [INFO ] Deduced a trap composed of 175 places in 250 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:21] [INFO ] Deduced a trap composed of 175 places in 254 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:21] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:22] [INFO ] Deduced a trap composed of 208 places in 252 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:22] [INFO ] Deduced a trap composed of 208 places in 262 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:22] [INFO ] Deduced a trap composed of 175 places in 263 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:23] [INFO ] Deduced a trap composed of 175 places in 304 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:23] [INFO ] Deduced a trap composed of 175 places in 222 ms of which 48 ms to minimize.
SMT process timed out in 40562ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 40564ms
[2025-06-05 01:11:23] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:11:24] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2025-06-05 01:11:24] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:11:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:11:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:11:29] [INFO ] Implicit Places using invariants and state equation in 4669 ms returned []
Implicit Place search using SMT with State Equation took 5676 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:11:29] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:11:29] [INFO ] Invariant cache hit.
[2025-06-05 01:11:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 11/488 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:48] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:54] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:54] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:55] [INFO ] Deduced a trap composed of 175 places in 240 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:55] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:55] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:55] [INFO ] Deduced a trap composed of 175 places in 251 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:56] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:56] [INFO ] Deduced a trap composed of 76 places in 216 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:56] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:59] [INFO ] Deduced a trap composed of 107 places in 225 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:59] [INFO ] Deduced a trap composed of 205 places in 239 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:11:59] [INFO ] Deduced a trap composed of 205 places in 233 ms of which 64 ms to minimize.
SMT process timed out in 30518ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30521ms
Finished structural reductions in LTL mode , in 1 iterations and 76792 ms. Remains : 488/488 places, 649/649 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-02
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-02 finished in 77133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0&&G(p1)))))'
Support contains 8 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 483 transition count 649
Applied a total of 5 rules in 14 ms. Remains 483 /488 variables (removed 5) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:12:00] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-05 01:12:00] [INFO ] Computed 77 invariants in 14 ms
[2025-06-05 01:12:00] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:19] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:20] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 59 ms to minimize.
SMT process timed out in 20434ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20435ms
[2025-06-05 01:12:20] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:12:21] [INFO ] Implicit Places using invariants in 946 ms returned []
[2025-06-05 01:12:21] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:12:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:12:26] [INFO ] Implicit Places using invariants and state equation in 4978 ms returned []
Implicit Place search using SMT with State Equation took 5930 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:12:26] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:12:26] [INFO ] Invariant cache hit.
[2025-06-05 01:12:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:47] [INFO ] Deduced a trap composed of 175 places in 261 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:47] [INFO ] Deduced a trap composed of 175 places in 265 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:47] [INFO ] Deduced a trap composed of 175 places in 258 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:47] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:48] [INFO ] Deduced a trap composed of 175 places in 247 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:48] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:56] [INFO ] Deduced a trap composed of 107 places in 212 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:56] [INFO ] Deduced a trap composed of 205 places in 218 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:12:56] [INFO ] Deduced a trap composed of 107 places in 219 ms of which 57 ms to minimize.
SMT process timed out in 30535ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30540ms
Starting structural reductions in LTL mode, iteration 1 : 483/488 places, 649/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56926 ms. Remains : 483/488 places, 649/649 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-03
Entered a terminal (fully accepting) state of product in 20610 steps with 1415 reset in 133 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-03 finished in 57270 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(p0))&&(F(p1) U X(X(!p0))))))'
Support contains 32 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 483 transition count 649
Applied a total of 5 rules in 13 ms. Remains 483 /488 variables (removed 5) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:12:57] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:12:57] [INFO ] Invariant cache hit.
[2025-06-05 01:12:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 77 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:19] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:19] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:19] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:21] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:21] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:22] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:23] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:24] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:25] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:25] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:13:25] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/1128 variables, and 82 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 12/18 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40374ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 40376ms
[2025-06-05 01:13:37] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:13:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:13:38] [INFO ] Implicit Places using invariants in 939 ms returned []
[2025-06-05 01:13:38] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:13:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:13:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:13:43] [INFO ] Implicit Places using invariants and state equation in 4915 ms returned []
Implicit Place search using SMT with State Equation took 5858 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:13:43] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:13:43] [INFO ] Invariant cache hit.
[2025-06-05 01:13:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:04] [INFO ] Deduced a trap composed of 175 places in 265 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:04] [INFO ] Deduced a trap composed of 175 places in 258 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:04] [INFO ] Deduced a trap composed of 175 places in 243 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:04] [INFO ] Deduced a trap composed of 175 places in 221 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:05] [INFO ] Deduced a trap composed of 175 places in 234 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:05] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:13] [INFO ] Deduced a trap composed of 107 places in 217 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:13] [INFO ] Deduced a trap composed of 205 places in 204 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:13] [INFO ] Deduced a trap composed of 107 places in 215 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:13] [INFO ] Deduced a trap composed of 205 places in 194 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:13] [INFO ] Deduced a trap composed of 107 places in 213 ms of which 56 ms to minimize.
SMT process timed out in 30372ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30374ms
Starting structural reductions in LTL mode, iteration 1 : 483/488 places, 649/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76630 ms. Remains : 483/488 places, 649/649 transitions.
Stuttering acceptance computed with spot in 408 ms :[true, true, true, (AND (NOT p1) p0), (NOT p0), true, (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-05
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-05 finished in 77071 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)) U (X(p2)&&p1)))'
Support contains 72 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 483 transition count 649
Applied a total of 5 rules in 12 ms. Remains 483 /488 variables (removed 5) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:14:14] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:14:14] [INFO ] Invariant cache hit.
[2025-06-05 01:14:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:14:34] [INFO ] Deduced a trap composed of 175 places in 238 ms of which 84 ms to minimize.
SMT process timed out in 20416ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20418ms
[2025-06-05 01:14:34] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:14:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:14:35] [INFO ] Implicit Places using invariants in 862 ms returned []
[2025-06-05 01:14:35] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:14:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:14:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:14:40] [INFO ] Implicit Places using invariants and state equation in 5020 ms returned []
Implicit Place search using SMT with State Equation took 5885 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:14:40] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:14:40] [INFO ] Invariant cache hit.
[2025-06-05 01:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:00] [INFO ] Deduced a trap composed of 175 places in 254 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:01] [INFO ] Deduced a trap composed of 175 places in 250 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:01] [INFO ] Deduced a trap composed of 175 places in 260 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:01] [INFO ] Deduced a trap composed of 175 places in 210 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:01] [INFO ] Deduced a trap composed of 175 places in 242 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:02] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:09] [INFO ] Deduced a trap composed of 107 places in 219 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:09] [INFO ] Deduced a trap composed of 205 places in 208 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:10] [INFO ] Deduced a trap composed of 107 places in 221 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:10] [INFO ] Deduced a trap composed of 205 places in 196 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:10] [INFO ] Deduced a trap composed of 107 places in 222 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:10] [INFO ] Deduced a trap composed of 205 places in 204 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:11] [INFO ] Deduced a trap composed of 107 places in 217 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:11] [INFO ] Deduced a trap composed of 205 places in 199 ms of which 41 ms to minimize.
SMT process timed out in 30545ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30548ms
Starting structural reductions in LTL mode, iteration 1 : 483/488 places, 649/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56868 ms. Remains : 483/488 places, 649/649 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-06
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-06 finished in 57018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(p1)) U (p2||X(X(p3)))))'
Support contains 225 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 483 transition count 649
Applied a total of 5 rules in 9 ms. Remains 483 /488 variables (removed 5) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:15:11] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:15:11] [INFO ] Invariant cache hit.
[2025-06-05 01:15:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:31] [INFO ] Deduced a trap composed of 175 places in 250 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:31] [INFO ] Deduced a trap composed of 175 places in 249 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:31] [INFO ] Deduced a trap composed of 175 places in 255 ms of which 83 ms to minimize.
SMT process timed out in 20544ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20546ms
[2025-06-05 01:15:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:15:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:15:32] [INFO ] Implicit Places using invariants in 828 ms returned []
[2025-06-05 01:15:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:15:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:15:36] [INFO ] Implicit Places using invariants and state equation in 3284 ms returned []
Implicit Place search using SMT with State Equation took 4115 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:15:36] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:15:36] [INFO ] Invariant cache hit.
[2025-06-05 01:15:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:56] [INFO ] Deduced a trap composed of 175 places in 256 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:56] [INFO ] Deduced a trap composed of 175 places in 256 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:56] [INFO ] Deduced a trap composed of 175 places in 249 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:57] [INFO ] Deduced a trap composed of 175 places in 233 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:57] [INFO ] Deduced a trap composed of 175 places in 247 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:15:57] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:05] [INFO ] Deduced a trap composed of 107 places in 223 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:05] [INFO ] Deduced a trap composed of 205 places in 209 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:05] [INFO ] Deduced a trap composed of 107 places in 215 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:06] [INFO ] Deduced a trap composed of 205 places in 202 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:06] [INFO ] Deduced a trap composed of 107 places in 221 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:06] [INFO ] Deduced a trap composed of 205 places in 228 ms of which 38 ms to minimize.
SMT process timed out in 30480ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30483ms
Starting structural reductions in LTL mode, iteration 1 : 483/488 places, 649/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55158 ms. Remains : 483/488 places, 649/649 transitions.
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-07
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-07 finished in 55513 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||G(p1)) U X(X((!p2&&F(p3)))))))'
Support contains 9 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 483 transition count 649
Applied a total of 5 rules in 16 ms. Remains 483 /488 variables (removed 5) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:16:06] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:16:06] [INFO ] Invariant cache hit.
[2025-06-05 01:16:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:27] [INFO ] Deduced a trap composed of 175 places in 248 ms of which 85 ms to minimize.
SMT process timed out in 20408ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20409ms
[2025-06-05 01:16:27] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:16:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:16:28] [INFO ] Implicit Places using invariants in 892 ms returned []
[2025-06-05 01:16:28] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:16:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:16:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:16:33] [INFO ] Implicit Places using invariants and state equation in 4879 ms returned []
Implicit Place search using SMT with State Equation took 5773 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:16:33] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:16:33] [INFO ] Invariant cache hit.
[2025-06-05 01:16:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:53] [INFO ] Deduced a trap composed of 175 places in 262 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:53] [INFO ] Deduced a trap composed of 175 places in 256 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:53] [INFO ] Deduced a trap composed of 175 places in 259 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:53] [INFO ] Deduced a trap composed of 175 places in 229 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:54] [INFO ] Deduced a trap composed of 175 places in 249 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:16:54] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:01] [INFO ] Deduced a trap composed of 107 places in 209 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:02] [INFO ] Deduced a trap composed of 205 places in 189 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:02] [INFO ] Deduced a trap composed of 107 places in 223 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:02] [INFO ] Deduced a trap composed of 205 places in 203 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:02] [INFO ] Deduced a trap composed of 107 places in 232 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:03] [INFO ] Deduced a trap composed of 205 places in 203 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:03] [INFO ] Deduced a trap composed of 107 places in 208 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:03] [INFO ] Deduced a trap composed of 205 places in 197 ms of which 40 ms to minimize.
SMT process timed out in 30444ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30447ms
Starting structural reductions in LTL mode, iteration 1 : 483/488 places, 649/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56653 ms. Remains : 483/488 places, 649/649 transitions.
Stuttering acceptance computed with spot in 559 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (NOT p3) p2), (OR (NOT p3) p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (NOT p3) p2), true, (NOT p3), (OR (NOT p3) p2), (OR (NOT p3) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-08 finished in 57240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(((X(F(p0))&&F(p1))||G(F(p0)))))))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 483 transition count 615
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 70 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 138 place count 414 transition count 580
Applied a total of 138 rules in 50 ms. Remains 414 /488 variables (removed 74) and now considering 580/649 (removed 69) transitions.
Running 574 sub problems to find dead transitions.
[2025-06-05 01:17:04] [INFO ] Flow matrix only has 576 transitions (discarded 4 similar events)
// Phase 1: matrix 576 rows 414 cols
[2025-06-05 01:17:04] [INFO ] Computed 77 invariants in 9 ms
[2025-06-05 01:17:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 6/414 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (OVERLAPS) 576/990 variables, 414/491 constraints. Problems are: Problem set: 0 solved, 574 unsolved
SMT process timed out in 20358ms, After SMT, problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 20360ms
[2025-06-05 01:17:24] [INFO ] Flow matrix only has 576 transitions (discarded 4 similar events)
[2025-06-05 01:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:17:25] [INFO ] Implicit Places using invariants in 702 ms returned []
[2025-06-05 01:17:25] [INFO ] Flow matrix only has 576 transitions (discarded 4 similar events)
[2025-06-05 01:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:17:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:17:29] [INFO ] Implicit Places using invariants and state equation in 4392 ms returned []
Implicit Place search using SMT with State Equation took 5095 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:17:29] [INFO ] Redundant transitions in 11 ms returned []
Running 574 sub problems to find dead transitions.
[2025-06-05 01:17:29] [INFO ] Flow matrix only has 576 transitions (discarded 4 similar events)
[2025-06-05 01:17:29] [INFO ] Invariant cache hit.
[2025-06-05 01:17:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 6/414 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:45] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:45] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:45] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:45] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:45] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:50] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:50] [INFO ] Deduced a trap composed of 108 places in 194 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:51] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:51] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:52] [INFO ] Deduced a trap composed of 105 places in 181 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:52] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 45 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:58] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:58] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:17:59] [INFO ] Deduced a trap composed of 108 places in 193 ms of which 43 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 2.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 9.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 8.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/990 variables, and 91 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 6/414 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:06] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:07] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:07] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:07] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:07] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:08] [INFO ] Deduced a trap composed of 108 places in 176 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:09] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:09] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:10] [INFO ] Deduced a trap composed of 108 places in 177 ms of which 38 ms to minimize.
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:12] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:12] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:12] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:13] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:13] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:13] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:18:13] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 38 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 16/107 constraints. Problems are: Problem set: 1 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/990 variables, and 107 constraints, problems are : Problem set: 1 solved, 573 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/574 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 1 solved, 573 unsolved
Search for dead transitions found 1 dead transitions in 60359ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 414/488 places, 579/649 transitions.
Graph (complete) has 2226 edges and 414 vertex of which 413 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 413 /414 variables (removed 1) and now considering 579/579 (removed 0) transitions.
[2025-06-05 01:18:30] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 413 cols
[2025-06-05 01:18:30] [INFO ] Computed 76 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:18:30] [INFO ] Implicit Places using invariants in 662 ms returned []
[2025-06-05 01:18:30] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2025-06-05 01:18:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:18:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:18:35] [INFO ] Implicit Places using invariants and state equation in 4862 ms returned []
Implicit Place search using SMT with State Equation took 5526 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 413/488 places, 579/649 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91440 ms. Remains : 413/488 places, 579/649 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-09
Product exploration explored 100000 steps with 6715 reset in 430 ms.
Product exploration explored 100000 steps with 6677 reset in 499 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 2224 edges and 413 vertex of which 412 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 205 steps (13 resets) in 5 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 212 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 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 413 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 579/579 transitions.
Applied a total of 0 rules in 33 ms. Remains 413 /413 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Running 573 sub problems to find dead transitions.
[2025-06-05 01:18:37] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2025-06-05 01:18:37] [INFO ] Invariant cache hit.
[2025-06-05 01:18:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 3 (OVERLAPS) 6/413 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 5 (OVERLAPS) 575/988 variables, 413/489 constraints. Problems are: Problem set: 0 solved, 573 unsolved
SMT process timed out in 20364ms, After SMT, problems are : Problem set: 0 solved, 573 unsolved
Search for dead transitions found 0 dead transitions in 20365ms
[2025-06-05 01:18:57] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2025-06-05 01:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:18:58] [INFO ] Implicit Places using invariants in 742 ms returned []
[2025-06-05 01:18:58] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2025-06-05 01:18:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:18:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:19:03] [INFO ] Implicit Places using invariants and state equation in 4746 ms returned []
Implicit Place search using SMT with State Equation took 5491 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:19:03] [INFO ] Redundant transitions in 10 ms returned []
Running 573 sub problems to find dead transitions.
[2025-06-05 01:19:03] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2025-06-05 01:19:03] [INFO ] Invariant cache hit.
[2025-06-05 01:19:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 3 (OVERLAPS) 6/413 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 5 (OVERLAPS) 575/988 variables, 413/489 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/988 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/988 variables, and 490 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 413/413 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 573 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 3 (OVERLAPS) 6/413 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/988 variables, and 489 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 413/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/573 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 573 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86290 ms. Remains : 413/413 places, 579/579 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 2224 edges and 413 vertex of which 412 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 372 steps (25 resets) in 8 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6737 reset in 383 ms.
Product exploration explored 100000 steps with 6734 reset in 404 ms.
Built C files in :
/tmp/ltsmin12063464006187256436
[2025-06-05 01:20:05] [INFO ] Computing symmetric may disable matrix : 579 transitions.
[2025-06-05 01:20:05] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:20:05] [INFO ] Computing symmetric may enable matrix : 579 transitions.
[2025-06-05 01:20:05] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:20:05] [INFO ] Computing Do-Not-Accords matrix : 579 transitions.
[2025-06-05 01:20:05] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:20:05] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12063464006187256436
Running compilation step : cd /tmp/ltsmin12063464006187256436;'/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 1766 ms.
Running link step : cd /tmp/ltsmin12063464006187256436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12063464006187256436;'/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/stateBased5066191312669491190.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 579/579 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 413 transition count 578
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 412 transition count 578
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 411 transition count 577
Applied a total of 4 rules in 47 ms. Remains 411 /413 variables (removed 2) and now considering 577/579 (removed 2) transitions.
Running 571 sub problems to find dead transitions.
[2025-06-05 01:20:20] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2025-06-05 01:20:20] [INFO ] Computed 76 invariants in 10 ms
[2025-06-05 01:20:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (OVERLAPS) 5/411 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (OVERLAPS) 573/984 variables, 411/487 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 488 constraints, problems are : Problem set: 0 solved, 571 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (OVERLAPS) 5/411 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (OVERLAPS) 573/984 variables, 411/487 constraints. Problems are: Problem set: 0 solved, 571 unsolved
SMT process timed out in 40457ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 40458ms
[2025-06-05 01:21:00] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2025-06-05 01:21:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:21:01] [INFO ] Implicit Places using invariants in 671 ms returned []
[2025-06-05 01:21:01] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2025-06-05 01:21:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:21:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:21:05] [INFO ] Implicit Places using invariants and state equation in 4353 ms returned []
Implicit Place search using SMT with State Equation took 5031 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:21:05] [INFO ] Redundant transitions in 8 ms returned []
Running 571 sub problems to find dead transitions.
[2025-06-05 01:21:05] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2025-06-05 01:21:05] [INFO ] Invariant cache hit.
[2025-06-05 01:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (OVERLAPS) 5/411 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (OVERLAPS) 573/984 variables, 411/487 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 488 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (OVERLAPS) 5/411 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (OVERLAPS) 573/984 variables, 411/487 constraints. Problems are: Problem set: 0 solved, 571 unsolved
SMT process timed out in 60365ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Starting structural reductions in SI_LTL mode, iteration 1 : 411/413 places, 577/579 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105922 ms. Remains : 411/413 places, 577/579 transitions.
Built C files in :
/tmp/ltsmin5780898129770882785
[2025-06-05 01:22:06] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2025-06-05 01:22:06] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:22:06] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2025-06-05 01:22:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:22:06] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2025-06-05 01:22:06] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:22:06] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5780898129770882785
Running compilation step : cd /tmp/ltsmin5780898129770882785;'/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 1536 ms.
Running link step : cd /tmp/ltsmin5780898129770882785;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin5780898129770882785;'/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/stateBased7073036205880663965.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 01:22:21] [INFO ] Flatten gal took : 38 ms
[2025-06-05 01:22:21] [INFO ] Flatten gal took : 36 ms
[2025-06-05 01:22:21] [INFO ] Time to serialize gal into /tmp/LTL2199598443182767353.gal : 9 ms
[2025-06-05 01:22:21] [INFO ] Time to serialize properties into /tmp/LTL16923021062804126200.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/LTL2199598443182767353.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3259816204933716553.hoa' '-atoms' '/tmp/LTL16923021062804126200.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/LTL16923021062804126200.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3259816204933716553.hoa
Detected timeout of ITS tools.
[2025-06-05 01:22:36] [INFO ] Flatten gal took : 33 ms
[2025-06-05 01:22:36] [INFO ] Flatten gal took : 28 ms
[2025-06-05 01:22:36] [INFO ] Time to serialize gal into /tmp/LTL6865710874061666539.gal : 6 ms
[2025-06-05 01:22:36] [INFO ] Time to serialize properties into /tmp/LTL7877395714226516248.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/LTL6865710874061666539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7877395714226516248.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 : !((G(("(NotifyEventEndOfCheckSourcesB_1<1)")||(X((G(F("(NotifyEventEndOfCheckSourcesB_1<1)")))||((X(F("(NotifyEventEndOfCheckSourcesB_...199
Formula 0 simplified : F(!"(NotifyEventEndOfCheckSourcesB_1<1)" & X(FG!"(NotifyEventEndOfCheckSourcesB_1<1)" & (XG!"(NotifyEventEndOfCheckSourcesB_1<1)" | ...183
Detected timeout of ITS tools.
[2025-06-05 01:22:51] [INFO ] Flatten gal took : 28 ms
[2025-06-05 01:22:51] [INFO ] Applying decomposition
[2025-06-05 01:22:51] [INFO ] Flatten gal took : 27 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/graph7691503900403161207.txt' '-o' '/tmp/graph7691503900403161207.bin' '-w' '/tmp/graph7691503900403161207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7691503900403161207.bin' '-l' '-1' '-v' '-w' '/tmp/graph7691503900403161207.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:22:51] [INFO ] Decomposing Gal with order
[2025-06-05 01:22:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:22:51] [INFO ] Removed a total of 540 redundant transitions.
[2025-06-05 01:22:52] [INFO ] Flatten gal took : 180 ms
[2025-06-05 01:22:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 254 labels/synchronizations in 23 ms.
[2025-06-05 01:22:52] [INFO ] Time to serialize gal into /tmp/LTL4389275777116472745.gal : 9 ms
[2025-06-05 01:22:52] [INFO ] Time to serialize properties into /tmp/LTL2034473836855746066.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/LTL4389275777116472745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2034473836855746066.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(("(i4.u4.NotifyEventEndOfCheckSourcesB_1<1)")||(X((G(F("(i4.u4.NotifyEventEndOfCheckSourcesB_1<1)")))||((X(F("(i4.u4.NotifyEventE...224
Formula 0 simplified : F(!"(i4.u4.NotifyEventEndOfCheckSourcesB_1<1)" & X(FG!"(i4.u4.NotifyEventEndOfCheckSourcesB_1<1)" & (XG!"(i4.u4.NotifyEventEndOfChec...208
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-09 finished in 362974 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||X(p1)))||X(X(F(p2))))))'
Support contains 6 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 483 transition count 649
Applied a total of 5 rules in 12 ms. Remains 483 /488 variables (removed 5) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:23:07] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-05 01:23:07] [INFO ] Computed 77 invariants in 11 ms
[2025-06-05 01:23:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:23:26] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:23:27] [INFO ] Deduced a trap composed of 175 places in 241 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:23:27] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 51 ms to minimize.
SMT process timed out in 20504ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20505ms
[2025-06-05 01:23:27] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:23:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:23:28] [INFO ] Implicit Places using invariants in 979 ms returned []
[2025-06-05 01:23:28] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:23:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:23:33] [INFO ] Implicit Places using invariants and state equation in 4845 ms returned []
Implicit Place search using SMT with State Equation took 5826 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:23:33] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:23:33] [INFO ] Invariant cache hit.
[2025-06-05 01:23:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:23:54] [INFO ] Deduced a trap composed of 175 places in 291 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:23:54] [INFO ] Deduced a trap composed of 175 places in 259 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:23:54] [INFO ] Deduced a trap composed of 175 places in 325 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:23:55] [INFO ] Deduced a trap composed of 175 places in 236 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:23:55] [INFO ] Deduced a trap composed of 175 places in 259 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:23:55] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:03] [INFO ] Deduced a trap composed of 107 places in 215 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:03] [INFO ] Deduced a trap composed of 205 places in 197 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:03] [INFO ] Deduced a trap composed of 107 places in 213 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:03] [INFO ] Deduced a trap composed of 205 places in 192 ms of which 39 ms to minimize.
SMT process timed out in 30511ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30515ms
Starting structural reductions in LTL mode, iteration 1 : 483/488 places, 649/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56865 ms. Remains : 483/488 places, 649/649 transitions.
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-10
Product exploration explored 100000 steps with 25000 reset in 254 ms.
Product exploration explored 100000 steps with 25000 reset in 329 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) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 14735 steps (1024 resets) in 89 ms. (163 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 483 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Applied a total of 0 rules in 10 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:24:05] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:24:05] [INFO ] Invariant cache hit.
[2025-06-05 01:24:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:26] [INFO ] Deduced a trap composed of 175 places in 250 ms of which 86 ms to minimize.
SMT process timed out in 20458ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20459ms
[2025-06-05 01:24:26] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:24:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:24:27] [INFO ] Implicit Places using invariants in 986 ms returned []
[2025-06-05 01:24:27] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:24:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:24:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:24:31] [INFO ] Implicit Places using invariants and state equation in 4882 ms returned []
Implicit Place search using SMT with State Equation took 5884 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:24:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:24:32] [INFO ] Invariant cache hit.
[2025-06-05 01:24:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:52] [INFO ] Deduced a trap composed of 175 places in 262 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:52] [INFO ] Deduced a trap composed of 175 places in 249 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:52] [INFO ] Deduced a trap composed of 175 places in 259 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:53] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:53] [INFO ] Deduced a trap composed of 175 places in 241 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:24:53] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:01] [INFO ] Deduced a trap composed of 107 places in 216 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:01] [INFO ] Deduced a trap composed of 205 places in 211 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:01] [INFO ] Deduced a trap composed of 107 places in 219 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:01] [INFO ] Deduced a trap composed of 205 places in 206 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:02] [INFO ] Deduced a trap composed of 107 places in 220 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:02] [INFO ] Deduced a trap composed of 205 places in 204 ms of which 39 ms to minimize.
SMT process timed out in 30369ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30371ms
Finished structural reductions in LTL mode , in 1 iterations and 56728 ms. Remains : 483/483 places, 649/649 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 : [p2]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 8615 steps (599 resets) in 33 ms. (253 steps per ms) remains 0/1 properties
Knowledge obtained : [p2]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 258 ms.
Product exploration explored 100000 steps with 25000 reset in 273 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 483 transition count 649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 35 place count 483 transition count 650
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 483 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 482 transition count 649
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 482 transition count 649
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 482 transition count 649
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 109 place count 448 transition count 615
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 143 place count 448 transition count 615
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 143 rules in 115 ms. Remains 448 /483 variables (removed 35) and now considering 615/649 (removed 34) transitions.
Running 609 sub problems to find dead transitions.
[2025-06-05 01:25:04] [INFO ] Flow matrix only has 611 transitions (discarded 4 similar events)
// Phase 1: matrix 611 rows 448 cols
[2025-06-05 01:25:04] [INFO ] Computed 77 invariants in 8 ms
[2025-06-05 01:25:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:09] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:09] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:09] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:10] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:10] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:10] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:10] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 10 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:10] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 11 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:11] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 10 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:11] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:11] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:11] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:11] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:12] [INFO ] Deduced a trap composed of 75 places in 184 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:12] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:12] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:12] [INFO ] Deduced a trap composed of 76 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 01:25:13] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:13] [INFO ] Deduced a trap composed of 76 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 01:25:13] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 18 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD598 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/92 constraints. Problems are: Problem set: 4 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:14] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:14] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:14] [INFO ] Deduced a trap composed of 104 places in 196 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:14] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:15] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:15] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:15] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 11 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:16] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 11 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:16] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:16] [INFO ] Deduced a trap composed of 104 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:16] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:17] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:17] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:17] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:17] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 18 ms to minimize.
Problem TDEAD193 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:19] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 14 ms to minimize.
Problem TDEAD603 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:22] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 22 ms to minimize.
Problem TDEAD607 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:22] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 25 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 2.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 9.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 3.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 18/110 constraints. Problems are: Problem set: 9 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1059 variables, and 110 constraints, problems are : Problem set: 9 solved, 600 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 13/18 constraints, State Equation: 0/448 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 600 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 54/54 constraints. Problems are: Problem set: 9 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 10/64 constraints. Problems are: Problem set: 9 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 38/102 constraints. Problems are: Problem set: 9 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:25] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:25] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:25] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:25] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:25] [INFO ] Deduced a trap composed of 7 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 01:25:25] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 6 ms to minimize.
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:26] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:26] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:27] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD165 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:27] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:27] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Problem TDEAD238 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
Problem TDEAD245 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Problem TDEAD247 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Problem TDEAD248 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Problem TDEAD249 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 20/122 constraints. Problems are: Problem set: 28 solved, 581 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:28] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Problem TDEAD250 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:30] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 3 ms to minimize.
Problem TDEAD252 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:30] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:25:31] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 7/129 constraints. Problems are: Problem set: 35 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 0/129 constraints. Problems are: Problem set: 35 solved, 574 unsolved
SMT process timed out in 40355ms, After SMT, problems are : Problem set: 35 solved, 574 unsolved
Search for dead transitions found 35 dead transitions in 40356ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 35 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:25:44] [INFO ] Redundant transitions in 5 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 448/483 places, 580/649 transitions.
Graph (complete) has 2233 edges and 448 vertex of which 414 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.2 ms
Discarding 34 places :
Also discarding 0 output transitions
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 1 rules in 19 ms. Remains 414 /448 variables (removed 34) and now considering 580/580 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 414/483 places, 580/649 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40502 ms. Remains : 414/483 places, 580/649 transitions.
Built C files in :
/tmp/ltsmin2339915480234911120
[2025-06-05 01:25:44] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2339915480234911120
Running compilation step : cd /tmp/ltsmin2339915480234911120;'/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 1184 ms.
Running link step : cd /tmp/ltsmin2339915480234911120;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2339915480234911120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17420892806842907121.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-10 finished in 159020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 483 transition count 649
Applied a total of 5 rules in 11 ms. Remains 483 /488 variables (removed 5) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:25:46] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-05 01:25:46] [INFO ] Computed 77 invariants in 9 ms
[2025-06-05 01:25:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:06] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 78 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:15] [INFO ] Deduced a trap composed of 175 places in 240 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:16] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:16] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:16] [INFO ] Deduced a trap composed of 175 places in 268 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:16] [INFO ] Deduced a trap composed of 175 places in 242 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:17] [INFO ] Deduced a trap composed of 175 places in 255 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:17] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:18] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:18] [INFO ] Deduced a trap composed of 175 places in 242 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:19] [INFO ] Deduced a trap composed of 175 places in 243 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:19] [INFO ] Deduced a trap composed of 175 places in 243 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:19] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:23] [INFO ] Deduced a trap composed of 138 places in 289 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:23] [INFO ] Deduced a trap composed of 143 places in 212 ms of which 33 ms to minimize.
Problem TDEAD250 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:25] [INFO ] Deduced a trap composed of 140 places in 190 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1128 variables, and 93 constraints, problems are : Problem set: 1 solved, 642 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40414ms problems are : Problem set: 1 solved, 642 unsolved
Search for dead transitions found 1 dead transitions in 40415ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2025-06-05 01:26:26] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
// Phase 1: matrix 644 rows 483 cols
[2025-06-05 01:26:26] [INFO ] Computed 77 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:26:27] [INFO ] Implicit Places using invariants in 918 ms returned []
[2025-06-05 01:26:27] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
[2025-06-05 01:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:26:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:26:31] [INFO ] Implicit Places using invariants and state equation in 4418 ms returned []
Implicit Place search using SMT with State Equation took 5349 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/488 places, 648/649 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 482 transition count 648
Applied a total of 1 rules in 18 ms. Remains 482 /483 variables (removed 1) and now considering 648/648 (removed 0) transitions.
[2025-06-05 01:26:31] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
// Phase 1: matrix 644 rows 482 cols
[2025-06-05 01:26:31] [INFO ] Computed 76 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:26:32] [INFO ] Implicit Places using invariants in 925 ms returned []
[2025-06-05 01:26:32] [INFO ] Flow matrix only has 644 transitions (discarded 4 similar events)
[2025-06-05 01:26:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:26:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:26:37] [INFO ] Implicit Places using invariants and state equation in 4952 ms returned []
Implicit Place search using SMT with State Equation took 5884 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 482/488 places, 648/649 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51680 ms. Remains : 482/488 places, 648/649 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-11
Entered a terminal (fully accepting) state of product in 33088 steps with 2297 reset in 103 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-11 finished in 51893 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((true U !(p0 U p1))) U p0))'
Support contains 5 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 483 transition count 614
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 448 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 448 transition count 579
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 413 transition count 579
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 410 transition count 576
Applied a total of 146 rules in 39 ms. Remains 410 /488 variables (removed 78) and now considering 576/649 (removed 73) transitions.
Running 570 sub problems to find dead transitions.
[2025-06-05 01:26:38] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2025-06-05 01:26:38] [INFO ] Computed 77 invariants in 14 ms
[2025-06-05 01:26:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:42] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:42] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:43] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:43] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:43] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:43] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:44] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:44] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:44] [INFO ] Deduced a trap composed of 105 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:44] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:44] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:45] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:45] [INFO ] Deduced a trap composed of 105 places in 181 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:45] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:45] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:45] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:46] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:46] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:46] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:46] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:47] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:48] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:48] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:48] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:48] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:48] [INFO ] Deduced a trap composed of 107 places in 193 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:49] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:49] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:49] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:49] [INFO ] Deduced a trap composed of 106 places in 217 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:50] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:50] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:50] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:50] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:50] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:51] [INFO ] Deduced a trap composed of 104 places in 171 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:51] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:52] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:52] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:26:52] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 37 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/982 variables, and 112 constraints, problems are : Problem set: 0 solved, 570 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:01] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:01] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:02] [INFO ] Deduced a trap composed of 107 places in 202 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:02] [INFO ] Deduced a trap composed of 106 places in 202 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:02] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:02] [INFO ] Deduced a trap composed of 106 places in 193 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:03] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:03] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:03] [INFO ] Deduced a trap composed of 76 places in 201 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:03] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:03] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:04] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:04] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:04] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:04] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:04] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:05] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:05] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:05] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:05] [INFO ] Deduced a trap composed of 104 places in 199 ms of which 46 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:07] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:07] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:07] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:08] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:08] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:08] [INFO ] Deduced a trap composed of 106 places in 197 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:08] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:08] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:09] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:09] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:09] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:09] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:09] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:10] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:10] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:10] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:10] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:10] [INFO ] Deduced a trap composed of 106 places in 192 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:14] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:14] [INFO ] Deduced a trap composed of 106 places in 189 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/982 variables, and 152 constraints, problems are : Problem set: 0 solved, 570 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/570 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40425ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 40426ms
[2025-06-05 01:27:18] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:27:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:27:19] [INFO ] Implicit Places using invariants in 679 ms returned []
[2025-06-05 01:27:19] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:27:23] [INFO ] Implicit Places using invariants and state equation in 4238 ms returned []
Implicit Place search using SMT with State Equation took 4919 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:27:23] [INFO ] Redundant transitions in 13 ms returned []
Running 570 sub problems to find dead transitions.
[2025-06-05 01:27:23] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:27:23] [INFO ] Invariant cache hit.
[2025-06-05 01:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:28] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:28] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:28] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:28] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:29] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:29] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:29] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:29] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:29] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:29] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:30] [INFO ] Deduced a trap composed of 104 places in 167 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:30] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:30] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:30] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:30] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:31] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:31] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:31] [INFO ] Deduced a trap composed of 104 places in 193 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:31] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:31] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:32] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:33] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:33] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:33] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:34] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:34] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:34] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:34] [INFO ] Deduced a trap composed of 106 places in 195 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:34] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:35] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:35] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:35] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:35] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:35] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:36] [INFO ] Deduced a trap composed of 107 places in 196 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:36] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:36] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:36] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:36] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:37] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:43] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:43] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:43] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:45] [INFO ] Deduced a trap composed of 76 places in 2322 ms of which 2170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:46] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:46] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:46] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:47] [INFO ] Deduced a trap composed of 104 places in 1254 ms of which 1102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:47] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:49] [INFO ] Deduced a trap composed of 76 places in 1179 ms of which 1037 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:49] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:51] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:52] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:52] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:52] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:52] [INFO ] Deduced a trap composed of 106 places in 211 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:53] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:53] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:53] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:53] [INFO ] Deduced a trap composed of 105 places in 179 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:27:53] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 17 ms to minimize.
SMT process timed out in 30322ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 30323ms
Starting structural reductions in SI_LTL mode, iteration 1 : 410/488 places, 576/649 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75729 ms. Remains : 410/488 places, 576/649 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), p1, p1]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-12
Stuttering criterion allowed to conclude after 4979 steps with 261 reset in 27 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-12 finished in 75902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U (p1 U X(p2)))&&F(G(p3))))))'
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 483 transition count 649
Applied a total of 5 rules in 15 ms. Remains 483 /488 variables (removed 5) and now considering 649/649 (removed 0) transitions.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:27:53] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2025-06-05 01:27:53] [INFO ] Computed 77 invariants in 10 ms
[2025-06-05 01:27:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:13] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:14] [INFO ] Deduced a trap composed of 175 places in 227 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:14] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 50 ms to minimize.
SMT process timed out in 20503ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 20505ms
[2025-06-05 01:28:14] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:28:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:28:15] [INFO ] Implicit Places using invariants in 987 ms returned []
[2025-06-05 01:28:15] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:28:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:28:20] [INFO ] Implicit Places using invariants and state equation in 4890 ms returned []
Implicit Place search using SMT with State Equation took 5888 ms to find 0 implicit places.
Running 643 sub problems to find dead transitions.
[2025-06-05 01:28:20] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2025-06-05 01:28:20] [INFO ] Invariant cache hit.
[2025-06-05 01:28:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:40] [INFO ] Deduced a trap composed of 175 places in 254 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:41] [INFO ] Deduced a trap composed of 175 places in 271 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:41] [INFO ] Deduced a trap composed of 175 places in 234 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:41] [INFO ] Deduced a trap composed of 175 places in 214 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:41] [INFO ] Deduced a trap composed of 175 places in 235 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:42] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:49] [INFO ] Deduced a trap composed of 107 places in 219 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:50] [INFO ] Deduced a trap composed of 205 places in 206 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:50] [INFO ] Deduced a trap composed of 107 places in 219 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:50] [INFO ] Deduced a trap composed of 205 places in 202 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:50] [INFO ] Deduced a trap composed of 107 places in 220 ms of which 55 ms to minimize.
SMT process timed out in 30449ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 30451ms
Starting structural reductions in LTL mode, iteration 1 : 483/488 places, 649/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56862 ms. Remains : 483/488 places, 649/649 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p3), (NOT p2), (NOT p2), true]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-13
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-13 finished in 57245 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((F(p1)&&F(p2)))))'
Support contains 6 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 483 transition count 617
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 451 transition count 616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 450 transition count 616
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 66 place count 450 transition count 583
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 132 place count 417 transition count 583
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 415 transition count 581
Applied a total of 136 rules in 45 ms. Remains 415 /488 variables (removed 73) and now considering 581/649 (removed 68) transitions.
Running 575 sub problems to find dead transitions.
[2025-06-05 01:28:51] [INFO ] Flow matrix only has 577 transitions (discarded 4 similar events)
// Phase 1: matrix 577 rows 415 cols
[2025-06-05 01:28:51] [INFO ] Computed 77 invariants in 10 ms
[2025-06-05 01:28:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:55] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:56] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:56] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:56] [INFO ] Deduced a trap composed of 111 places in 170 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:56] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:57] [INFO ] Deduced a trap composed of 108 places in 167 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:57] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:57] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:57] [INFO ] Deduced a trap composed of 111 places in 185 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:57] [INFO ] Deduced a trap composed of 111 places in 185 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:58] [INFO ] Deduced a trap composed of 111 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:58] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:58] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:58] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:58] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:58] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:59] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:59] [INFO ] Deduced a trap composed of 111 places in 200 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:59] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:28:59] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:00] [INFO ] Deduced a trap composed of 111 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:01] [INFO ] Deduced a trap composed of 111 places in 177 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:01] [INFO ] Deduced a trap composed of 111 places in 168 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:01] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:02] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:02] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:02] [INFO ] Deduced a trap composed of 112 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:02] [INFO ] Deduced a trap composed of 111 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:02] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:02] [INFO ] Deduced a trap composed of 111 places in 180 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:03] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:03] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:03] [INFO ] Deduced a trap composed of 111 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:03] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:04] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:04] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:04] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:05] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:05] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:05] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/992 variables, and 112 constraints, problems are : Problem set: 0 solved, 575 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:15] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:16] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:16] [INFO ] Deduced a trap composed of 111 places in 170 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:16] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:16] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:17] [INFO ] Deduced a trap composed of 108 places in 688 ms of which 536 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:17] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:17] [INFO ] Deduced a trap composed of 115 places in 183 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:17] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:18] [INFO ] Deduced a trap composed of 115 places in 178 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:18] [INFO ] Deduced a trap composed of 115 places in 176 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:18] [INFO ] Deduced a trap composed of 115 places in 182 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:18] [INFO ] Deduced a trap composed of 111 places in 177 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:19] [INFO ] Deduced a trap composed of 111 places in 194 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:19] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:19] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:19] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:19] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:20] [INFO ] Deduced a trap composed of 111 places in 189 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:20] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/992 variables, and 132 constraints, problems are : Problem set: 0 solved, 575 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/575 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40363ms problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 40365ms
[2025-06-05 01:29:31] [INFO ] Flow matrix only has 577 transitions (discarded 4 similar events)
[2025-06-05 01:29:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:29:32] [INFO ] Implicit Places using invariants in 705 ms returned []
[2025-06-05 01:29:32] [INFO ] Flow matrix only has 577 transitions (discarded 4 similar events)
[2025-06-05 01:29:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:29:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:29:36] [INFO ] Implicit Places using invariants and state equation in 4052 ms returned []
Implicit Place search using SMT with State Equation took 4760 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:29:36] [INFO ] Redundant transitions in 9 ms returned []
Running 575 sub problems to find dead transitions.
[2025-06-05 01:29:36] [INFO ] Flow matrix only has 577 transitions (discarded 4 similar events)
[2025-06-05 01:29:36] [INFO ] Invariant cache hit.
[2025-06-05 01:29:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:41] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:41] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:41] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:42] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:42] [INFO ] Deduced a trap composed of 111 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:42] [INFO ] Deduced a trap composed of 111 places in 181 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:42] [INFO ] Deduced a trap composed of 108 places in 207 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:43] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:43] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:43] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:43] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:44] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:44] [INFO ] Deduced a trap composed of 111 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:44] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:44] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:44] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:45] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:45] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:45] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:45] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 39 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:46] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:47] [INFO ] Deduced a trap composed of 111 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:47] [INFO ] Deduced a trap composed of 111 places in 182 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:47] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:47] [INFO ] Deduced a trap composed of 111 places in 185 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:47] [INFO ] Deduced a trap composed of 111 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:47] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:48] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:48] [INFO ] Deduced a trap composed of 111 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:48] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:48] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:49] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:49] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:49] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:49] [INFO ] Deduced a trap composed of 111 places in 240 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:49] [INFO ] Deduced a trap composed of 111 places in 191 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:50] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:50] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:50] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:50] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:57] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:57] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:57] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:57] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:29:59] [INFO ] Deduced a trap composed of 111 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:00] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:00] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:00] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:00] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:00] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:00] [INFO ] Deduced a trap composed of 111 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:01] [INFO ] Deduced a trap composed of 111 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:01] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:01] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:01] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:02] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:02] [INFO ] Deduced a trap composed of 111 places in 177 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:02] [INFO ] Deduced a trap composed of 111 places in 204 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:02] [INFO ] Deduced a trap composed of 111 places in 181 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:02] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:03] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:03] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:03] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:03] [INFO ] Deduced a trap composed of 111 places in 178 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:05] [INFO ] Deduced a trap composed of 111 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:05] [INFO ] Deduced a trap composed of 111 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:05] [INFO ] Deduced a trap composed of 111 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:06] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:06] [INFO ] Deduced a trap composed of 111 places in 182 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:06] [INFO ] Deduced a trap composed of 111 places in 183 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:06] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 17 ms to minimize.
SMT process timed out in 30341ms, After SMT, problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 30343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 415/488 places, 581/649 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75536 ms. Remains : 415/488 places, 581/649 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-14
Stuttering criterion allowed to conclude after 40 steps with 2 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-14 finished in 75773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 649/649 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 483 transition count 614
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 448 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 448 transition count 579
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 413 transition count 579
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 410 transition count 576
Applied a total of 146 rules in 39 ms. Remains 410 /488 variables (removed 78) and now considering 576/649 (removed 73) transitions.
Running 570 sub problems to find dead transitions.
[2025-06-05 01:30:06] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2025-06-05 01:30:07] [INFO ] Computed 77 invariants in 13 ms
[2025-06-05 01:30:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:11] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:11] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:12] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:12] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:12] [INFO ] Deduced a trap composed of 104 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:12] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:12] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:13] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:13] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:13] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:13] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:14] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:14] [INFO ] Deduced a trap composed of 105 places in 189 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:14] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:14] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:14] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:15] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:15] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:15] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:15] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:16] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:17] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:17] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:17] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:17] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:17] [INFO ] Deduced a trap composed of 107 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:18] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:18] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:18] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:18] [INFO ] Deduced a trap composed of 106 places in 221 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:19] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:19] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:19] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:19] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:19] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:20] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:20] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:21] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:21] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:21] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/982 variables, and 112 constraints, problems are : Problem set: 0 solved, 570 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:30] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:30] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:31] [INFO ] Deduced a trap composed of 107 places in 196 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:31] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:31] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:31] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:31] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:32] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:32] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:32] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:32] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:32] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:33] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:33] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:33] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:33] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:33] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:34] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:34] [INFO ] Deduced a trap composed of 76 places in 210 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:34] [INFO ] Deduced a trap composed of 104 places in 199 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:36] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:36] [INFO ] Deduced a trap composed of 106 places in 198 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:36] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:36] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:37] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:37] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:37] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:37] [INFO ] Deduced a trap composed of 106 places in 191 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:37] [INFO ] Deduced a trap composed of 106 places in 197 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:38] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:38] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:38] [INFO ] Deduced a trap composed of 106 places in 193 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:38] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:39] [INFO ] Deduced a trap composed of 106 places in 197 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:39] [INFO ] Deduced a trap composed of 106 places in 191 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:39] [INFO ] Deduced a trap composed of 106 places in 198 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:39] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:39] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/982 variables, and 150 constraints, problems are : Problem set: 0 solved, 570 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/570 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40382ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 40383ms
[2025-06-05 01:30:47] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:30:48] [INFO ] Implicit Places using invariants in 679 ms returned []
[2025-06-05 01:30:48] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:30:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:30:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:30:51] [INFO ] Implicit Places using invariants and state equation in 3528 ms returned []
Implicit Place search using SMT with State Equation took 4209 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:30:51] [INFO ] Redundant transitions in 10 ms returned []
Running 570 sub problems to find dead transitions.
[2025-06-05 01:30:51] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:30:51] [INFO ] Invariant cache hit.
[2025-06-05 01:30:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:56] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:56] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:56] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:57] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:57] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:57] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:57] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:57] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:57] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:58] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:58] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:58] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:58] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:58] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:59] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:59] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:59] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:59] [INFO ] Deduced a trap composed of 104 places in 198 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:30:59] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:00] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:01] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:01] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:01] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:02] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:02] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:02] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:02] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:02] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:03] [INFO ] Deduced a trap composed of 106 places in 180 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:03] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:03] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:03] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:03] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:04] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:04] [INFO ] Deduced a trap composed of 107 places in 204 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:04] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:04] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:04] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:05] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:05] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:11] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:11] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:11] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:14] [INFO ] Deduced a trap composed of 76 places in 2313 ms of which 2157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:14] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:14] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:14] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:15] [INFO ] Deduced a trap composed of 104 places in 1236 ms of which 1099 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:16] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:17] [INFO ] Deduced a trap composed of 76 places in 1182 ms of which 1029 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:17] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:20] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:20] [INFO ] Deduced a trap composed of 106 places in 200 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:20] [INFO ] Deduced a trap composed of 106 places in 180 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:21] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:21] [INFO ] Deduced a trap composed of 106 places in 218 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:21] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:21] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:21] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:22] [INFO ] Deduced a trap composed of 105 places in 188 ms of which 42 ms to minimize.
SMT process timed out in 30422ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 30423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 410/488 places, 576/649 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75073 ms. Remains : 410/488 places, 576/649 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-15
Product exploration explored 100000 steps with 5316 reset in 526 ms.
Product exploration explored 100000 steps with 5289 reset in 520 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 109 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2039 resets) in 229 ms. (173 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (233 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
[2025-06-05 01:31:23] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:31:23] [INFO ] Invariant cache hit.
[2025-06-05 01:31:23] [INFO ] State equation strengthened by 1 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) 96/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/202 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/322 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 402/982 variables, and 70 constraints, problems are : Problem set: 1 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 51/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 328 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 21 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Running 570 sub problems to find dead transitions.
[2025-06-05 01:31:24] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:31:24] [INFO ] Invariant cache hit.
[2025-06-05 01:31:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:28] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:29] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:29] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:29] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:29] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:29] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:30] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:30] [INFO ] Deduced a trap composed of 104 places in 167 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:30] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:30] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:30] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:31] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:31] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:31] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:31] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:31] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:31] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:32] [INFO ] Deduced a trap composed of 104 places in 202 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:32] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:32] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:33] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:34] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:34] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:34] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:34] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:35] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:35] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:35] [INFO ] Deduced a trap composed of 106 places in 192 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:35] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:35] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:35] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:36] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:36] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:36] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:36] [INFO ] Deduced a trap composed of 107 places in 184 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:36] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:37] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:37] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:37] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:37] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:44] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:44] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:44] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:46] [INFO ] Deduced a trap composed of 76 places in 2254 ms of which 2109 ms to minimize.
SMT process timed out in 22632ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 22634ms
[2025-06-05 01:31:46] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:31:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:31:47] [INFO ] Implicit Places using invariants in 642 ms returned []
[2025-06-05 01:31:47] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:31:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:31:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:31:50] [INFO ] Implicit Places using invariants and state equation in 3441 ms returned []
Implicit Place search using SMT with State Equation took 4083 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:31:50] [INFO ] Redundant transitions in 7 ms returned []
Running 570 sub problems to find dead transitions.
[2025-06-05 01:31:50] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:31:50] [INFO ] Invariant cache hit.
[2025-06-05 01:31:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:55] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:55] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:56] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:56] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:56] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:56] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:56] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:57] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:57] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:57] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:57] [INFO ] Deduced a trap composed of 104 places in 176 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:57] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:58] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:58] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:58] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:58] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:58] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:59] [INFO ] Deduced a trap composed of 104 places in 197 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:59] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:31:59] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:00] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:00] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:01] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:01] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:01] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:01] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:02] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:02] [INFO ] Deduced a trap composed of 106 places in 191 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:02] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:02] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:02] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:02] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:03] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:03] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:03] [INFO ] Deduced a trap composed of 107 places in 189 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:03] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:03] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:04] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:04] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:04] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:10] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:10] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:11] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:13] [INFO ] Deduced a trap composed of 76 places in 2301 ms of which 2148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:13] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:13] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:13] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:15] [INFO ] Deduced a trap composed of 104 places in 1251 ms of which 1114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:15] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:16] [INFO ] Deduced a trap composed of 76 places in 1186 ms of which 1039 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:16] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:19] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:19] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:20] [INFO ] Deduced a trap composed of 106 places in 184 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:20] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:20] [INFO ] Deduced a trap composed of 106 places in 210 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:20] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:20] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:20] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:21] [INFO ] Deduced a trap composed of 105 places in 181 ms of which 43 ms to minimize.
SMT process timed out in 30411ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 30413ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57174 ms. Remains : 410/410 places, 576/576 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2117 resets) in 221 ms. (180 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (203 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
[2025-06-05 01:32:21] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:32:21] [INFO ] Invariant cache hit.
[2025-06-05 01:32:21] [INFO ] State equation strengthened by 1 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) 96/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/202 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/322 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 402/982 variables, and 70 constraints, problems are : Problem set: 1 solved, 0 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 51/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 318 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5265 reset in 486 ms.
Product exploration explored 100000 steps with 5283 reset in 520 ms.
Built C files in :
/tmp/ltsmin741600308008496428
[2025-06-05 01:32:23] [INFO ] Computing symmetric may disable matrix : 576 transitions.
[2025-06-05 01:32:23] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:32:23] [INFO ] Computing symmetric may enable matrix : 576 transitions.
[2025-06-05 01:32:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:32:23] [INFO ] Computing Do-Not-Accords matrix : 576 transitions.
[2025-06-05 01:32:23] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:32:23] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin741600308008496428
Running compilation step : cd /tmp/ltsmin741600308008496428;'/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 1520 ms.
Running link step : cd /tmp/ltsmin741600308008496428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin741600308008496428;'/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/stateBased9885548269329991684.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 23 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Running 570 sub problems to find dead transitions.
[2025-06-05 01:32:38] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:32:38] [INFO ] Invariant cache hit.
[2025-06-05 01:32:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:42] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:43] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:43] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:43] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:43] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:44] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:44] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:44] [INFO ] Deduced a trap composed of 104 places in 180 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:44] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:44] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:45] [INFO ] Deduced a trap composed of 104 places in 182 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:45] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:45] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:45] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:45] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:46] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:46] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:46] [INFO ] Deduced a trap composed of 104 places in 200 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:46] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:46] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:47] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:48] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:48] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:48] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:49] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:49] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:49] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:49] [INFO ] Deduced a trap composed of 106 places in 206 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:49] [INFO ] Deduced a trap composed of 106 places in 195 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:50] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:50] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:50] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:50] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:50] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:51] [INFO ] Deduced a trap composed of 107 places in 200 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:51] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:51] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:51] [INFO ] Deduced a trap composed of 107 places in 177 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:51] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:52] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:58] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:58] [INFO ] Deduced a trap composed of 76 places in 166 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:32:58] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 11 ms to minimize.
SMT process timed out in 20404ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 20406ms
[2025-06-05 01:32:58] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:32:59] [INFO ] Implicit Places using invariants in 670 ms returned []
[2025-06-05 01:32:59] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:32:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:33:02] [INFO ] Implicit Places using invariants and state equation in 3449 ms returned []
Implicit Place search using SMT with State Equation took 4155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:33:02] [INFO ] Redundant transitions in 4 ms returned []
Running 570 sub problems to find dead transitions.
[2025-06-05 01:33:02] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-05 01:33:02] [INFO ] Invariant cache hit.
[2025-06-05 01:33:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:07] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:07] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:08] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:08] [INFO ] Deduced a trap composed of 106 places in 196 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:08] [INFO ] Deduced a trap composed of 106 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:08] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:08] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:09] [INFO ] Deduced a trap composed of 104 places in 186 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:09] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:09] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:09] [INFO ] Deduced a trap composed of 104 places in 175 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:10] [INFO ] Deduced a trap composed of 106 places in 196 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:10] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:10] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:10] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:10] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:10] [INFO ] Deduced a trap composed of 106 places in 192 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:11] [INFO ] Deduced a trap composed of 104 places in 213 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:11] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:11] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:12] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:13] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:13] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:13] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:13] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:13] [INFO ] Deduced a trap composed of 106 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:14] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:14] [INFO ] Deduced a trap composed of 106 places in 205 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:14] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:14] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:14] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:15] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:15] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:15] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:15] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:16] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:16] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:16] [INFO ] Deduced a trap composed of 107 places in 178 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:16] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:16] [INFO ] Deduced a trap composed of 106 places in 356 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:23] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:23] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:23] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:25] [INFO ] Deduced a trap composed of 76 places in 2312 ms of which 2160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:26] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:26] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:26] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:27] [INFO ] Deduced a trap composed of 104 places in 1232 ms of which 1104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:27] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:29] [INFO ] Deduced a trap composed of 76 places in 1187 ms of which 1029 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:29] [INFO ] Deduced a trap composed of 106 places in 180 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:31] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:32] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:32] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:32] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:32] [INFO ] Deduced a trap composed of 106 places in 235 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:33] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:33:33] [INFO ] Deduced a trap composed of 106 places in 315 ms of which 45 ms to minimize.
SMT process timed out in 30611ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 30613ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55213 ms. Remains : 410/410 places, 576/576 transitions.
Built C files in :
/tmp/ltsmin4914734710294912553
[2025-06-05 01:33:33] [INFO ] Computing symmetric may disable matrix : 576 transitions.
[2025-06-05 01:33:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:33:33] [INFO ] Computing symmetric may enable matrix : 576 transitions.
[2025-06-05 01:33:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:33:33] [INFO ] Computing Do-Not-Accords matrix : 576 transitions.
[2025-06-05 01:33:33] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:33:33] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4914734710294912553
Running compilation step : cd /tmp/ltsmin4914734710294912553;'/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 1531 ms.
Running link step : cd /tmp/ltsmin4914734710294912553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4914734710294912553;'/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/stateBased13462994118979741377.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 01:33:48] [INFO ] Flatten gal took : 25 ms
[2025-06-05 01:33:48] [INFO ] Flatten gal took : 22 ms
[2025-06-05 01:33:48] [INFO ] Time to serialize gal into /tmp/LTL5908989753034065054.gal : 5 ms
[2025-06-05 01:33:48] [INFO ] Time to serialize properties into /tmp/LTL17060842623785087617.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/LTL5908989753034065054.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3840795540832460394.hoa' '-atoms' '/tmp/LTL17060842623785087617.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/LTL17060842623785087617.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3840795540832460394.hoa
Detected timeout of ITS tools.
[2025-06-05 01:34:03] [INFO ] Flatten gal took : 22 ms
[2025-06-05 01:34:03] [INFO ] Flatten gal took : 20 ms
[2025-06-05 01:34:03] [INFO ] Time to serialize gal into /tmp/LTL3513188709147361004.gal : 8 ms
[2025-06-05 01:34:03] [INFO ] Time to serialize properties into /tmp/LTL3418423667645128660.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/LTL3513188709147361004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3418423667645128660.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((G("(((mi1<1)||(QueueJobB_1_12<1))||(block<1))"))||(G("(((QueueJobB_1_14<1)||(mi2<1))||(block<1))")))))
Formula 0 simplified : G(F!"(((mi1<1)||(QueueJobB_1_12<1))||(block<1))" & F!"(((QueueJobB_1_14<1)||(mi2<1))||(block<1))")
Detected timeout of ITS tools.
[2025-06-05 01:34:18] [INFO ] Flatten gal took : 20 ms
[2025-06-05 01:34:18] [INFO ] Applying decomposition
[2025-06-05 01:34:18] [INFO ] Flatten gal took : 23 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/graph10163032012419626659.txt' '-o' '/tmp/graph10163032012419626659.bin' '-w' '/tmp/graph10163032012419626659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10163032012419626659.bin' '-l' '-1' '-v' '-w' '/tmp/graph10163032012419626659.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:34:18] [INFO ] Decomposing Gal with order
[2025-06-05 01:34:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:34:18] [INFO ] Removed a total of 544 redundant transitions.
[2025-06-05 01:34:18] [INFO ] Flatten gal took : 82 ms
[2025-06-05 01:34:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 251 labels/synchronizations in 16 ms.
[2025-06-05 01:34:18] [INFO ] Time to serialize gal into /tmp/LTL5435170102781850950.gal : 6 ms
[2025-06-05 01:34:18] [INFO ] Time to serialize properties into /tmp/LTL1418525679709297807.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/LTL5435170102781850950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1418525679709297807.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 : !((F((G("(((i4.u12.mi1<1)||(i4.u12.QueueJobB_1_12<1))||(i4.u6.block<1))"))||(G("(((i4.u12.QueueJobB_1_14<1)||(i4.u12.mi2<1))||(i4.u6.b...169
Formula 0 simplified : G(F!"(((i4.u12.mi1<1)||(i4.u12.QueueJobB_1_12<1))||(i4.u6.block<1))" & F!"(((i4.u12.QueueJobB_1_14<1)||(i4.u12.mi2<1))||(i4.u6.block...161
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-15 finished in 267094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(((X(F(p0))&&F(p1))||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((G(p0)||G(p1))))'
[2025-06-05 01:34:34] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11503224822379321493
[2025-06-05 01:34:34] [INFO ] Computing symmetric may disable matrix : 649 transitions.
[2025-06-05 01:34:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:34:34] [INFO ] Applying decomposition
[2025-06-05 01:34:34] [INFO ] Computing symmetric may enable matrix : 649 transitions.
[2025-06-05 01:34:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:34:34] [INFO ] Flatten gal took : 33 ms
[2025-06-05 01:34:34] [INFO ] Computing Do-Not-Accords matrix : 649 transitions.
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/graph7148674155619356438.txt' '-o' '/tmp/graph7148674155619356438.bin' '-w' '/tmp/graph7148674155619356438.weights'
[2025-06-05 01:34:34] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7148674155619356438.bin' '-l' '-1' '-v' '-w' '/tmp/graph7148674155619356438.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:34:34] [INFO ] Decomposing Gal with order
[2025-06-05 01:34:34] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11503224822379321493
Running compilation step : cd /tmp/ltsmin11503224822379321493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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 01:34:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:34:34] [INFO ] Removed a total of 809 redundant transitions.
[2025-06-05 01:34:34] [INFO ] Flatten gal took : 73 ms
[2025-06-05 01:34:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 191 labels/synchronizations in 22 ms.
[2025-06-05 01:34:34] [INFO ] Time to serialize gal into /tmp/LTLFireability16775981896846355633.gal : 8 ms
[2025-06-05 01:34:34] [INFO ] Time to serialize properties into /tmp/LTLFireability1434027916307097220.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/LTLFireability16775981896846355633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1434027916307097220.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...277
Read 2 LTL properties
Checking formula 0 : !((G(("(i16.i0.u65.NotifyEventEndOfCheckSourcesB_1<1)")||(X(((X(F("(i16.i0.u65.NotifyEventEndOfCheckSourcesB_1<1)")))&&(F("(i16.i0.u45...243
Formula 0 simplified : F(!"(i16.i0.u65.NotifyEventEndOfCheckSourcesB_1<1)" & X(FG!"(i16.i0.u65.NotifyEventEndOfCheckSourcesB_1<1)" & (XG!"(i16.i0.u65.Notif...227
Compilation finished in 1799 ms.
Running link step : cd /tmp/ltsmin11503224822379321493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11503224822379321493;'/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' '[](((LTLAPp0==true)||X(((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))||[](<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.135: LTL layer: formula: [](((LTLAPp0==true)||X(((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))||[](<>((LTLAPp0==true)))))))
pins2lts-mc-linux64( 6/ 8), 0.135: "[](((LTLAPp0==true)||X(((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))||[](<>((LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.135: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.255: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.258: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.260: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.268: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.286: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.296: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.503: DFS-FIFO for weak LTL, using special progress label 654
pins2lts-mc-linux64( 0/ 8), 0.503: There are 655 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.503: State length is 489, there are 657 groups
pins2lts-mc-linux64( 0/ 8), 0.503: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.503: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.503: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.503: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.583: ~1 levels ~960 states ~3064 transitions
pins2lts-mc-linux64( 5/ 8), 0.766: ~1 levels ~1920 states ~21200 transitions
pins2lts-mc-linux64( 1/ 8), 0.870: ~1 levels ~3840 states ~32608 transitions
pins2lts-mc-linux64( 1/ 8), 0.976: ~1 levels ~7680 states ~44928 transitions
pins2lts-mc-linux64( 4/ 8), 1.247: ~1 levels ~15360 states ~64816 transitions
pins2lts-mc-linux64( 5/ 8), 1.655: ~1 levels ~30720 states ~108888 transitions
pins2lts-mc-linux64( 5/ 8), 2.613: ~1 levels ~61440 states ~185368 transitions
pins2lts-mc-linux64( 5/ 8), 5.329: ~1 levels ~122880 states ~287688 transitions
pins2lts-mc-linux64( 5/ 8), 10.016: ~5 levels ~245760 states ~492360 transitions
pins2lts-mc-linux64( 5/ 8), 14.599: ~5 levels ~491520 states ~1093040 transitions
pins2lts-mc-linux64( 5/ 8), 22.258: ~5 levels ~983040 states ~2200728 transitions
pins2lts-mc-linux64( 5/ 8), 39.077: ~5 levels ~1966080 states ~4535248 transitions
pins2lts-mc-linux64( 5/ 8), 68.971: ~5 levels ~3932160 states ~8355048 transitions
pins2lts-mc-linux64( 5/ 8), 137.586: ~5 levels ~7864320 states ~16832096 transitions
pins2lts-mc-linux64( 7/ 8), 281.630: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 281.843:
pins2lts-mc-linux64( 0/ 8), 281.843: mean standard work distribution: 22.3% (states) 34.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 281.843:
pins2lts-mc-linux64( 0/ 8), 281.843: Explored 12227365 states 70420199 transitions, fanout: 5.759
pins2lts-mc-linux64( 0/ 8), 281.843: Total exploration time 281.320 sec (281.110 sec minimum, 281.177 sec on average)
pins2lts-mc-linux64( 0/ 8), 281.843: States per second: 43464, Transitions per second: 250321
pins2lts-mc-linux64( 0/ 8), 281.843:
pins2lts-mc-linux64( 0/ 8), 281.843: Progress states detected: 24843405
pins2lts-mc-linux64( 0/ 8), 281.843: Redundant explorations: -51.1464
pins2lts-mc-linux64( 0/ 8), 281.843:
pins2lts-mc-linux64( 0/ 8), 281.843: Queue width: 8B, total height: 19688386, memory: 150.21MB
pins2lts-mc-linux64( 0/ 8), 281.843: Tree memory: 447.0MB, 18.7 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 281.843: Tree fill ratio (roots/leafs): 18.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 281.843: Stored 660 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 281.843: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 281.843: Est. total memory use: 597.2MB (~1174.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11503224822379321493;'/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' '[](((LTLAPp0==true)||X(((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))||[](<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11503224822379321493;'/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' '[](((LTLAPp0==true)||X(((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))||[](<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 02:03:15] [INFO ] Flatten gal took : 24 ms
[2025-06-05 02:03:15] [INFO ] Time to serialize gal into /tmp/LTLFireability10756060599749729120.gal : 10 ms
[2025-06-05 02:03:15] [INFO ] Time to serialize properties into /tmp/LTLFireability48511292965961611.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/LTLFireability10756060599749729120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability48511292965961611.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...296
Read 2 LTL properties
Checking formula 0 : !((G(("(NotifyEventEndOfCheckSourcesB_1<1)")||(X(((X(F("(NotifyEventEndOfCheckSourcesB_1<1)")))&&(F("(Schedule_Task_B_1<1)")))||(G(F("...199
Formula 0 simplified : F(!"(NotifyEventEndOfCheckSourcesB_1<1)" & X(FG!"(NotifyEventEndOfCheckSourcesB_1<1)" & (XG!"(NotifyEventEndOfCheckSourcesB_1<1)" | ...183
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="PolyORBNT-PT-S05J30"
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 PolyORBNT-PT-S05J30, 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 r156-tall-174881254400644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J30.tgz
mv PolyORBNT-PT-S05J30 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 ;