About the Execution of ITS-Tools for PolyORBNT-COL-S05J40
| 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 | F?F?FFFFFFTFFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254300571.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-COL-S05J40, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254300571
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 93K 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-COL-S05J40-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749048163412
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-04 14:42:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 14:42:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 14:42:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-04 14:42:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-04 14:42:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 575 ms
[2025-06-04 14:42:45] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2025-06-04 14:42:45] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2025-06-04 14:42:45] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40002 steps (3193 resets) in 1421 ms. (28 steps per ms) remains 15/30 properties
BEST_FIRST walk for 4001 steps (91 resets) in 49 ms. (80 steps per ms) remains 8/15 properties
BEST_FIRST walk for 4002 steps (84 resets) in 40 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4004 steps (155 resets) in 32 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4002 steps (104 resets) in 48 ms. (81 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4002 steps (89 resets) in 52 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000 steps (160 resets) in 54 ms. (72 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4003 steps (128 resets) in 37 ms. (105 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4005 steps (106 resets) in 64 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4003 steps (106 resets) in 66 ms. (59 steps per ms) remains 8/8 properties
// Phase 1: matrix 38 rows 48 cols
[2025-06-04 14:42:46] [INFO ] Computed 13 invariants in 14 ms
[2025-06-04 14:42:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 12/24 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/46 variables, 7/11 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:42:46] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 48/86 variables, and 14 constraints, problems are : Problem set: 8 solved, 0 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 14:42:46] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2025-06-04 14:42:46] [INFO ] Flatten gal took : 19 ms
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 14:42:46] [INFO ] Flatten gal took : 8 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-04 14:42:46] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 55 ms.
[2025-06-04 14:42:46] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 314 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 35 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2025-06-04 14:42:47] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2025-06-04 14:42:47] [INFO ] Computed 102 invariants in 58 ms
[2025-06-04 14:42:47] [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/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/627 variables, 9/100 constraints. Problems are: Problem set: 78 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1560 variables, and 100 constraints, problems are : Problem set: 78 solved, 851 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 851 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 9/627 variables, 9/100 constraints. Problems are: Problem set: 78 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1560 variables, and 100 constraints, problems are : Problem set: 78 solved, 851 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41270ms problems are : Problem set: 78 solved, 851 unsolved
Search for dead transitions found 78 dead transitions in 41282ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2025-06-04 14:43:28] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 629 cols
[2025-06-04 14:43:28] [INFO ] Computed 102 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:43:29] [INFO ] Implicit Places using invariants in 945 ms returned []
[2025-06-04 14:43:29] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2025-06-04 14:43:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:43:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:43:32] [INFO ] Implicit Places using invariants and state equation in 3483 ms returned []
Implicit Place search using SMT with State Equation took 4438 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 857/935 transitions.
Applied a total of 0 rules in 10 ms. Remains 629 /629 variables (removed 0) and now considering 857/857 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45784 ms. Remains : 629/629 places, 857/935 transitions.
Support contains 314 out of 629 places after structural reductions.
[2025-06-04 14:43:32] [INFO ] Flatten gal took : 80 ms
[2025-06-04 14:43:32] [INFO ] Flatten gal took : 66 ms
[2025-06-04 14:43:33] [INFO ] Input system was already deterministic with 857 transitions.
RANDOM walk for 40000 steps (2750 resets) in 682 ms. (58 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40002 steps (565 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (620 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (523 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
[2025-06-04 14:43:33] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2025-06-04 14:43:33] [INFO ] Invariant cache hit.
[2025-06-04 14:43:33] [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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 307/310 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/394 variables, 43/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 205/599 variables, 41/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/615 variables, 8/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/627 variables, 7/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/628 variables, 1/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 853/1481 variables, 628/730 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1481 variables, 1/731 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1481 variables, 0/731 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1482 variables, 1/732 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1482 variables, 0/732 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1482 variables, 0/732 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1482/1482 variables, and 732 constraints, problems are : Problem set: 2 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 308/310 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/394 variables, 43/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 205/599 variables, 41/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/615 variables, 8/94 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/627 variables, 7/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/628 variables, 1/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 853/1481 variables, 628/730 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1481 variables, 1/731 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1481 variables, 0/731 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1482 variables, 1/732 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1482 variables, 1/733 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1482 variables, 0/733 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1482 variables, 0/733 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1482/1482 variables, and 733 constraints, problems are : Problem set: 2 solved, 1 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1373ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 7 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 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(p0)&&F(p1)&&X(X(F(!p0)))))'
Support contains 4 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 56 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:43:35] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2025-06-04 14:43:35] [INFO ] Computed 97 invariants in 34 ms
[2025-06-04 14:43:35] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:44:03] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:44:03] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 93 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40645ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 40649ms
[2025-06-04 14:44:15] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:44:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:44:16] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2025-06-04 14:44:16] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:44:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:44:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:44:21] [INFO ] Implicit Places using invariants and state equation in 4625 ms returned []
Implicit Place search using SMT with State Equation took 5677 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:44:21] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:44:21] [INFO ] Invariant cache hit.
[2025-06-04 14:44:21] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:44:56] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 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 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60644ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60654ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 856/857 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107047 ms. Remains : 623/629 places, 856/857 transitions.
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p0), (NOT p1), p0, p0]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-00
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-00 finished in 107436 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((G((F(p1)||X(X(p2)))) U (p0&&G((F(p1)||X(X(p2)))))))))))'
Support contains 45 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 32 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:45:22] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:45:22] [INFO ] Invariant cache hit.
[2025-06-04 14:45:22] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:45:47] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40621ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 40624ms
[2025-06-04 14:46:03] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:46:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:46:04] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2025-06-04 14:46:04] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:46:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:46:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:46:08] [INFO ] Implicit Places using invariants and state equation in 4051 ms returned []
Implicit Place search using SMT with State Equation took 5236 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:46:08] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:46:08] [INFO ] Invariant cache hit.
[2025-06-04 14:46:08] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:46:43] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60633ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60640ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 856/857 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106540 ms. Remains : 623/629 places, 856/857 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-01
Product exploration explored 100000 steps with 7000 reset in 459 ms.
Product exploration explored 100000 steps with 6945 reset in 372 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 (NOT p2)), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 40000 steps (2709 resets) in 453 ms. (88 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1212 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
[2025-06-04 14:47:10] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:47:10] [INFO ] Invariant cache hit.
[2025-06-04 14:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 307/310 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 84/394 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 205/599 variables, 41/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/611 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/621 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/622 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/622 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 852/1474 variables, 622/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1474 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1474 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1475 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1475 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1475 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1475/1475 variables, and 721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 623/623 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 307/310 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 310/1475 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 2/91 constraints, Generalized P Invariants (flows): 1/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 543ms 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 (NOT p2)), (X p0), (X (X p1)), (X (X p0)), (G (OR p2 p1))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 42 out of 623 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 : 623/623 places, 856/856 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 623 transition count 852
Reduce places removed 4 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 45 rules applied. Total rules applied 49 place count 619 transition count 811
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 90 place count 578 transition count 811
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 90 place count 578 transition count 808
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 575 transition count 808
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 100 place count 573 transition count 806
Applied a total of 100 rules in 109 ms. Remains 573 /623 variables (removed 50) and now considering 806/856 (removed 50) transitions.
Running 800 sub problems to find dead transitions.
[2025-06-04 14:47:11] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
// Phase 1: matrix 802 rows 573 cols
[2025-06-04 14:47:11] [INFO ] Computed 97 invariants in 13 ms
[2025-06-04 14:47: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/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1375 variables, and 96 constraints, problems are : Problem set: 0 solved, 800 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/1375 variables, and 96 constraints, problems are : Problem set: 0 solved, 800 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40670ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 40672ms
[2025-06-04 14:47:52] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
[2025-06-04 14:47:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:47:53] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2025-06-04 14:47:53] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
[2025-06-04 14:47:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:47:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:47:56] [INFO ] Implicit Places using invariants and state equation in 3213 ms returned []
Implicit Place search using SMT with State Equation took 4424 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 14:47:56] [INFO ] Redundant transitions in 50 ms returned []
Running 800 sub problems to find dead transitions.
[2025-06-04 14:47:56] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
[2025-06-04 14:47:56] [INFO ] Invariant cache hit.
[2025-06-04 14:47:56] [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/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:48:24] [INFO ] Deduced a trap composed of 136 places in 240 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.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 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 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.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 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 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 0.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 1.0)
(s126 0.0)
(s127 1.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 0.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 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.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)
(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 0.0)
(s203 0.0)
(s204 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1375 variables, and 97 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:48:50] [INFO ] Deduced a trap composed of 136 places in 271 ms of which 59 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/1375 variables, and 98 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/800 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60589ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Starting structural reductions in SI_LTL mode, iteration 1 : 573/623 places, 806/856 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105858 ms. Remains : 573/623 places, 806/856 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 : [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 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 457 steps (29 resets) in 8 ms. (50 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 84 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6498 reset in 447 ms.
Product exploration explored 100000 steps with 6447 reset in 499 ms.
Built C files in :
/tmp/ltsmin7098610839525879866
[2025-06-04 14:48:59] [INFO ] Computing symmetric may disable matrix : 806 transitions.
[2025-06-04 14:48:59] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:48:59] [INFO ] Computing symmetric may enable matrix : 806 transitions.
[2025-06-04 14:48:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:48:59] [INFO ] Computing Do-Not-Accords matrix : 806 transitions.
[2025-06-04 14:48:59] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:48:59] [INFO ] Built C files in 204ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7098610839525879866
Running compilation step : cd /tmp/ltsmin7098610839525879866;'/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 2588 ms.
Running link step : cd /tmp/ltsmin7098610839525879866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin7098610839525879866;'/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/stateBased13438451931992496194.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 42 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 806/806 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 573 transition count 805
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 805
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 571 transition count 804
Applied a total of 4 rules in 57 ms. Remains 571 /573 variables (removed 2) and now considering 804/806 (removed 2) transitions.
Running 798 sub problems to find dead transitions.
[2025-06-04 14:49:14] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
// Phase 1: matrix 800 rows 571 cols
[2025-06-04 14:49:14] [INFO ] Computed 97 invariants in 11 ms
[2025-06-04 14:49: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/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:24] [INFO ] Deduced a trap composed of 176 places in 226 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:24] [INFO ] Deduced a trap composed of 176 places in 236 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:24] [INFO ] Deduced a trap composed of 176 places in 234 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:25] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:25] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:25] [INFO ] Deduced a trap composed of 178 places in 224 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:25] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:26] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:26] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:26] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:26] [INFO ] Deduced a trap composed of 178 places in 197 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:27] [INFO ] Deduced a trap composed of 178 places in 217 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:27] [INFO ] Deduced a trap composed of 178 places in 217 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:27] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:27] [INFO ] Deduced a trap composed of 178 places in 202 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:27] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:28] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:28] [INFO ] Deduced a trap composed of 178 places in 217 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:28] [INFO ] Deduced a trap composed of 178 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-04 14:49:28] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.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 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/1371 variables, and 112 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:45] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:47] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:47] [INFO ] Deduced a trap composed of 177 places in 266 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:47] [INFO ] Deduced a trap composed of 178 places in 266 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:48] [INFO ] Deduced a trap composed of 178 places in 261 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:48] [INFO ] Deduced a trap composed of 177 places in 237 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:48] [INFO ] Deduced a trap composed of 178 places in 265 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:48] [INFO ] Deduced a trap composed of 177 places in 245 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:49] [INFO ] Deduced a trap composed of 178 places in 271 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:49] [INFO ] Deduced a trap composed of 178 places in 247 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:49] [INFO ] Deduced a trap composed of 178 places in 248 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:50] [INFO ] Deduced a trap composed of 178 places in 252 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:50] [INFO ] Deduced a trap composed of 178 places in 266 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:50] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:50] [INFO ] Deduced a trap composed of 178 places in 259 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:51] [INFO ] Deduced a trap composed of 178 places in 251 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:51] [INFO ] Deduced a trap composed of 178 places in 259 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:51] [INFO ] Deduced a trap composed of 178 places in 250 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:52] [INFO ] Deduced a trap composed of 178 places in 250 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:49:52] [INFO ] Deduced a trap composed of 178 places in 253 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/1371 variables, and 132 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40644ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 40646ms
[2025-06-04 14:49:54] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
[2025-06-04 14:49:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:49:56] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2025-06-04 14:49:56] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
[2025-06-04 14:49:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:49:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:50:00] [INFO ] Implicit Places using invariants and state equation in 4049 ms returned []
Implicit Place search using SMT with State Equation took 5360 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 14:50:00] [INFO ] Redundant transitions in 7 ms returned []
Running 798 sub problems to find dead transitions.
[2025-06-04 14:50:00] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
[2025-06-04 14:50:00] [INFO ] Invariant cache hit.
[2025-06-04 14:50:00] [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/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:10] [INFO ] Deduced a trap composed of 176 places in 257 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:10] [INFO ] Deduced a trap composed of 178 places in 251 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:10] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:11] [INFO ] Deduced a trap composed of 178 places in 223 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:11] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:11] [INFO ] Deduced a trap composed of 178 places in 217 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:11] [INFO ] Deduced a trap composed of 178 places in 239 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:12] [INFO ] Deduced a trap composed of 176 places in 208 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:12] [INFO ] Deduced a trap composed of 178 places in 221 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:12] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:12] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:13] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:13] [INFO ] Deduced a trap composed of 178 places in 223 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:13] [INFO ] Deduced a trap composed of 176 places in 218 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:13] [INFO ] Deduced a trap composed of 178 places in 222 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:14] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:14] [INFO ] Deduced a trap composed of 178 places in 232 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:14] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:14] [INFO ] Deduced a trap composed of 178 places in 238 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:15] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:16] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:16] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:16] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:16] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:17] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:17] [INFO ] Deduced a trap composed of 178 places in 250 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:17] [INFO ] Deduced a trap composed of 178 places in 249 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:18] [INFO ] Deduced a trap composed of 178 places in 246 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:18] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:18] [INFO ] Deduced a trap composed of 178 places in 237 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:19] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:19] [INFO ] Deduced a trap composed of 178 places in 241 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:19] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:19] [INFO ] Deduced a trap composed of 178 places in 238 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:20] [INFO ] Deduced a trap composed of 178 places in 224 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:22] [INFO ] Deduced a trap composed of 96 places in 245 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:23] [INFO ] Deduced a trap composed of 96 places in 237 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:23] [INFO ] Deduced a trap composed of 96 places in 225 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:23] [INFO ] Deduced a trap composed of 96 places in 238 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:23] [INFO ] Deduced a trap composed of 96 places in 241 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/1371 variables, and 132 constraints, problems are : Problem set: 0 solved, 798 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:34] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:34] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:34] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:34] [INFO ] Deduced a trap composed of 178 places in 202 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:35] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:35] [INFO ] Deduced a trap composed of 178 places in 202 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:35] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:35] [INFO ] Deduced a trap composed of 176 places in 250 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:36] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:36] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:36] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:36] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:36] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:37] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:37] [INFO ] Deduced a trap composed of 178 places in 196 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:37] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:37] [INFO ] Deduced a trap composed of 178 places in 201 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:38] [INFO ] Deduced a trap composed of 178 places in 221 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:38] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:38] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:41] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:42] [INFO ] Deduced a trap composed of 178 places in 253 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:42] [INFO ] Deduced a trap composed of 178 places in 251 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:42] [INFO ] Deduced a trap composed of 178 places in 254 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:43] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:43] [INFO ] Deduced a trap composed of 178 places in 242 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:43] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:43] [INFO ] Deduced a trap composed of 178 places in 239 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:44] [INFO ] Deduced a trap composed of 178 places in 246 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:44] [INFO ] Deduced a trap composed of 178 places in 232 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:44] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:45] [INFO ] Deduced a trap composed of 178 places in 248 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:45] [INFO ] Deduced a trap composed of 178 places in 249 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:45] [INFO ] Deduced a trap composed of 178 places in 247 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:45] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:46] [INFO ] Deduced a trap composed of 178 places in 233 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:46] [INFO ] Deduced a trap composed of 178 places in 251 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:46] [INFO ] Deduced a trap composed of 178 places in 238 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:47] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:47] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 57 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:49] [INFO ] Deduced a trap composed of 178 places in 276 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:49] [INFO ] Deduced a trap composed of 178 places in 268 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:49] [INFO ] Deduced a trap composed of 178 places in 276 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:50] [INFO ] Deduced a trap composed of 178 places in 269 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:50] [INFO ] Deduced a trap composed of 178 places in 246 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:50] [INFO ] Deduced a trap composed of 178 places in 256 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:50] [INFO ] Deduced a trap composed of 178 places in 248 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:51] [INFO ] Deduced a trap composed of 178 places in 249 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:51] [INFO ] Deduced a trap composed of 178 places in 227 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:51] [INFO ] Deduced a trap composed of 178 places in 233 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:51] [INFO ] Deduced a trap composed of 178 places in 235 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:52] [INFO ] Deduced a trap composed of 178 places in 257 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:52] [INFO ] Deduced a trap composed of 178 places in 267 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:53] [INFO ] Deduced a trap composed of 178 places in 264 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:53] [INFO ] Deduced a trap composed of 178 places in 281 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:53] [INFO ] Deduced a trap composed of 178 places in 272 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:54] [INFO ] Deduced a trap composed of 178 places in 254 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:54] [INFO ] Deduced a trap composed of 177 places in 256 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:54] [INFO ] Deduced a trap composed of 178 places in 238 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:54] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 58 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:57] [INFO ] Deduced a trap composed of 178 places in 266 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:57] [INFO ] Deduced a trap composed of 178 places in 251 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:58] [INFO ] Deduced a trap composed of 178 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-04 14:50:58] [INFO ] Deduced a trap composed of 178 places in 246 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:58] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:59] [INFO ] Deduced a trap composed of 178 places in 257 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:59] [INFO ] Deduced a trap composed of 178 places in 240 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:59] [INFO ] Deduced a trap composed of 178 places in 241 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:59] [INFO ] Deduced a trap composed of 178 places in 258 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:51:00] [INFO ] Deduced a trap composed of 178 places in 256 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:51:00] [INFO ] Deduced a trap composed of 177 places in 245 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:51:00] [INFO ] Deduced a trap composed of 177 places in 244 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:51:01] [INFO ] Deduced a trap composed of 177 places in 244 ms of which 56 ms to minimize.
SMT process timed out in 60831ms, After SMT, problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 60833ms
Starting structural reductions in SI_LTL mode, iteration 1 : 571/573 places, 804/806 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106912 ms. Remains : 571/573 places, 804/806 transitions.
Built C files in :
/tmp/ltsmin3295691806216762745
[2025-06-04 14:51:01] [INFO ] Computing symmetric may disable matrix : 804 transitions.
[2025-06-04 14:51:01] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:51:01] [INFO ] Computing symmetric may enable matrix : 804 transitions.
[2025-06-04 14:51:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:51:01] [INFO ] Computing Do-Not-Accords matrix : 804 transitions.
[2025-06-04 14:51:01] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:51:01] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3295691806216762745
Running compilation step : cd /tmp/ltsmin3295691806216762745;'/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 2452 ms.
Running link step : cd /tmp/ltsmin3295691806216762745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3295691806216762745;'/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/stateBased5852973361884562099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 14:51:16] [INFO ] Flatten gal took : 47 ms
[2025-06-04 14:51:16] [INFO ] Flatten gal took : 70 ms
[2025-06-04 14:51:16] [INFO ] Time to serialize gal into /tmp/LTL18154341967132146373.gal : 8 ms
[2025-06-04 14:51:16] [INFO ] Time to serialize properties into /tmp/LTL16051293488989030848.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/LTL18154341967132146373.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15765773165203111874.hoa' '-atoms' '/tmp/LTL16051293488989030848.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...320
Loading property file /tmp/LTL16051293488989030848.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15765773165203111874.hoa
Detected timeout of ITS tools.
[2025-06-04 14:51:31] [INFO ] Flatten gal took : 42 ms
[2025-06-04 14:51:31] [INFO ] Flatten gal took : 39 ms
[2025-06-04 14:51:31] [INFO ] Time to serialize gal into /tmp/LTL3684083852329155850.gal : 8 ms
[2025-06-04 14:51:31] [INFO ] Time to serialize properties into /tmp/LTL271676280532856416.ltl : 3 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/LTL3684083852329155850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL271676280532856416.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...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((((FetchJobE_0+FetchJobE_1)+(FetchJobE_2+FetchJobE_3))+((FetchJobE_4+FetchJobE_5)+(FetchJobE_6+FetchJobE_7)))+(((FetchJob...1430
Formula 0 simplified : XF(!"(((((((FetchJobE_0+FetchJobE_1)+(FetchJobE_2+FetchJobE_3))+((FetchJobE_4+FetchJobE_5)+(FetchJobE_6+FetchJobE_7)))+(((FetchJobE_...1337
Detected timeout of ITS tools.
[2025-06-04 14:51:46] [INFO ] Flatten gal took : 34 ms
[2025-06-04 14:51:46] [INFO ] Applying decomposition
[2025-06-04 14:51:46] [INFO ] Flatten gal took : 34 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/graph17283639954525106443.txt' '-o' '/tmp/graph17283639954525106443.bin' '-w' '/tmp/graph17283639954525106443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17283639954525106443.bin' '-l' '-1' '-v' '-w' '/tmp/graph17283639954525106443.weights' '-q' '0' '-e' '0.001'
[2025-06-04 14:51:46] [INFO ] Decomposing Gal with order
[2025-06-04 14:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 14:51:47] [INFO ] Removed a total of 1065 redundant transitions.
[2025-06-04 14:51:47] [INFO ] Flatten gal took : 281 ms
[2025-06-04 14:51:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 47 ms.
[2025-06-04 14:51:47] [INFO ] Time to serialize gal into /tmp/LTL16481139359257315701.gal : 11 ms
[2025-06-04 14:51:47] [INFO ] Time to serialize properties into /tmp/LTL5602487035585420747.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/LTL16481139359257315701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5602487035585420747.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((((gu1.FetchJobE_0+gu1.FetchJobE_1)+(gu1.FetchJobE_2+gu1.FetchJobE_3))+((gu1.FetchJobE_4+gu1.FetchJobE_5)+(gu1.FetchJobE_...1870
Formula 0 simplified : XF(!"(((((((gu1.FetchJobE_0+gu1.FetchJobE_1)+(gu1.FetchJobE_2+gu1.FetchJobE_3))+((gu1.FetchJobE_4+gu1.FetchJobE_5)+(gu1.FetchJobE_6+...1725
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-01 finished in 399809 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(G((p0||G((p1||X(X(p2)))))))))'
Support contains 8 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 29 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:52:02] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2025-06-04 14:52:02] [INFO ] Computed 97 invariants in 12 ms
[2025-06-04 14:52:02] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:52:30] [INFO ] Deduced a trap composed of 12 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-04 14:52:30] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 93 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40610ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 40612ms
[2025-06-04 14:52:43] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:52:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:52:44] [INFO ] Implicit Places using invariants in 1632 ms returned []
[2025-06-04 14:52:44] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:52:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:52:48] [INFO ] Implicit Places using invariants and state equation in 3752 ms returned []
Implicit Place search using SMT with State Equation took 5386 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:52:48] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:52:48] [INFO ] Invariant cache hit.
[2025-06-04 14:52:48] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:53:23] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60542ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60545ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 856/857 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106578 ms. Remains : 623/629 places, 856/857 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-03
Product exploration explored 100000 steps with 12035 reset in 290 ms.
Product exploration explored 100000 steps with 12084 reset in 293 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 (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
RANDOM walk for 835 steps (55 resets) in 8 ms. (92 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Support contains 6 out of 623 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Applied a total of 0 rules in 20 ms. Remains 623 /623 variables (removed 0) and now considering 856/856 (removed 0) transitions.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:53:50] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:53:50] [INFO ] Invariant cache hit.
[2025-06-04 14:53:50] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:54:16] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 unsolved
(s58 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0timeout
)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40638ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 40640ms
[2025-06-04 14:54:31] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:54:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:54:33] [INFO ] Implicit Places using invariants in 1540 ms returned []
[2025-06-04 14:54:33] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:54:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:54:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:54:36] [INFO ] Implicit Places using invariants and state equation in 3686 ms returned []
Implicit Place search using SMT with State Equation took 5230 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:54:36] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:54:36] [INFO ] Invariant cache hit.
[2025-06-04 14:54: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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:12] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60631ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60636ms
Finished structural reductions in LTL mode , in 1 iterations and 106532 ms. Remains : 623/623 places, 856/856 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
RANDOM walk for 414 steps (24 resets) in 6 ms. (59 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Product exploration explored 100000 steps with 12138 reset in 276 ms.
Product exploration explored 100000 steps with 12144 reset in 318 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Support contains 6 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 623 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 44 place count 623 transition count 857
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 623 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 622 transition count 856
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 622 transition count 856
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 94 place count 622 transition count 856
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 138 place count 578 transition count 812
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 182 place count 578 transition count 812
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 182 rules in 119 ms. Remains 578 /623 variables (removed 45) and now considering 812/856 (removed 44) transitions.
Running 806 sub problems to find dead transitions.
[2025-06-04 14:55:39] [INFO ] Flow matrix only has 808 transitions (discarded 4 similar events)
// Phase 1: matrix 808 rows 578 cols
[2025-06-04 14:55:39] [INFO ] Computed 97 invariants in 14 ms
[2025-06-04 14:55:40] [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/573 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:49] [INFO ] Deduced a trap composed of 135 places in 217 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:50] [INFO ] Deduced a trap composed of 138 places in 236 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:50] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:50] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:50] [INFO ] Deduced a trap composed of 138 places in 250 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:51] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:51] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:51] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:51] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:52] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:52] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:52] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:52] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:53] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:53] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:53] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:53] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:54] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:54] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:55:54] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/1386 variables, and 112 constraints, problems are : Problem set: 0 solved, 806 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/578 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 806/806 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 806 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:04] [INFO ] Deduced a trap composed of 135 places in 233 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:05] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:05] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:05] [INFO ] Deduced a trap composed of 138 places in 242 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:05] [INFO ] Deduced a trap composed of 138 places in 232 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:06] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:06] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:06] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:06] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:07] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:07] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:07] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:08] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:08] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:08] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:08] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:09] [INFO ] Deduced a trap composed of 138 places in 233 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:09] [INFO ] Deduced a trap composed of 138 places in 240 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:09] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:09] [INFO ] Deduced a trap composed of 138 places in 247 ms of which 61 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:13] [INFO ] Deduced a trap composed of 135 places in 205 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:14] [INFO ] Deduced a trap composed of 135 places in 248 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:15] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 17 ms to minimize.
Problem TDEAD165 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:19] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:19] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:19] [INFO ] Deduced a trap composed of 53 places in 225 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:20] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 28 ms to minimize.
Problem TDEAD426 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:20] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 14 ms to minimize.
Problem TDEAD427 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:56:20] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 13 ms to minimize.
SMT process timed out in 40762ms, After SMT, problems are : Problem set: 3 solved, 803 unsolved
Search for dead transitions found 3 dead transitions in 40765ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 3 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 14:56:20] [INFO ] Redundant transitions in 6 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 578/623 places, 809/856 transitions.
Graph (complete) has 2948 edges and 578 vertex of which 576 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Deduced a syphon composed of 45 places in 1 ms
Applied a total of 1 rules in 27 ms. Remains 576 /578 variables (removed 2) and now considering 809/809 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 576/623 places, 809/856 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40923 ms. Remains : 576/623 places, 809/856 transitions.
Built C files in :
/tmp/ltsmin8343818639027607282
[2025-06-04 14:56:20] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8343818639027607282
Running compilation step : cd /tmp/ltsmin8343818639027607282;'/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 1614 ms.
Running link step : cd /tmp/ltsmin8343818639027607282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8343818639027607282;'/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/stateBased1980477103864727624.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Applied a total of 0 rules in 10 ms. Remains 623 /623 variables (removed 0) and now considering 856/856 (removed 0) transitions.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:56:35] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2025-06-04 14:56:35] [INFO ] Computed 97 invariants in 11 ms
[2025-06-04 14:56:35] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:57:04] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:57:04] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 93 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40756ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 40758ms
[2025-06-04 14:57:16] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:57:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:57:18] [INFO ] Implicit Places using invariants in 1579 ms returned []
[2025-06-04 14:57:18] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:57:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:57:22] [INFO ] Implicit Places using invariants and state equation in 3937 ms returned []
Implicit Place search using SMT with State Equation took 5526 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:57:22] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:57:22] [INFO ] Invariant cache hit.
[2025-06-04 14:57:22] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:57:57] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60585ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Finished structural reductions in LTL mode , in 1 iterations and 106889 ms. Remains : 623/623 places, 856/856 transitions.
Built C files in :
/tmp/ltsmin16277509367729537703
[2025-06-04 14:58:22] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16277509367729537703
Running compilation step : cd /tmp/ltsmin16277509367729537703;'/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 1599 ms.
Running link step : cd /tmp/ltsmin16277509367729537703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16277509367729537703;'/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/stateBased2120211987555194727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 14:58:38] [INFO ] Flatten gal took : 47 ms
[2025-06-04 14:58:38] [INFO ] Flatten gal took : 49 ms
[2025-06-04 14:58:38] [INFO ] Time to serialize gal into /tmp/LTL11562525854129451139.gal : 9 ms
[2025-06-04 14:58:38] [INFO ] Time to serialize properties into /tmp/LTL4782177752923274908.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11562525854129451139.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12253210149999099055.hoa' '-atoms' '/tmp/LTL4782177752923274908.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4782177752923274908.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12253210149999099055.hoa
Detected timeout of ITS tools.
[2025-06-04 14:58:53] [INFO ] Flatten gal took : 31 ms
[2025-06-04 14:58:53] [INFO ] Flatten gal took : 32 ms
[2025-06-04 14:58:53] [INFO ] Time to serialize gal into /tmp/LTL1787855913655742604.gal : 8 ms
[2025-06-04 14:58:53] [INFO ] Time to serialize properties into /tmp/LTL9937400527845544928.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/LTL1787855913655742604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9937400527845544928.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 : !((X(X(G(("(place_460>NotifyEventEndOfCheckSourcesE)")||(G(("((((TheSour_0+TheSour_1)+(TheSour_2+TheSour_3))+TheSour_4)<3)")||(X(X("(N...189
Formula 0 simplified : XXF(!"(place_460>NotifyEventEndOfCheckSourcesE)" & F(!"((((TheSour_0+TheSour_1)+(TheSour_2+TheSour_3))+TheSour_4)<3)" & XX!"(NotifyE...175
Detected timeout of ITS tools.
[2025-06-04 14:59:08] [INFO ] Flatten gal took : 40 ms
[2025-06-04 14:59:08] [INFO ] Applying decomposition
[2025-06-04 14:59:08] [INFO ] Flatten gal took : 32 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/graph499903393282914914.txt' '-o' '/tmp/graph499903393282914914.bin' '-w' '/tmp/graph499903393282914914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph499903393282914914.bin' '-l' '-1' '-v' '-w' '/tmp/graph499903393282914914.weights' '-q' '0' '-e' '0.001'
[2025-06-04 14:59:08] [INFO ] Decomposing Gal with order
[2025-06-04 14:59:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 14:59:08] [INFO ] Removed a total of 919 redundant transitions.
[2025-06-04 14:59:08] [INFO ] Flatten gal took : 88 ms
[2025-06-04 14:59:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 42 ms.
[2025-06-04 14:59:08] [INFO ] Time to serialize gal into /tmp/LTL999152340752576729.gal : 12 ms
[2025-06-04 14:59:08] [INFO ] Time to serialize properties into /tmp/LTL9244157628121946123.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/LTL999152340752576729.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9244157628121946123.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...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(gu37.place_460>gu37.NotifyEventEndOfCheckSourcesE)")||(G(("((((gu64.TheSour_0+gu64.TheSour_1)+(gu64.TheSour_2+gu64.TheSour...236
Formula 0 simplified : XXF(!"(gu37.place_460>gu37.NotifyEventEndOfCheckSourcesE)" & F(!"((((gu64.TheSour_0+gu64.TheSour_1)+(gu64.TheSour_2+gu64.TheSour_3))...222
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-03 finished in 441436 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(G(p0))))'
Support contains 2 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 28 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2025-06-04 14:59:23] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 14:59:23] [INFO ] Invariant cache hit.
[2025-06-04 14:59:23] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:59:49] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 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 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40642ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 40643ms
[2025-06-04 15:00:04] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 15:00:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:00:06] [INFO ] Implicit Places using invariants in 1622 ms returned []
[2025-06-04 15:00:06] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 15:00:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:00:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:00:09] [INFO ] Implicit Places using invariants and state equation in 3031 ms returned []
Implicit Place search using SMT with State Equation took 4658 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2025-06-04 15:00:09] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 15:00:09] [INFO ] Invariant cache hit.
[2025-06-04 15:00:09] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:00:44] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60564ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60567ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 856/857 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105902 ms. Remains : 623/629 places, 856/857 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-05 finished in 106076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 811
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 811
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 578 transition count 766
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 533 transition count 766
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 532 transition count 765
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 532 transition count 765
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 188 place count 530 transition count 763
Applied a total of 188 rules in 58 ms. Remains 530 /629 variables (removed 99) and now considering 763/857 (removed 94) transitions.
Running 757 sub problems to find dead transitions.
[2025-06-04 15:01:10] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
// Phase 1: matrix 759 rows 530 cols
[2025-06-04 15:01:10] [INFO ] Computed 97 invariants in 20 ms
[2025-06-04 15:01:10] [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/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:17] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:17] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:17] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:18] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:18] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:18] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:18] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:19] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:19] [INFO ] Deduced a trap composed of 134 places in 192 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:19] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:19] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:19] [INFO ] Deduced a trap composed of 136 places in 199 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:20] [INFO ] Deduced a trap composed of 134 places in 193 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:20] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:20] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:20] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:20] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:21] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:21] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:21] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:22] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:22] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:22] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:23] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:23] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:23] [INFO ] Deduced a trap composed of 136 places in 199 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:23] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:23] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:24] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:24] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:24] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:24] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:24] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:25] [INFO ] Deduced a trap composed of 134 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-04 15:01:25] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:25] [INFO ] Deduced a trap composed of 136 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-04 15:01:25] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:26] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:26] [INFO ] Deduced a trap composed of 136 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-04 15:01:26] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 26 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/525 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/1289 variables, and 132 constraints, problems are : Problem set: 0 solved, 757 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:34] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:34] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:34] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:34] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:35] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:35] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:35] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:35] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:35] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:36] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:36] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:36] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:36] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:37] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:37] [INFO ] Deduced a trap composed of 136 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-04 15:01:37] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:37] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:37] [INFO ] Deduced a trap composed of 137 places in 234 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:38] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:38] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:41] [INFO ] Deduced a trap composed of 134 places in 201 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:41] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:41] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:41] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:42] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:42] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:42] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:42] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:43] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:43] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:43] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:43] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:43] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:44] [INFO ] Deduced a trap composed of 136 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-04 15:01:44] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:44] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:44] [INFO ] Deduced a trap composed of 136 places in 224 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:45] [INFO ] Deduced a trap composed of 136 places in 225 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:45] [INFO ] Deduced a trap composed of 136 places in 227 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:45] [INFO ] Deduced a trap composed of 136 places in 224 ms of which 43 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:46] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:46] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:47] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:47] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:47] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:47] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:48] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:48] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:49] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:50] [INFO ] Deduced a trap composed of 136 places in 227 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:01:50] [INFO ] Deduced a trap composed of 136 places in 227 ms of which 44 ms to minimize.
SMT process timed out in 40710ms, After SMT, problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 40712ms
[2025-06-04 15:01:50] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2025-06-04 15:01:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:01:51] [INFO ] Implicit Places using invariants in 934 ms returned []
[2025-06-04 15:01:51] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2025-06-04 15:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:01:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:01:54] [INFO ] Implicit Places using invariants and state equation in 2611 ms returned []
Implicit Place search using SMT with State Equation took 3547 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:01:54] [INFO ] Redundant transitions in 8 ms returned []
Running 757 sub problems to find dead transitions.
[2025-06-04 15:01:54] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2025-06-04 15:01:54] [INFO ] Invariant cache hit.
[2025-06-04 15:01:54] [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/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:01] [INFO ] Deduced a trap composed of 136 places in 218 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:02] [INFO ] Deduced a trap composed of 136 places in 236 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:02] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:02] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:03] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:03] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:03] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:03] [INFO ] Deduced a trap composed of 136 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:04] [INFO ] Deduced a trap composed of 136 places in 280 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:04] [INFO ] Deduced a trap composed of 136 places in 243 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:04] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:11] [INFO ] Deduced a trap composed of 139 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:11] [INFO ] Deduced a trap composed of 139 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:12] [INFO ] Deduced a trap composed of 139 places in 192 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:12] [INFO ] Deduced a trap composed of 139 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:12] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:12] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:12] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:13] [INFO ] Deduced a trap composed of 139 places in 208 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:13] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:13] [INFO ] Deduced a trap composed of 139 places in 270 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:13] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:14] [INFO ] Deduced a trap composed of 139 places in 214 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:14] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:14] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:14] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:15] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:15] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:15] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:15] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:16] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:23] [INFO ] Deduced a trap composed of 134 places in 227 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:23] [INFO ] Deduced a trap composed of 136 places in 229 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:23] [INFO ] Deduced a trap composed of 136 places in 227 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:24] [INFO ] Deduced a trap composed of 136 places in 259 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:24] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:24] [INFO ] Deduced a trap composed of 136 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:24] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 24 ms to minimize.
SMT process timed out in 30498ms, After SMT, problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 30500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 530/629 places, 763/857 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74839 ms. Remains : 530/629 places, 763/857 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-07 finished in 74932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (X(p1)&&(G(p2)||(p2&&F(p3))))))'
Support contains 250 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 11 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2025-06-04 15:02:24] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2025-06-04 15:02:24] [INFO ] Computed 97 invariants in 42 ms
[2025-06-04 15:02: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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.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 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 (/ 3.0 4.0))
(s43 0.0)
(s44 1.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 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.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 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 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 0.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 (/ 1.0 3.0))
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.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 0.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 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 (/ 1.0 3.0))
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:53] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:02:53] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 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 617/1475 variables, and 93 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40668ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 40670ms
[2025-06-04 15:03:05] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 15:03:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:03:06] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2025-06-04 15:03:06] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 15:03:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:03:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:03:09] [INFO ] Implicit Places using invariants and state equation in 3138 ms returned []
Implicit Place search using SMT with State Equation took 4317 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2025-06-04 15:03:09] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2025-06-04 15:03:09] [INFO ] Invariant cache hit.
[2025-06-04 15:03:09] [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/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:03:45] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1475 variables, and 92 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60586ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60591ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 856/857 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105595 ms. Remains : 623/629 places, 856/857 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2) p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-09 finished in 106015 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' '!((p0 U (G(p0)||(p0&&(G(p1)||G(!p2))))))'
Support contains 49 out of 629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 624 transition count 854
Reduce places removed 3 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 46 rules applied. Total rules applied 49 place count 621 transition count 811
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 92 place count 578 transition count 811
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 92 place count 578 transition count 809
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 96 place count 576 transition count 809
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 575 transition count 808
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 575 transition count 808
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 102 place count 573 transition count 806
Applied a total of 102 rules in 118 ms. Remains 573 /629 variables (removed 56) and now considering 806/857 (removed 51) transitions.
Running 800 sub problems to find dead transitions.
[2025-06-04 15:04:11] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
// Phase 1: matrix 802 rows 573 cols
[2025-06-04 15:04:11] [INFO ] Computed 97 invariants in 18 ms
[2025-06-04 15:04: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/568 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:21] [INFO ] Deduced a trap composed of 177 places in 273 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:21] [INFO ] Deduced a trap composed of 177 places in 262 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:22] [INFO ] Deduced a trap composed of 177 places in 244 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:22] [INFO ] Deduced a trap composed of 180 places in 213 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:22] [INFO ] Deduced a trap composed of 180 places in 236 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:22] [INFO ] Deduced a trap composed of 180 places in 218 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:22] [INFO ] Deduced a trap composed of 180 places in 209 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:23] [INFO ] Deduced a trap composed of 180 places in 214 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:23] [INFO ] Deduced a trap composed of 180 places in 217 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:23] [INFO ] Deduced a trap composed of 180 places in 227 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:23] [INFO ] Deduced a trap composed of 180 places in 276 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:24] [INFO ] Deduced a trap composed of 180 places in 246 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:24] [INFO ] Deduced a trap composed of 180 places in 257 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:24] [INFO ] Deduced a trap composed of 179 places in 211 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:24] [INFO ] Deduced a trap composed of 180 places in 234 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:25] [INFO ] Deduced a trap composed of 179 places in 219 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:25] [INFO ] Deduced a trap composed of 180 places in 236 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:25] [INFO ] Deduced a trap composed of 180 places in 217 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:25] [INFO ] Deduced a trap composed of 180 places in 209 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:26] [INFO ] Deduced a trap composed of 180 places in 253 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/568 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/1375 variables, and 112 constraints, problems are : Problem set: 0 solved, 800 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/568 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:35] [INFO ] Deduced a trap composed of 257 places in 204 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:35] [INFO ] Deduced a trap composed of 180 places in 225 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:36] [INFO ] Deduced a trap composed of 180 places in 215 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:36] [INFO ] Deduced a trap composed of 180 places in 222 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:36] [INFO ] Deduced a trap composed of 180 places in 233 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:36] [INFO ] Deduced a trap composed of 180 places in 245 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:37] [INFO ] Deduced a trap composed of 180 places in 232 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:37] [INFO ] Deduced a trap composed of 180 places in 213 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:37] [INFO ] Deduced a trap composed of 180 places in 256 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:37] [INFO ] Deduced a trap composed of 180 places in 262 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:38] [INFO ] Deduced a trap composed of 180 places in 251 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:38] [INFO ] Deduced a trap composed of 180 places in 246 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:38] [INFO ] Deduced a trap composed of 180 places in 253 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:39] [INFO ] Deduced a trap composed of 180 places in 257 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:39] [INFO ] Deduced a trap composed of 180 places in 268 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:39] [INFO ] Deduced a trap composed of 180 places in 242 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:39] [INFO ] Deduced a trap composed of 180 places in 232 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:40] [INFO ] Deduced a trap composed of 180 places in 245 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:40] [INFO ] Deduced a trap composed of 180 places in 259 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:40] [INFO ] Deduced a trap composed of 180 places in 251 ms of which 59 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/568 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:43] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:45] [INFO ] Deduced a trap composed of 177 places in 249 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:45] [INFO ] Deduced a trap composed of 180 places in 256 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:45] [INFO ] Deduced a trap composed of 180 places in 238 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:46] [INFO ] Deduced a trap composed of 180 places in 252 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:46] [INFO ] Deduced a trap composed of 180 places in 250 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:46] [INFO ] Deduced a trap composed of 180 places in 242 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:46] [INFO ] Deduced a trap composed of 180 places in 238 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:47] [INFO ] Deduced a trap composed of 179 places in 250 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:47] [INFO ] Deduced a trap composed of 179 places in 260 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:47] [INFO ] Deduced a trap composed of 180 places in 256 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:47] [INFO ] Deduced a trap composed of 179 places in 261 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:48] [INFO ] Deduced a trap composed of 179 places in 252 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:48] [INFO ] Deduced a trap composed of 180 places in 272 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:48] [INFO ] Deduced a trap composed of 179 places in 260 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:48] [INFO ] Deduced a trap composed of 179 places in 247 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:49] [INFO ] Deduced a trap composed of 179 places in 245 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:49] [INFO ] Deduced a trap composed of 179 places in 251 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:49] [INFO ] Deduced a trap composed of 179 places in 250 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:04:49] [INFO ] Deduced a trap composed of 179 places in 244 ms of which 57 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/1375 variables, and 152 constraints, problems are : Problem set: 0 solved, 800 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/800 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40702ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 40704ms
[2025-06-04 15:04:51] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
[2025-06-04 15:04:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:04:52] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2025-06-04 15:04:52] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
[2025-06-04 15:04:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:04:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:04:56] [INFO ] Implicit Places using invariants and state equation in 3824 ms returned []
Implicit Place search using SMT with State Equation took 4964 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:04:56] [INFO ] Redundant transitions in 5 ms returned []
Running 800 sub problems to find dead transitions.
[2025-06-04 15:04:56] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
[2025-06-04 15:04:56] [INFO ] Invariant cache hit.
[2025-06-04 15:04:56] [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/568 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:07] [INFO ] Deduced a trap composed of 177 places in 199 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:07] [INFO ] Deduced a trap composed of 177 places in 217 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:07] [INFO ] Deduced a trap composed of 177 places in 182 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:07] [INFO ] Deduced a trap composed of 180 places in 209 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:08] [INFO ] Deduced a trap composed of 180 places in 214 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:08] [INFO ] Deduced a trap composed of 180 places in 206 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:08] [INFO ] Deduced a trap composed of 180 places in 212 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:08] [INFO ] Deduced a trap composed of 180 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:09] [INFO ] Deduced a trap composed of 180 places in 472 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:09] [INFO ] Deduced a trap composed of 180 places in 218 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:09] [INFO ] Deduced a trap composed of 180 places in 203 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:09] [INFO ] Deduced a trap composed of 180 places in 209 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:10] [INFO ] Deduced a trap composed of 180 places in 203 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:10] [INFO ] Deduced a trap composed of 180 places in 208 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:10] [INFO ] Deduced a trap composed of 180 places in 211 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:10] [INFO ] Deduced a trap composed of 180 places in 212 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:11] [INFO ] Deduced a trap composed of 180 places in 280 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:11] [INFO ] Deduced a trap composed of 180 places in 208 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:11] [INFO ] Deduced a trap composed of 180 places in 217 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:11] [INFO ] Deduced a trap composed of 177 places in 235 ms of which 49 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/568 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 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 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 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/568 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 800 unsolved
SMT process timed out in 30508ms, After SMT, problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 30510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 573/629 places, 806/857 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76317 ms. Remains : 573/629 places, 806/857 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), p2, (NOT p1), (AND p2 (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 92 steps with 6 reset in 5 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-12 finished in 76571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 812
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 811
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 767
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 767
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 533 transition count 766
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 533 transition count 766
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 186 place count 531 transition count 764
Applied a total of 186 rules in 103 ms. Remains 531 /629 variables (removed 98) and now considering 764/857 (removed 93) transitions.
Running 758 sub problems to find dead transitions.
[2025-06-04 15:05:27] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
// Phase 1: matrix 760 rows 531 cols
[2025-06-04 15:05:27] [INFO ] Computed 97 invariants in 8 ms
[2025-06-04 15:05: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/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:35] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:35] [INFO ] Deduced a trap composed of 135 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:35] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:36] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:36] [INFO ] Deduced a trap composed of 135 places in 225 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:36] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:36] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:37] [INFO ] Deduced a trap composed of 137 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:37] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:37] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:37] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:37] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:38] [INFO ] Deduced a trap composed of 137 places in 234 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:38] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:38] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:38] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:39] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:39] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:39] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:39] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:46] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:47] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1291 variables, and 114 constraints, problems are : Problem set: 0 solved, 758 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 22/114 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:50] [INFO ] Deduced a trap composed of 215 places in 233 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:50] [INFO ] Deduced a trap composed of 135 places in 246 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:50] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:51] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:51] [INFO ] Deduced a trap composed of 137 places in 234 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:51] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:51] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:52] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:52] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:52] [INFO ] Deduced a trap composed of 137 places in 255 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:52] [INFO ] Deduced a trap composed of 137 places in 258 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:53] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:53] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:53] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:53] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:54] [INFO ] Deduced a trap composed of 137 places in 229 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:54] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:54] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:54] [INFO ] Deduced a trap composed of 137 places in 236 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:55] [INFO ] Deduced a trap composed of 137 places in 271 ms of which 50 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:58] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:58] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:58] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:58] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:58] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:59] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:59] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:59] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:59] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:05:59] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:00] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:00] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:00] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:00] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:01] [INFO ] Deduced a trap composed of 137 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:01] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:01] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:01] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:01] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:02] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:04] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:05] [INFO ] Deduced a trap composed of 137 places in 234 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:05] [INFO ] Deduced a trap composed of 137 places in 270 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:05] [INFO ] Deduced a trap composed of 137 places in 248 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:06] [INFO ] Deduced a trap composed of 137 places in 250 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:06] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:06] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:06] [INFO ] Deduced a trap composed of 137 places in 229 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:07] [INFO ] Deduced a trap composed of 137 places in 229 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:07] [INFO ] Deduced a trap composed of 137 places in 239 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:07] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:07] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:08] [INFO ] Deduced a trap composed of 137 places in 244 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:08] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:08] [INFO ] Deduced a trap composed of 137 places in 241 ms of which 43 ms to minimize.
SMT process timed out in 41085ms, After SMT, problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 41086ms
[2025-06-04 15:06:08] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2025-06-04 15:06:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:06:09] [INFO ] Implicit Places using invariants in 946 ms returned []
[2025-06-04 15:06:09] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2025-06-04 15:06:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:06:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:06:12] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 3732 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:06:12] [INFO ] Redundant transitions in 5 ms returned []
Running 758 sub problems to find dead transitions.
[2025-06-04 15:06:12] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2025-06-04 15:06:12] [INFO ] Invariant cache hit.
[2025-06-04 15:06: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/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:19] [INFO ] Deduced a trap composed of 135 places in 187 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:20] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:20] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:20] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:20] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:20] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:21] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:21] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:21] [INFO ] Deduced a trap composed of 135 places in 227 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:21] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:22] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:22] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:22] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:22] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:23] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:23] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:23] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:23] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:23] [INFO ] Deduced a trap composed of 135 places in 205 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:24] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:29] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:38] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:39] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:39] [INFO ] Deduced a trap composed of 135 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:39] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:39] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:39] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:40] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:40] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:40] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:40] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:41] [INFO ] Deduced a trap composed of 137 places in 457 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:41] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:41] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:42] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:42] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:42] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:42] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:42] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:06:43] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 22 ms to minimize.
SMT process timed out in 30763ms, After SMT, problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 30774ms
Starting structural reductions in SI_LTL mode, iteration 1 : 531/629 places, 764/857 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75711 ms. Remains : 531/629 places, 764/857 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-14
Stuttering criterion allowed to conclude after 40 steps with 2 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-14 finished in 75800 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((G((F(p1)||X(X(p2)))) U (p0&&G((F(p1)||X(X(p2)))))))))))'
Found a Lengthening insensitive property : PolyORBNT-COL-S05J40-LTLCardinality-01
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 45 out of 629 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 624 transition count 853
Reduce places removed 4 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 45 rules applied. Total rules applied 49 place count 620 transition count 812
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 90 place count 579 transition count 812
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 90 place count 579 transition count 808
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 575 transition count 808
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 574 transition count 807
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 574 transition count 807
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 3 with 2 rules applied. Total rules applied 102 place count 573 transition count 806
Applied a total of 102 rules in 69 ms. Remains 573 /629 variables (removed 56) and now considering 806/857 (removed 51) transitions.
Running 800 sub problems to find dead transitions.
[2025-06-04 15:06:43] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
// Phase 1: matrix 802 rows 573 cols
[2025-06-04 15:06:43] [INFO ] Computed 97 invariants in 8 ms
[2025-06-04 15:06:43] [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/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1375 variables, and 96 constraints, problems are : Problem set: 0 solved, 800 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/1375 variables, and 96 constraints, problems are : Problem set: 0 solved, 800 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40602ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 40603ms
[2025-06-04 15:07:24] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
[2025-06-04 15:07:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:07:25] [INFO ] Implicit Places using invariants in 980 ms returned []
[2025-06-04 15:07:25] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
[2025-06-04 15:07:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:07:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:07:28] [INFO ] Implicit Places using invariants and state equation in 3124 ms returned []
Implicit Place search using SMT with State Equation took 4152 ms to find 0 implicit places.
Running 800 sub problems to find dead transitions.
[2025-06-04 15:07:28] [INFO ] Flow matrix only has 802 transitions (discarded 4 similar events)
[2025-06-04 15:07:28] [INFO ] Invariant cache hit.
[2025-06-04 15:07:28] [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/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Problem TDEAD753 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/573 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:07:58] [INFO ] Deduced a trap composed of 93 places in 259 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:07:58] [INFO ] Deduced a trap composed of 178 places in 228 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/1375 variables, and 99 constraints, problems are : Problem set: 17 solved, 783 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 783 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 17 solved, 783 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 17 solved, 783 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 783 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 0/97 constraints. Problems are: Problem set: 17 solved, 783 unsolved
At refinement iteration 6 (OVERLAPS) 1/573 variables, 1/98 constraints. Problems are: Problem set: 17 solved, 783 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 1/99 constraints. Problems are: Problem set: 17 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:08:27] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/1375 variables, and 100 constraints, problems are : Problem set: 17 solved, 783 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/800 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60690ms problems are : Problem set: 17 solved, 783 unsolved
Search for dead transitions found 17 dead transitions in 60691ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 573/629 places, 789/857 transitions.
Applied a total of 0 rules in 13 ms. Remains 573 /573 variables (removed 0) and now considering 789/789 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 105541 ms. Remains : 573/629 places, 789/857 transitions.
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-01
Product exploration explored 100000 steps with 5911 reset in 417 ms.
Product exploration explored 100000 steps with 6026 reset in 497 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 (NOT p2)), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 40000 steps (2254 resets) in 295 ms. (135 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1376 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
[2025-06-04 15:08:30] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
// Phase 1: matrix 785 rows 573 cols
[2025-06-04 15:08:30] [INFO ] Computed 97 invariants in 8 ms
[2025-06-04 15:08:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 258/261 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 84/345 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 205/550 variables, 41/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/562 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/571 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/572 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 785/1357 variables, 572/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1357 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1357 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1358 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1358 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1358 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1358/1358 variables, and 671 constraints, problems are : Problem set: 0 solved, 1 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 573/573 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 258/261 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 261/1358 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 2/91 constraints, Generalized P Invariants (flows): 1/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 766ms 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 (NOT p2)), (X p0), (X (X p1)), (X (X p0)), (G (OR p2 p1))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Support contains 42 out of 573 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 : 573/573 places, 789/789 transitions.
Applied a total of 0 rules in 30 ms. Remains 573 /573 variables (removed 0) and now considering 789/789 (removed 0) transitions.
Running 783 sub problems to find dead transitions.
[2025-06-04 15:08:31] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-04 15:08:31] [INFO ] Invariant cache hit.
[2025-06-04 15:08:31] [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/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1358 variables, and 96 constraints, problems are : Problem set: 0 solved, 783 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:08:57] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:08:57] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:07] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/1358 variables, and 94 constraints, problems are : Problem set: 0 solved, 783 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 86/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/783 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40586ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 40587ms
[2025-06-04 15:09:12] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-04 15:09:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:09:13] [INFO ] Implicit Places using invariants in 1258 ms returned []
[2025-06-04 15:09:13] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-04 15:09:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:09:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:09:18] [INFO ] Implicit Places using invariants and state equation in 4462 ms returned []
Implicit Place search using SMT with State Equation took 5723 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:09:18] [INFO ] Redundant transitions in 5 ms returned []
Running 783 sub problems to find dead transitions.
[2025-06-04 15:09:18] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-04 15:09:18] [INFO ] Invariant cache hit.
[2025-06-04 15:09:18] [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/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:41] [INFO ] Deduced a trap composed of 99 places in 265 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:41] [INFO ] Deduced a trap composed of 99 places in 451 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:42] [INFO ] Deduced a trap composed of 183 places in 272 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:42] [INFO ] Deduced a trap composed of 183 places in 258 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:42] [INFO ] Deduced a trap composed of 93 places in 291 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:43] [INFO ] Deduced a trap composed of 93 places in 270 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:43] [INFO ] Deduced a trap composed of 93 places in 248 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:43] [INFO ] Deduced a trap composed of 178 places in 262 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:43] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:09:44] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1358 variables, and 106 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (OVERLAPS) 5/572 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:02] [INFO ] Deduced a trap composed of 180 places in 253 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:02] [INFO ] Deduced a trap composed of 180 places in 245 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:03] [INFO ] Deduced a trap composed of 180 places in 247 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:03] [INFO ] Deduced a trap composed of 180 places in 240 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:03] [INFO ] Deduced a trap composed of 180 places in 245 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:03] [INFO ] Deduced a trap composed of 95 places in 267 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:04] [INFO ] Deduced a trap composed of 95 places in 268 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:04] [INFO ] Deduced a trap composed of 180 places in 277 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:04] [INFO ] Deduced a trap composed of 180 places in 245 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:05] [INFO ] Deduced a trap composed of 180 places in 241 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:05] [INFO ] Deduced a trap composed of 180 places in 245 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:05] [INFO ] Deduced a trap composed of 95 places in 247 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:05] [INFO ] Deduced a trap composed of 95 places in 256 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:06] [INFO ] Deduced a trap composed of 95 places in 248 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:06] [INFO ] Deduced a trap composed of 95 places in 247 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:06] [INFO ] Deduced a trap composed of 95 places in 266 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:06] [INFO ] Deduced a trap composed of 95 places in 273 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:07] [INFO ] Deduced a trap composed of 95 places in 289 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:07] [INFO ] Deduced a trap composed of 95 places in 254 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:07] [INFO ] Deduced a trap composed of 95 places in 261 ms of which 66 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:16] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:16] [INFO ] Deduced a trap composed of 93 places in 237 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:16] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:17] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/1358 variables, and 130 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/783 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60645ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 60647ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107019 ms. Remains : 573/573 places, 789/789 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 166 steps (7 resets) in 6 ms. (23 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 112 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6453 reset in 433 ms.
Product exploration explored 100000 steps with 6406 reset in 459 ms.
Built C files in :
/tmp/ltsmin3872879762558162807
[2025-06-04 15:10:20] [INFO ] Computing symmetric may disable matrix : 789 transitions.
[2025-06-04 15:10:20] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:10:20] [INFO ] Computing symmetric may enable matrix : 789 transitions.
[2025-06-04 15:10:20] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:10:20] [INFO ] Computing Do-Not-Accords matrix : 789 transitions.
[2025-06-04 15:10:20] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:10:20] [INFO ] Built C files in 267ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3872879762558162807
Running compilation step : cd /tmp/ltsmin3872879762558162807;'/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 2310 ms.
Running link step : cd /tmp/ltsmin3872879762558162807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin3872879762558162807;'/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/stateBased4712487421264272517.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 42 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 789/789 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 573 transition count 788
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 788
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 571 transition count 787
Applied a total of 4 rules in 37 ms. Remains 571 /573 variables (removed 2) and now considering 787/789 (removed 2) transitions.
Running 781 sub problems to find dead transitions.
[2025-06-04 15:10:35] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
// Phase 1: matrix 783 rows 571 cols
[2025-06-04 15:10:35] [INFO ] Computed 97 invariants in 8 ms
[2025-06-04 15:10:35] [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/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:44] [INFO ] Deduced a trap composed of 176 places in 251 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:45] [INFO ] Deduced a trap composed of 176 places in 255 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:45] [INFO ] Deduced a trap composed of 176 places in 254 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:45] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:46] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:46] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:46] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:46] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:47] [INFO ] Deduced a trap composed of 178 places in 220 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:47] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:47] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:47] [INFO ] Deduced a trap composed of 178 places in 199 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:47] [INFO ] Deduced a trap composed of 177 places in 199 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:48] [INFO ] Deduced a trap composed of 177 places in 194 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:48] [INFO ] Deduced a trap composed of 177 places in 196 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:48] [INFO ] Deduced a trap composed of 177 places in 196 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:48] [INFO ] Deduced a trap composed of 175 places in 243 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:49] [INFO ] Deduced a trap composed of 177 places in 258 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:49] [INFO ] Deduced a trap composed of 177 places in 255 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:49] [INFO ] Deduced a trap composed of 177 places in 202 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:54] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:54] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:54] [INFO ] Deduced a trap composed of 176 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:55] [INFO ] Deduced a trap composed of 176 places in 176 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/1354 variables, and 116 constraints, problems are : Problem set: 0 solved, 781 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 24/116 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:59] [INFO ] Deduced a trap composed of 256 places in 227 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:10:59] [INFO ] Deduced a trap composed of 256 places in 196 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:00] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:02] [INFO ] Deduced a trap composed of 176 places in 253 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:02] [INFO ] Deduced a trap composed of 178 places in 246 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:02] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:03] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:03] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:03] [INFO ] Deduced a trap composed of 178 places in 238 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:03] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:04] [INFO ] Deduced a trap composed of 178 places in 232 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:04] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:04] [INFO ] Deduced a trap composed of 178 places in 237 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:04] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:05] [INFO ] Deduced a trap composed of 178 places in 242 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:05] [INFO ] Deduced a trap composed of 178 places in 247 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:05] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:05] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:06] [INFO ] Deduced a trap composed of 183 places in 277 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:06] [INFO ] Deduced a trap composed of 178 places in 259 ms of which 81 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:08] [INFO ] Deduced a trap composed of 256 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:11] [INFO ] Deduced a trap composed of 178 places in 250 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:11] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:11] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:12] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:12] [INFO ] Deduced a trap composed of 178 places in 247 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:12] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:12] [INFO ] Deduced a trap composed of 178 places in 248 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:13] [INFO ] Deduced a trap composed of 178 places in 253 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:13] [INFO ] Deduced a trap composed of 178 places in 252 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:14] [INFO ] Deduced a trap composed of 178 places in 246 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:14] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:14] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:14] [INFO ] Deduced a trap composed of 178 places in 240 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:15] [INFO ] Deduced a trap composed of 178 places in 233 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:15] [INFO ] Deduced a trap composed of 178 places in 241 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:15] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:15] [INFO ] Deduced a trap composed of 178 places in 232 ms of which 56 ms to minimize.
SMT process timed out in 40593ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 40595ms
[2025-06-04 15:11:15] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2025-06-04 15:11:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:11:17] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2025-06-04 15:11:17] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2025-06-04 15:11:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:11:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:11:20] [INFO ] Implicit Places using invariants and state equation in 3657 ms returned []
Implicit Place search using SMT with State Equation took 4975 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:11:20] [INFO ] Redundant transitions in 11 ms returned []
Running 781 sub problems to find dead transitions.
[2025-06-04 15:11:20] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2025-06-04 15:11:20] [INFO ] Invariant cache hit.
[2025-06-04 15:11: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/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:30] [INFO ] Deduced a trap composed of 176 places in 237 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:31] [INFO ] Deduced a trap composed of 176 places in 262 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:31] [INFO ] Deduced a trap composed of 176 places in 177 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:31] [INFO ] Deduced a trap composed of 176 places in 178 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:40] [INFO ] Deduced a trap composed of 176 places in 171 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:40] [INFO ] Deduced a trap composed of 178 places in 272 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:41] [INFO ] Deduced a trap composed of 178 places in 221 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:41] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:41] [INFO ] Deduced a trap composed of 178 places in 233 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:41] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:42] [INFO ] Deduced a trap composed of 178 places in 251 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:42] [INFO ] Deduced a trap composed of 176 places in 215 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:42] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:42] [INFO ] Deduced a trap composed of 178 places in 221 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:43] [INFO ] Deduced a trap composed of 178 places in 221 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:43] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:43] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:43] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:43] [INFO ] Deduced a trap composed of 176 places in 259 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:44] [INFO ] Deduced a trap composed of 178 places in 267 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:44] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:44] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:45] [INFO ] Deduced a trap composed of 178 places in 271 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:45] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/1354 variables, and 116 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 24/116 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:11:57] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:00] [INFO ] Deduced a trap composed of 178 places in 250 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:00] [INFO ] Deduced a trap composed of 178 places in 257 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:00] [INFO ] Deduced a trap composed of 176 places in 294 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:00] [INFO ] Deduced a trap composed of 176 places in 301 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:01] [INFO ] Deduced a trap composed of 178 places in 246 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:01] [INFO ] Deduced a trap composed of 178 places in 249 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:01] [INFO ] Deduced a trap composed of 178 places in 273 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:02] [INFO ] Deduced a trap composed of 178 places in 257 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:02] [INFO ] Deduced a trap composed of 178 places in 254 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:02] [INFO ] Deduced a trap composed of 178 places in 265 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:02] [INFO ] Deduced a trap composed of 178 places in 247 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:03] [INFO ] Deduced a trap composed of 178 places in 271 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:03] [INFO ] Deduced a trap composed of 178 places in 263 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:03] [INFO ] Deduced a trap composed of 175 places in 293 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:04] [INFO ] Deduced a trap composed of 178 places in 240 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:04] [INFO ] Deduced a trap composed of 178 places in 252 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:04] [INFO ] Deduced a trap composed of 178 places in 252 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:05] [INFO ] Deduced a trap composed of 178 places in 260 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:05] [INFO ] Deduced a trap composed of 178 places in 265 ms of which 57 ms to minimize.
Problem TDEAD783 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/136 constraints. Problems are: Problem set: 1 solved, 780 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:19] [INFO ] Deduced a trap composed of 216 places in 249 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:19] [INFO ] Deduced a trap composed of 256 places in 251 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:12:20] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/1354 variables, and 139 constraints, problems are : Problem set: 1 solved, 780 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/781 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60551ms problems are : Problem set: 1 solved, 780 unsolved
Search for dead transitions found 1 dead transitions in 60552ms
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 : 571/573 places, 786/789 transitions.
Graph (complete) has 2936 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 570 /571 variables (removed 1) and now considering 786/786 (removed 0) transitions.
[2025-06-04 15:12:21] [INFO ] Flow matrix only has 782 transitions (discarded 4 similar events)
// Phase 1: matrix 782 rows 570 cols
[2025-06-04 15:12:21] [INFO ] Computed 96 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:12:22] [INFO ] Implicit Places using invariants in 762 ms returned []
[2025-06-04 15:12:22] [INFO ] Flow matrix only has 782 transitions (discarded 4 similar events)
[2025-06-04 15:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:12:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:12:25] [INFO ] Implicit Places using invariants and state equation in 3519 ms returned []
Implicit Place search using SMT with State Equation took 4329 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/573 places, 786/789 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110530 ms. Remains : 570/573 places, 786/789 transitions.
Built C files in :
/tmp/ltsmin7687562825731235474
[2025-06-04 15:12:25] [INFO ] Computing symmetric may disable matrix : 786 transitions.
[2025-06-04 15:12:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:12:25] [INFO ] Computing symmetric may enable matrix : 786 transitions.
[2025-06-04 15:12:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:12:25] [INFO ] Computing Do-Not-Accords matrix : 786 transitions.
[2025-06-04 15:12:25] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:12:25] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7687562825731235474
Running compilation step : cd /tmp/ltsmin7687562825731235474;'/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 2295 ms.
Running link step : cd /tmp/ltsmin7687562825731235474;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7687562825731235474;'/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/stateBased3728885782364109606.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 15:12:40] [INFO ] Flatten gal took : 27 ms
[2025-06-04 15:12:40] [INFO ] Flatten gal took : 26 ms
[2025-06-04 15:12:40] [INFO ] Time to serialize gal into /tmp/LTL10356303079443004225.gal : 5 ms
[2025-06-04 15:12:40] [INFO ] Time to serialize properties into /tmp/LTL16329821948753237067.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/LTL10356303079443004225.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14573214307351694833.hoa' '-atoms' '/tmp/LTL16329821948753237067.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...320
Loading property file /tmp/LTL16329821948753237067.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14573214307351694833.hoa
Detected timeout of ITS tools.
[2025-06-04 15:12:56] [INFO ] Flatten gal took : 29 ms
[2025-06-04 15:12:56] [INFO ] Flatten gal took : 29 ms
[2025-06-04 15:12:56] [INFO ] Time to serialize gal into /tmp/LTL1941885879105821717.gal : 5 ms
[2025-06-04 15:12:56] [INFO ] Time to serialize properties into /tmp/LTL3104222702139664280.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/LTL1941885879105821717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3104222702139664280.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 : !((X(G(("(((((((FetchJobE_0+FetchJobE_1)+(FetchJobE_2+FetchJobE_3))+((FetchJobE_4+FetchJobE_5)+(FetchJobE_6+FetchJobE_7)))+(((FetchJob...1430
Formula 0 simplified : XF(!"(((((((FetchJobE_0+FetchJobE_1)+(FetchJobE_2+FetchJobE_3))+((FetchJobE_4+FetchJobE_5)+(FetchJobE_6+FetchJobE_7)))+(((FetchJobE_...1337
Detected timeout of ITS tools.
[2025-06-04 15:13:11] [INFO ] Flatten gal took : 28 ms
[2025-06-04 15:13:11] [INFO ] Applying decomposition
[2025-06-04 15:13:11] [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/graph6259964575797991907.txt' '-o' '/tmp/graph6259964575797991907.bin' '-w' '/tmp/graph6259964575797991907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6259964575797991907.bin' '-l' '-1' '-v' '-w' '/tmp/graph6259964575797991907.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:13:11] [INFO ] Decomposing Gal with order
[2025-06-04 15:13:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:13:11] [INFO ] Removed a total of 854 redundant transitions.
[2025-06-04 15:13:11] [INFO ] Flatten gal took : 141 ms
[2025-06-04 15:13:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 36 ms.
[2025-06-04 15:13:11] [INFO ] Time to serialize gal into /tmp/LTL8052052939063551833.gal : 6 ms
[2025-06-04 15:13:11] [INFO ] Time to serialize properties into /tmp/LTL10909037860313546402.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/LTL8052052939063551833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10909037860313546402.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((((gu1.FetchJobE_0+gu1.FetchJobE_1)+(gu1.FetchJobE_2+gu1.FetchJobE_3))+((gu1.FetchJobE_4+gu1.FetchJobE_5)+(gu1.FetchJobE_...1870
Formula 0 simplified : XF(!"(((((((gu1.FetchJobE_0+gu1.FetchJobE_1)+(gu1.FetchJobE_2+gu1.FetchJobE_3))+((gu1.FetchJobE_4+gu1.FetchJobE_5)+(gu1.FetchJobE_6+...1725
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-01 finished in 403512 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(G((p0||G((p1||X(X(p2)))))))))'
[2025-06-04 15:13:26] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9955841347236939779
[2025-06-04 15:13:26] [INFO ] Computing symmetric may disable matrix : 857 transitions.
[2025-06-04 15:13:26] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:13:26] [INFO ] Applying decomposition
[2025-06-04 15:13:26] [INFO ] Computing symmetric may enable matrix : 857 transitions.
[2025-06-04 15:13:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:13:26] [INFO ] Flatten gal took : 33 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/graph17440963388232682941.txt' '-o' '/tmp/graph17440963388232682941.bin' '-w' '/tmp/graph17440963388232682941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17440963388232682941.bin' '-l' '-1' '-v' '-w' '/tmp/graph17440963388232682941.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:13:27] [INFO ] Decomposing Gal with order
[2025-06-04 15:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:13:27] [INFO ] Computing Do-Not-Accords matrix : 857 transitions.
[2025-06-04 15:13:27] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 15:13:27] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9955841347236939779
Running compilation step : cd /tmp/ltsmin9955841347236939779;'/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-04 15:13:27] [INFO ] Removed a total of 1237 redundant transitions.
[2025-06-04 15:13:27] [INFO ] Flatten gal took : 158 ms
[2025-06-04 15:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 31 ms.
[2025-06-04 15:13:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality13075430053126104407.gal : 23 ms
[2025-06-04 15:13:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality6064611674068235964.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/LTLCardinality13075430053126104407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6064611674068235964.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...298
Read 2 LTL properties
Checking formula 0 : !((X(G(("(((((((gu1.FetchJobE_0+gu1.FetchJobE_1)+(gu1.FetchJobE_2+gu1.FetchJobE_3))+((gu1.FetchJobE_4+gu1.FetchJobE_5)+(gu1.FetchJobE_...1838
Formula 0 simplified : XF(!"(((((((gu1.FetchJobE_0+gu1.FetchJobE_1)+(gu1.FetchJobE_2+gu1.FetchJobE_3))+((gu1.FetchJobE_4+gu1.FetchJobE_5)+(gu1.FetchJobE_6+...1709
Compilation finished in 2853 ms.
Running link step : cd /tmp/ltsmin9955841347236939779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9955841347236939779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(([]((<>((LTLAPp1==true))||X(X((LTLAPp2==true))))) U ((LTLAPp0==true)&&[]((<>((LTLAPp1==true))||X(X((LTLAPp2==true)))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.045: LTL layer: formula: X([](((LTLAPp0==true)||X(([]((<>((LTLAPp1==true))||X(X((LTLAPp2==true))))) U ((LTLAPp0==true)&&[]((<>((LTLAPp1==true))||X(X((LTLAPp2==true)))))))))))
pins2lts-mc-linux64( 7/ 8), 0.045: "X([](((LTLAPp0==true)||X(([]((<>((LTLAPp1==true))||X(X((LTLAPp2==true))))) U ((LTLAPp0==true)&&[]((<>((LTLAPp1==true))||X(X((LTLAPp2==true)))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.046: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.091: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.106: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.110: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.122: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.122: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.123: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.293: DFS-FIFO for weak LTL, using special progress label 864
pins2lts-mc-linux64( 0/ 8), 0.293: There are 865 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.293: State length is 630, there are 868 groups
pins2lts-mc-linux64( 0/ 8), 0.293: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.293: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.293: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.293: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.385: ~1 levels ~960 states ~2280 transitions
pins2lts-mc-linux64( 5/ 8), 0.426: ~1 levels ~1920 states ~3240 transitions
pins2lts-mc-linux64( 5/ 8), 0.513: ~1 levels ~3840 states ~5160 transitions
pins2lts-mc-linux64( 5/ 8), 0.722: ~1 levels ~7680 states ~14960 transitions
pins2lts-mc-linux64( 5/ 8), 1.064: ~1 levels ~15360 states ~45008 transitions
pins2lts-mc-linux64( 5/ 8), 1.611: ~1 levels ~30720 states ~96176 transitions
pins2lts-mc-linux64( 5/ 8), 2.649: ~1 levels ~61440 states ~189208 transitions
pins2lts-mc-linux64( 5/ 8), 4.591: ~6 levels ~122880 states ~378752 transitions
pins2lts-mc-linux64( 0/ 8), 8.457: ~1 levels ~245760 states ~798464 transitions
pins2lts-mc-linux64( 0/ 8), 15.076: ~1 levels ~491520 states ~1308256 transitions
pins2lts-mc-linux64( 0/ 8), 27.388: ~1 levels ~983040 states ~1981760 transitions
pins2lts-mc-linux64( 0/ 8), 56.208: ~6 levels ~1966080 states ~4555408 transitions
pins2lts-mc-linux64( 0/ 8), 120.106: ~6 levels ~3932160 states ~9553952 transitions
pins2lts-mc-linux64( 5/ 8), 255.232: ~6 levels ~7864320 states ~26241064 transitions
pins2lts-mc-linux64( 0/ 8), 343.646: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 345.140:
pins2lts-mc-linux64( 0/ 8), 345.140: mean standard work distribution: 43.5% (states) 45.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 345.140:
pins2lts-mc-linux64( 0/ 8), 345.140: Explored 6882294 states 72681357 transitions, fanout: 10.561
pins2lts-mc-linux64( 0/ 8), 345.140: Total exploration time 344.830 sec (343.360 sec minimum, 343.717 sec on average)
pins2lts-mc-linux64( 0/ 8), 345.140: States per second: 19959, Transitions per second: 210774
pins2lts-mc-linux64( 0/ 8), 345.140:
pins2lts-mc-linux64( 0/ 8), 345.140: Progress states detected: 23665937
pins2lts-mc-linux64( 0/ 8), 345.140: Redundant explorations: -71.1131
pins2lts-mc-linux64( 0/ 8), 345.140:
pins2lts-mc-linux64( 0/ 8), 345.140: Queue width: 8B, total height: 25076027, memory: 191.31MB
pins2lts-mc-linux64( 0/ 8), 345.140: Tree memory: 437.8MB, 19.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 345.140: Tree fill ratio (roots/leafs): 17.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 345.140: Stored 912 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 345.140: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 345.140: Est. total memory use: 629.1MB (~1215.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9955841347236939779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(([]((<>((LTLAPp1==true))||X(X((LTLAPp2==true))))) U ((LTLAPp0==true)&&[]((<>((LTLAPp1==true))||X(X((LTLAPp2==true)))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9955841347236939779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(([]((<>((LTLAPp1==true))||X(X((LTLAPp2==true))))) U ((LTLAPp0==true)&&[]((<>((LTLAPp1==true))||X(X((LTLAPp2==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)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J40, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254300571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;