About the Execution of ITS-Tools for PolyORBNT-PT-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?FFFFFFTTFFTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254400651.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is PolyORBNT-PT-S05J40, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254400651
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 337K 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 11K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 236K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 399K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749087827051
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 01:43:48] [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-05 01:43:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 01:43:48] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2025-06-05 01:43:48] [INFO ] Transformed 629 places.
[2025-06-05 01:43:48] [INFO ] Transformed 1590 transitions.
[2025-06-05 01:43:48] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 246 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 64 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-05 01:43:48] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2025-06-05 01:43:48] [INFO ] Computed 102 invariants in 76 ms
[2025-06-05 01:43:48] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1560 variables, and 91 constraints, problems are : Problem set: 0 solved, 929 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/26 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: 0 solved, 929 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1560 variables, and 91 constraints, problems are : Problem set: 0 solved, 929 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/26 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 41283ms problems are : Problem set: 0 solved, 929 unsolved
Search for dead transitions found 0 dead transitions in 41316ms
[2025-06-05 01:44:30] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
[2025-06-05 01:44:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:44:30] [INFO ] Implicit Places using invariants in 821 ms returned []
[2025-06-05 01:44:30] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
[2025-06-05 01:44:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:44:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:44:34] [INFO ] Implicit Places using invariants and state equation in 3878 ms returned []
Implicit Place search using SMT with State Equation took 4710 ms to find 0 implicit places.
Running 929 sub problems to find dead transitions.
[2025-06-05 01:44:34] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
[2025-06-05 01:44:34] [INFO ] Invariant cache hit.
[2025-06-05 01:44:34] [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/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/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 TDEAD105 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/629 variables, 11/102 constraints. Problems are: Problem set: 95 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/1560 variables, and 102 constraints, problems are : Problem set: 95 solved, 834 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 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: 95 solved, 834 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 11/629 variables, 11/102 constraints. Problems are: Problem set: 95 solved, 834 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:45:35] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/1560 variables, and 103 constraints, problems are : Problem set: 95 solved, 834 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/929 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60747ms problems are : Problem set: 95 solved, 834 unsolved
Search for dead transitions found 95 dead transitions in 60751ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 840/935 transitions.
Applied a total of 0 rules in 15 ms. Remains 629 /629 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106907 ms. Remains : 629/629 places, 840/935 transitions.
Support contains 246 out of 629 places after structural reductions.
[2025-06-05 01:45:35] [INFO ] Flatten gal took : 97 ms
[2025-06-05 01:45:35] [INFO ] Flatten gal took : 66 ms
[2025-06-05 01:45:36] [INFO ] Input system was already deterministic with 840 transitions.
RANDOM walk for 40000 steps (2767 resets) in 1419 ms. (28 steps per ms) remains 9/35 properties
BEST_FIRST walk for 40004 steps (584 resets) in 264 ms. (150 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (1024 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (550 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (519 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1212 resets) in 273 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (607 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (635 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (533 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
[2025-06-05 01:45:37] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 629 cols
[2025-06-05 01:45:37] [INFO ] Computed 102 invariants in 27 ms
[2025-06-05 01:45:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 421/557 variables, 74/74 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/74 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 627/1465 variables, and 100 constraints, problems are : Problem set: 8 solved, 0 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 74/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 60 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:45:37] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2025-06-05 01:45:37] [INFO ] Computed 97 invariants in 19 ms
[2025-06-05 01:45:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:46:00] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:46:00] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:46:06] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:46:07] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:46:08] [INFO ] Deduced a trap composed of 97 places in 189 ms of which 40 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:46:10] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:46:14] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:46:14] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 21 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(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 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 8)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 99 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40575ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40577ms
[2025-06-05 01:46:18] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:46:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:46:19] [INFO ] Implicit Places using invariants in 1447 ms returned []
[2025-06-05 01:46:19] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:46:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:46:29] [INFO ] Implicit Places using invariants and state equation in 9586 ms returned []
Implicit Place search using SMT with State Equation took 11035 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:46:29] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:46:29] [INFO ] Invariant cache hit.
[2025-06-05 01:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:01] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:02] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:02] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:03] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:07] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:08] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:09] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:15] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:16] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:16] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:20] [INFO ] Deduced a trap composed of 97 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-05 01:47:21] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:23] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:23] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:29] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:29] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60516ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60519ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112201 ms. Remains : 623/629 places, 839/840 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p0), (NOT p1), p0, p0]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-00
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-00 finished in 112558 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, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 82 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:47:30] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:47:30] [INFO ] Invariant cache hit.
[2025-06-05 01:47:30] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:52] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:53] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:53] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:54] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:58] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:59] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:00] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:07] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:07] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:07] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40554ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40557ms
[2025-06-05 01:48:10] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:48:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:48:12] [INFO ] Implicit Places using invariants in 1415 ms returned []
[2025-06-05 01:48:12] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:48:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:48:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:48:21] [INFO ] Implicit Places using invariants and state equation in 8663 ms returned []
Implicit Place search using SMT with State Equation took 10082 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:48:21] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:48:21] [INFO ] Invariant cache hit.
[2025-06-05 01:48: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, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:53] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:53] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:53] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:55] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:59] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:48:59] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:00] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:07] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:07] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:07] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:11] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:12] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:14] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:14] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:20] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:21] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 14 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(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 1)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60525ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111277 ms. Remains : 623/629 places, 839/840 transitions.
Stuttering acceptance computed with spot in 259 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-PT-S05J40-LTLCardinality-01
Product exploration explored 100000 steps with 6962 reset in 410 ms.
Product exploration explored 100000 steps with 6926 reset in 384 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 p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 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 288 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 (2740 resets) in 328 ms. (121 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1212 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
[2025-06-05 01:49:23] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:49:23] [INFO ] Invariant cache hit.
[2025-06-05 01:49:23] [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) 11/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 278/292 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/586 variables, 74/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/621 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/622 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 835/1457 variables, 622/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1457 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1457 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1458 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1458 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1458 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1458/1458 variables, and 721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 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) 11/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 278/292 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/586 variables, 74/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 621/1458 variables, and 96 constraints, problems are : Problem set: 1 solved, 0 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 75/76 constraints, Generalized P Invariants (flows): 21/21 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 604ms 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 p0)), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 169 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 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, 839/839 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 835
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 794
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 794
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 791
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 791
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 789
Applied a total of 100 rules in 111 ms. Remains 573 /623 variables (removed 50) and now considering 789/839 (removed 50) transitions.
Running 783 sub problems to find dead transitions.
[2025-06-05 01:49:24] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
// Phase 1: matrix 785 rows 573 cols
[2025-06-05 01:49:24] [INFO ] Computed 97 invariants in 10 ms
[2025-06-05 01:49: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/567 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 15/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-05 01:49:38] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:38] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/1358 variables, and 93 constraints, problems are : Problem set: 0 solved, 783 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 2/2 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, 76/76 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
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-05 01:49:53] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:58] [INFO ] Deduced a trap composed of 93 places in 208 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:02] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 783 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 567/1358 variables, and 96 constraints, problems are : Problem set: 0 solved, 783 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/783 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40573ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 40575ms
[2025-06-05 01:50:04] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 01:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:50:06] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2025-06-05 01:50:06] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 01:50:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:50:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:50:15] [INFO ] Implicit Places using invariants and state equation in 9201 ms returned []
Implicit Place search using SMT with State Equation took 10427 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:50:15] [INFO ] Redundant transitions in 42 ms returned []
Running 783 sub problems to find dead transitions.
[2025-06-05 01:50:15] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 01:50:15] [INFO ] Invariant cache hit.
[2025-06-05 01:50:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 15/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-05 01:50:30] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:30] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:30] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:30] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 783 unsolved
SMT process timed out in 30485ms, After SMT, problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 30488ms
Starting structural reductions in SI_LTL mode, iteration 1 : 573/623 places, 789/839 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81656 ms. Remains : 573/623 places, 789/839 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 87 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 479 steps (28 resets) in 12 ms. (36 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 89 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6389 reset in 547 ms.
Product exploration explored 100000 steps with 6458 reset in 555 ms.
Built C files in :
/tmp/ltsmin12016983772388138351
[2025-06-05 01:50:47] [INFO ] Computing symmetric may disable matrix : 789 transitions.
[2025-06-05 01:50:47] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:50:47] [INFO ] Computing symmetric may enable matrix : 789 transitions.
[2025-06-05 01:50:47] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:50:47] [INFO ] Computing Do-Not-Accords matrix : 789 transitions.
[2025-06-05 01:50:47] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:50:47] [INFO ] Built C files in 216ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12016983772388138351
Running compilation step : cd /tmp/ltsmin12016983772388138351;'/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 2446 ms.
Running link step : cd /tmp/ltsmin12016983772388138351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin12016983772388138351;'/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/stateBased3602033552223008115.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 1 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 1 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 67 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-05 01:51:02] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
// Phase 1: matrix 783 rows 571 cols
[2025-06-05 01:51:02] [INFO ] Computed 97 invariants in 13 ms
[2025-06-05 01:51: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/566 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 16/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-05 01:51:11] [INFO ] Deduced a trap composed of 177 places in 232 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:11] [INFO ] Deduced a trap composed of 175 places in 220 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:12] [INFO ] Deduced a trap composed of 177 places in 231 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:12] [INFO ] Deduced a trap composed of 177 places in 323 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:12] [INFO ] Deduced a trap composed of 175 places in 295 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:13] [INFO ] Deduced a trap composed of 177 places in 291 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:13] [INFO ] Deduced a trap composed of 177 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-05 01:51:13] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:13] [INFO ] Deduced a trap composed of 177 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-05 01:51:14] [INFO ] Deduced a trap composed of 175 places in 201 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:14] [INFO ] Deduced a trap composed of 177 places in 225 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:14] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:14] [INFO ] Deduced a trap composed of 177 places in 217 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:15] [INFO ] Deduced a trap composed of 177 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-05 01:51:15] [INFO ] Deduced a trap composed of 177 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-05 01:51:15] [INFO ] Deduced a trap composed of 177 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-05 01:51:16] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:16] [INFO ] Deduced a trap composed of 177 places in 525 ms of which 330 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:17] [INFO ] Deduced a trap composed of 177 places in 207 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:17] [INFO ] Deduced a trap composed of 177 places in 236 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, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:19] [INFO ] Deduced a trap composed of 177 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-05 01:51:19] [INFO ] Deduced a trap composed of 177 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-05 01:51:19] [INFO ] Deduced a trap composed of 177 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-05 01:51:20] [INFO ] Deduced a trap composed of 177 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-05 01:51:20] [INFO ] Deduced a trap composed of 177 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-05 01:51:20] [INFO ] Deduced a trap composed of 177 places in 205 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:20] [INFO ] Deduced a trap composed of 177 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-05 01:51:21] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:21] [INFO ] Deduced a trap composed of 177 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-05 01:51:21] [INFO ] Deduced a trap composed of 177 places in 203 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:21] [INFO ] Deduced a trap composed of 177 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-05 01:51:22] [INFO ] Deduced a trap composed of 177 places in 206 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:22] [INFO ] Deduced a trap composed of 177 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-05 01:51:22] [INFO ] Deduced a trap composed of 177 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-05 01:51:22] [INFO ] Deduced a trap composed of 177 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-05 01:51:23] [INFO ] Deduced a trap composed of 177 places in 210 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:23] [INFO ] Deduced a trap composed of 177 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-05 01:51:23] [INFO ] Deduced a trap composed of 177 places in 269 ms of which 85 ms to minimize.
SMT process timed out in 20877ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 20879ms
[2025-06-05 01:51:23] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2025-06-05 01:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:51:24] [INFO ] Implicit Places using invariants in 1247 ms returned []
[2025-06-05 01:51:24] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2025-06-05 01:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:51:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:51:32] [INFO ] Implicit Places using invariants and state equation in 7405 ms returned []
Implicit Place search using SMT with State Equation took 8656 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:51:32] [INFO ] Redundant transitions in 14 ms returned []
Running 781 sub problems to find dead transitions.
[2025-06-05 01:51:32] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2025-06-05 01:51:32] [INFO ] Invariant cache hit.
[2025-06-05 01:51:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 16/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-05 01:51:40] [INFO ] Deduced a trap composed of 177 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-05 01:51:41] [INFO ] Deduced a trap composed of 177 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-05 01:51:41] [INFO ] Deduced a trap composed of 175 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-05 01:51:41] [INFO ] Deduced a trap composed of 177 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-05 01:51:41] [INFO ] Deduced a trap composed of 177 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-05 01:51:42] [INFO ] Deduced a trap composed of 175 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-05 01:51:42] [INFO ] Deduced a trap composed of 177 places in 233 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:42] [INFO ] Deduced a trap composed of 177 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-05 01:51:42] [INFO ] Deduced a trap composed of 177 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-05 01:51:43] [INFO ] Deduced a trap composed of 177 places in 205 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:43] [INFO ] Deduced a trap composed of 177 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-05 01:51:43] [INFO ] Deduced a trap composed of 177 places in 250 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:43] [INFO ] Deduced a trap composed of 177 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-05 01:51:44] [INFO ] Deduced a trap composed of 177 places in 256 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:44] [INFO ] Deduced a trap composed of 177 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-05 01:51:44] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:44] [INFO ] Deduced a trap composed of 177 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-05 01:51:45] [INFO ] Deduced a trap composed of 177 places in 274 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:45] [INFO ] Deduced a trap composed of 177 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-05 01:51:45] [INFO ] Deduced a trap composed of 177 places in 217 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-05 01:51:47] [INFO ] Deduced a trap composed of 175 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-05 01:51:47] [INFO ] Deduced a trap composed of 177 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-05 01:51:48] [INFO ] Deduced a trap composed of 177 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-05 01:51:48] [INFO ] Deduced a trap composed of 177 places in 234 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:48] [INFO ] Deduced a trap composed of 177 places in 242 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:49] [INFO ] Deduced a trap composed of 177 places in 259 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:49] [INFO ] Deduced a trap composed of 177 places in 259 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:49] [INFO ] Deduced a trap composed of 177 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-05 01:51:49] [INFO ] Deduced a trap composed of 177 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-05 01:51:50] [INFO ] Deduced a trap composed of 177 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-05 01:51:50] [INFO ] Deduced a trap composed of 177 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-05 01:51:50] [INFO ] Deduced a trap composed of 177 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-05 01:51:50] [INFO ] Deduced a trap composed of 178 places in 274 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:51] [INFO ] Deduced a trap composed of 177 places in 299 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:51] [INFO ] Deduced a trap composed of 177 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-05 01:51:52] [INFO ] Deduced a trap composed of 177 places in 226 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:52] [INFO ] Deduced a trap composed of 177 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-05 01:51:52] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:53] [INFO ] Deduced a trap composed of 176 places in 295 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:53] [INFO ] Deduced a trap composed of 177 places in 210 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/132 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 132 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 40/40 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, 76/76 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:08] [INFO ] Deduced a trap composed of 175 places in 234 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:08] [INFO ] Deduced a trap composed of 177 places in 238 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:09] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:09] [INFO ] Deduced a trap composed of 177 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-05 01:52:09] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:09] [INFO ] Deduced a trap composed of 177 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-05 01:52:10] [INFO ] Deduced a trap composed of 177 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-05 01:52:10] [INFO ] Deduced a trap composed of 177 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-05 01:52:10] [INFO ] Deduced a trap composed of 177 places in 232 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:10] [INFO ] Deduced a trap composed of 177 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-05 01:52:11] [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-05 01:52:11] [INFO ] Deduced a trap composed of 181 places in 244 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:11] [INFO ] Deduced a trap composed of 175 places in 309 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:11] [INFO ] Deduced a trap composed of 177 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-05 01:52:16] [INFO ] Deduced a trap composed of 175 places in 4025 ms of which 3827 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:16] [INFO ] Deduced a trap composed of 175 places in 325 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:17] [INFO ] Deduced a trap composed of 175 places in 465 ms of which 270 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:17] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:17] [INFO ] Deduced a trap composed of 177 places in 271 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:17] [INFO ] Deduced a trap composed of 177 places in 270 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/1354 variables, and 152 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/781 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60637ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60639ms
Starting structural reductions in SI_LTL mode, iteration 1 : 571/573 places, 787/789 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90271 ms. Remains : 571/573 places, 787/789 transitions.
Built C files in :
/tmp/ltsmin17233299290980410687
[2025-06-05 01:52:32] [INFO ] Computing symmetric may disable matrix : 787 transitions.
[2025-06-05 01:52:32] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:52:32] [INFO ] Computing symmetric may enable matrix : 787 transitions.
[2025-06-05 01:52:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:52:33] [INFO ] Computing Do-Not-Accords matrix : 787 transitions.
[2025-06-05 01:52:33] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:52:33] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17233299290980410687
Running compilation step : cd /tmp/ltsmin17233299290980410687;'/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 2284 ms.
Running link step : cd /tmp/ltsmin17233299290980410687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17233299290980410687;'/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/stateBased17140665074246785883.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 01:52:48] [INFO ] Flatten gal took : 63 ms
[2025-06-05 01:52:48] [INFO ] Flatten gal took : 41 ms
[2025-06-05 01:52:48] [INFO ] Time to serialize gal into /tmp/LTL12743760332110621826.gal : 9 ms
[2025-06-05 01:52:48] [INFO ] Time to serialize properties into /tmp/LTL647067172159690530.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/LTL12743760332110621826.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10618215899068734869.hoa' '-atoms' '/tmp/LTL647067172159690530.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL647067172159690530.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10618215899068734869.hoa
Detected timeout of ITS tools.
[2025-06-05 01:53:03] [INFO ] Flatten gal took : 38 ms
[2025-06-05 01:53:03] [INFO ] Flatten gal took : 36 ms
[2025-06-05 01:53:03] [INFO ] Time to serialize gal into /tmp/LTL8991269410189146035.gal : 8 ms
[2025-06-05 01:53:03] [INFO ] Time to serialize properties into /tmp/LTL3815266529064898786.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8991269410189146035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3815266529064898786.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_1_40+FetchJobE_1_23)+(FetchJobE_1_4+FetchJobE_1_19))+((FetchJobE_1_39+FetchJobE_1_5)+(FetchJobE_1_26+FetchJo...1606
Formula 0 simplified : XF(!"(((((((FetchJobE_1_40+FetchJobE_1_23)+(FetchJobE_1_4+FetchJobE_1_19))+((FetchJobE_1_39+FetchJobE_1_5)+(FetchJobE_1_26+FetchJobE...1509
Detected timeout of ITS tools.
[2025-06-05 01:53:18] [INFO ] Flatten gal took : 33 ms
[2025-06-05 01:53:18] [INFO ] Applying decomposition
[2025-06-05 01:53:18] [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/graph5376854217674659180.txt' '-o' '/tmp/graph5376854217674659180.bin' '-w' '/tmp/graph5376854217674659180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5376854217674659180.bin' '-l' '-1' '-v' '-w' '/tmp/graph5376854217674659180.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:53:18] [INFO ] Decomposing Gal with order
[2025-06-05 01:53:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:53:18] [INFO ] Removed a total of 854 redundant transitions.
[2025-06-05 01:53:18] [INFO ] Flatten gal took : 240 ms
[2025-06-05 01:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 33 ms.
[2025-06-05 01:53:19] [INFO ] Time to serialize gal into /tmp/LTL17191304350617521624.gal : 18 ms
[2025-06-05 01:53:19] [INFO ] Time to serialize properties into /tmp/LTL16727212533656528292.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/LTL17191304350617521624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16727212533656528292.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((((gu4.FetchJobE_1_40+gu4.FetchJobE_1_23)+(gu4.FetchJobE_1_4+gu4.FetchJobE_1_19))+((gu4.FetchJobE_1_39+gu4.FetchJobE_1_5)...2046
Formula 0 simplified : XF(!"(((((((gu4.FetchJobE_1_40+gu4.FetchJobE_1_23)+(gu4.FetchJobE_1_4+gu4.FetchJobE_1_19))+((gu4.FetchJobE_1_39+gu4.FetchJobE_1_5)+(...1897
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-01 finished in 363958 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, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 21 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:53:34] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2025-06-05 01:53:34] [INFO ] Computed 97 invariants in 16 ms
[2025-06-05 01:53:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:56] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:56] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:56] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:56] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:58] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:02] [INFO ] Deduced a trap composed of 97 places in 185 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:04] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:05] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:08] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:08] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:08] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40598ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40600ms
[2025-06-05 01:54:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:54:16] [INFO ] Implicit Places using invariants in 1344 ms returned []
[2025-06-05 01:54:16] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:54:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:54:25] [INFO ] Implicit Places using invariants and state equation in 8929 ms returned []
Implicit Place search using SMT with State Equation took 10281 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:54:25] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:54:25] [INFO ] Invariant cache hit.
[2025-06-05 01:54:25] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 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) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:57] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:57] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:57] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:00] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:00] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:03] [INFO ] Deduced a trap composed of 98 places in 169 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:03] [INFO ] Deduced a trap composed of 97 places in 173 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:04] [INFO ] Deduced a trap composed of 98 places in 176 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:04] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:04] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:05] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:06] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:16] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 833 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/1458 variables, and 104 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60572ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60576ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111484 ms. Remains : 623/629 places, 839/840 transitions.
Stuttering acceptance computed with spot in 246 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-PT-S05J40-LTLCardinality-03
Product exploration explored 100000 steps with 12020 reset in 278 ms.
Product exploration explored 100000 steps with 12048 reset in 300 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 75 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 248 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
RANDOM walk for 1167 steps (79 resets) in 13 ms. (83 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 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 238 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 249 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, 839/839 transitions.
Applied a total of 0 rules in 13 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:55:27] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:55:27] [INFO ] Invariant cache hit.
[2025-06-05 01:55: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/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:50] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:50] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:50] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:53] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:53] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:56] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:56] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:56] [INFO ] Deduced a trap composed of 98 places in 172 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:56] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:56] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:58] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:55:59] [INFO ] Deduced a trap composed of 97 places in 179 ms of which 39 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 103 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40646ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40647ms
[2025-06-05 01:56:08] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:56:09] [INFO ] Implicit Places using invariants in 1341 ms returned []
[2025-06-05 01:56:09] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:56:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:56:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:56:18] [INFO ] Implicit Places using invariants and state equation in 9029 ms returned []
Implicit Place search using SMT with State Equation took 10372 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:56:18] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:56:18] [INFO ] Invariant cache hit.
[2025-06-05 01:56: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/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 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) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:51] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:51] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:51] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:54] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:54] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:57] [INFO ] Deduced a trap composed of 98 places in 172 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:57] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:57] [INFO ] Deduced a trap composed of 98 places in 172 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:57] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:57] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:56:58] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:00] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:09] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 104 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60544ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60548ms
Finished structural reductions in LTL mode , in 1 iterations and 111586 ms. Remains : 623/623 places, 839/839 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 68 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 216 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
RANDOM walk for 1059 steps (74 resets) in 11 ms. (88 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 133 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 236 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Product exploration explored 100000 steps with 12077 reset in 270 ms.
Product exploration explored 100000 steps with 11994 reset in 285 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 235 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, 839/839 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 839
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 840
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 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 622 transition count 839
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 622 transition count 839
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 94 place count 622 transition count 839
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 138 place count 578 transition count 795
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 795
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 182 rules in 136 ms. Remains 578 /623 variables (removed 45) and now considering 795/839 (removed 44) transitions.
Running 789 sub problems to find dead transitions.
[2025-06-05 01:57:21] [INFO ] Flow matrix only has 791 transitions (discarded 4 similar events)
// Phase 1: matrix 791 rows 578 cols
[2025-06-05 01:57:21] [INFO ] Computed 97 invariants in 10 ms
[2025-06-05 01:57:21] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:30] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:30] [INFO ] Deduced a trap composed of 138 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-05 01:57:30] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:30] [INFO ] Deduced a trap composed of 134 places in 199 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:31] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:31] [INFO ] Deduced a trap composed of 138 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-05 01:57:31] [INFO ] Deduced a trap composed of 138 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-05 01:57:31] [INFO ] Deduced a trap composed of 137 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-05 01:57:32] [INFO ] Deduced a trap composed of 138 places in 236 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:32] [INFO ] Deduced a trap composed of 137 places in 255 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:32] [INFO ] Deduced a trap composed of 137 places in 244 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:32] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:33] [INFO ] Deduced a trap composed of 134 places in 313 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:33] [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-05 01:57:34] [INFO ] Deduced a trap composed of 137 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-05 01:57:34] [INFO ] Deduced a trap composed of 137 places in 254 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:34] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:34] [INFO ] Deduced a trap composed of 137 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-05 01:57:35] [INFO ] Deduced a trap composed of 134 places in 198 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:35] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 15 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD737 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/112 constraints. Problems are: Problem set: 2 solved, 787 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:37] [INFO ] Deduced a trap composed of 134 places in 256 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:37] [INFO ] Deduced a trap composed of 137 places in 255 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:37] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:38] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:38] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:38] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 14 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:51] [INFO ] Deduced a trap composed of 247 places in 12201 ms of which 12002 ms to minimize.
SMT process timed out in 29751ms, After SMT, problems are : Problem set: 3 solved, 786 unsolved
Search for dead transitions found 3 dead transitions in 29753ms
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-05 01:57:51] [INFO ] Redundant transitions in 8 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 578/623 places, 792/839 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.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Deduced a syphon composed of 45 places in 0 ms
Applied a total of 1 rules in 33 ms. Remains 576 /578 variables (removed 2) and now considering 792/792 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 576/623 places, 792/839 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29938 ms. Remains : 576/623 places, 792/839 transitions.
Built C files in :
/tmp/ltsmin14206316471941307444
[2025-06-05 01:57:51] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14206316471941307444
Running compilation step : cd /tmp/ltsmin14206316471941307444;'/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 1443 ms.
Running link step : cd /tmp/ltsmin14206316471941307444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14206316471941307444;'/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/stateBased12857377406545131821.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, 839/839 transitions.
Applied a total of 0 rules in 19 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:58:06] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2025-06-05 01:58:06] [INFO ] Computed 97 invariants in 17 ms
[2025-06-05 01:58:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:28] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:28] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:29] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:29] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:30] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:35] [INFO ] Deduced a trap composed of 97 places in 205 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:36] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:37] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:40] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:40] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:41] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40640ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40642ms
[2025-06-05 01:58:47] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:58:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:58:48] [INFO ] Implicit Places using invariants in 1343 ms returned []
[2025-06-05 01:58:48] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:58:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:58:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 01:58:57] [INFO ] Implicit Places using invariants and state equation in 8973 ms returned []
Implicit Place search using SMT with State Equation took 10320 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 01:58:57] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 01:58:57] [INFO ] Invariant cache hit.
[2025-06-05 01:58:57] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:29] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:30] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:30] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:33] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:33] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:36] [INFO ] Deduced a trap composed of 98 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:36] [INFO ] Deduced a trap composed of 97 places in 179 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:36] [INFO ] Deduced a trap composed of 98 places in 184 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:36] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:36] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:37] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:39] [INFO ] Deduced a trap composed of 97 places in 189 ms of which 39 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:49] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 104 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60564ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in LTL mode , in 1 iterations and 111555 ms. Remains : 623/623 places, 839/839 transitions.
Built C files in :
/tmp/ltsmin15982156547621863843
[2025-06-05 01:59:57] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15982156547621863843
Running compilation step : cd /tmp/ltsmin15982156547621863843;'/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 1656 ms.
Running link step : cd /tmp/ltsmin15982156547621863843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15982156547621863843;'/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/stateBased1027032697434587570.hoa' '--buchi-type=spotba'
LTSmin run took 7410 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-03 finished in 392821 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, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 30 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:00:07] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2025-06-05 02:00:07] [INFO ] Computed 97 invariants in 18 ms
[2025-06-05 02:00:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:29] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:29] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:36] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:36] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:37] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 39 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:39] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:43] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:43] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 99 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40585ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40587ms
[2025-06-05 02:00:47] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:00:49] [INFO ] Implicit Places using invariants in 1509 ms returned []
[2025-06-05 02:00:49] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:00:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:00:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:01:00] [INFO ] Implicit Places using invariants and state equation in 11096 ms returned []
Implicit Place search using SMT with State Equation took 12612 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:01:00] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:01:00] [INFO ] Invariant cache hit.
[2025-06-05 02:01: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/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:32] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:33] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:33] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:34] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:38] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:39] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:40] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:47] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:47] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:47] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:51] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:52] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:54] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:01:54] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:00] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:00] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60575ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113813 ms. Remains : 623/629 places, 839/840 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-05 finished in 113964 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, 840/840 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 794
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 794
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 749
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 749
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 532 transition count 748
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 532 transition count 748
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 2 with 4 rules applied. Total rules applied 188 place count 530 transition count 746
Applied a total of 188 rules in 71 ms. Remains 530 /629 variables (removed 99) and now considering 746/840 (removed 94) transitions.
Running 740 sub problems to find dead transitions.
[2025-06-05 02:02:01] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2025-06-05 02:02:01] [INFO ] Computed 97 invariants in 9 ms
[2025-06-05 02:02:01] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:08] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:08] [INFO ] Deduced a trap composed of 135 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:08] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:09] [INFO ] Deduced a trap composed of 134 places in 228 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:09] [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-05 02:02:09] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:09] [INFO ] Deduced a trap composed of 136 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-05 02:02:10] [INFO ] Deduced a trap composed of 136 places in 230 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:10] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:10] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:10] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:11] [INFO ] Deduced a trap composed of 136 places in 263 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:11] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:11] [INFO ] Deduced a trap composed of 136 places in 272 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:11] [INFO ] Deduced a trap composed of 136 places in 312 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:12] [INFO ] Deduced a trap composed of 136 places in 224 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:12] [INFO ] Deduced a trap composed of 136 places in 218 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:12] [INFO ] Deduced a trap composed of 134 places in 287 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:13] [INFO ] Deduced a trap composed of 136 places in 1264 ms of which 1090 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:14] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:15] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:15] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:16] [INFO ] Deduced a trap composed of 134 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:17] [INFO ] Deduced a trap composed of 136 places in 210 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:17] [INFO ] Deduced a trap composed of 136 places in 477 ms of which 300 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:17] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:18] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:19] [INFO ] Deduced a trap composed of 134 places in 776 ms of which 607 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:19] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:20] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:20] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:20] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:20] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:21] [INFO ] Deduced a trap composed of 136 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-05 02:02:21] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:21] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/1272 variables, and 128 constraints, problems are : Problem set: 0 solved, 740 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 36/128 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:26] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:45] [INFO ] Deduced a trap composed of 238 places in 12205 ms of which 12006 ms to minimize.
SMT process timed out in 44135ms, After SMT, problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 44137ms
[2025-06-05 02:02:45] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2025-06-05 02:02:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:02:46] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2025-06-05 02:02:46] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2025-06-05 02:02:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:02:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:02:52] [INFO ] Implicit Places using invariants and state equation in 6580 ms returned []
Implicit Place search using SMT with State Equation took 7612 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:02:52] [INFO ] Redundant transitions in 7 ms returned []
Running 740 sub problems to find dead transitions.
[2025-06-05 02:02:52] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2025-06-05 02:02:52] [INFO ] Invariant cache hit.
[2025-06-05 02:02:52] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:00] [INFO ] Deduced a trap composed of 136 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-05 02:03:00] [INFO ] Deduced a trap composed of 134 places in 218 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:00] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:01] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:01] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:01] [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-05 02:03:01] [INFO ] Deduced a trap composed of 134 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-05 02:03:01] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:02] [INFO ] Deduced a trap composed of 136 places in 232 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:02] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:02] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:04] [INFO ] Deduced a trap composed of 136 places in 1349 ms of which 1176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:04] [INFO ] Deduced a trap composed of 136 places in 289 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:04] [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-05 02:03:04] [INFO ] Deduced a trap composed of 136 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-05 02:03:04] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:05] [INFO ] Deduced a trap composed of 136 places in 229 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:05] [INFO ] Deduced a trap composed of 136 places in 230 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:05] [INFO ] Deduced a trap composed of 136 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-05 02:03:06] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:07] [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-05 02:03:07] [INFO ] Deduced a trap composed of 136 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-05 02:03:07] [INFO ] Deduced a trap composed of 135 places in 232 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:08] [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-05 02:03:08] [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-05 02:03:08] [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-05 02:03:08] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:09] [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-05 02:03:09] [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-05 02:03:09] [INFO ] Deduced a trap composed of 136 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-05 02:03:09] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:10] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:10] [INFO ] Deduced a trap composed of 136 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-05 02:03:10] [INFO ] Deduced a trap composed of 136 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-05 02:03:10] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:10] [INFO ] Deduced a trap composed of 136 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-05 02:03:11] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:11] [INFO ] Deduced a trap composed of 136 places in 239 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:11] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:11] [INFO ] Deduced a trap composed of 136 places in 231 ms of which 60 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:22] [INFO ] Deduced a trap composed of 136 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-05 02:03:22] [INFO ] Deduced a trap composed of 136 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-05 02:03:23] [INFO ] Deduced a trap composed of 136 places in 226 ms of which 56 ms to minimize.
SMT process timed out in 30714ms, After SMT, problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 30715ms
Starting structural reductions in SI_LTL mode, iteration 1 : 530/629 places, 746/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82558 ms. Remains : 530/629 places, 746/840 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-07
Stuttering criterion allowed to conclude after 50 steps with 1 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-07 finished in 82662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (G(p1) U p0)))'
Support contains 3 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 32 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:03:23] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2025-06-05 02:03:23] [INFO ] Computed 97 invariants in 18 ms
[2025-06-05 02:03: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, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:46] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:46] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:52] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:53] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:54] [INFO ] Deduced a trap composed of 97 places in 193 ms of which 40 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:56] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:00] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:00] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 99 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40598ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40599ms
[2025-06-05 02:04:04] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:04:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:04:05] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2025-06-05 02:04:05] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:04:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:04:16] [INFO ] Implicit Places using invariants and state equation in 10308 ms returned []
Implicit Place search using SMT with State Equation took 11668 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:04:16] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:04:16] [INFO ] Invariant cache hit.
[2025-06-05 02:04:16] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:48] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:48] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:48] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:50] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:54] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:55] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:56] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:03] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:03] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:03] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:07] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:08] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:10] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:10] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 105 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60562ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112867 ms. Remains : 623/629 places, 839/840 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-10
Stuttering criterion allowed to conclude after 1155 steps with 84 reset in 9 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-10 finished in 113165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 28 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:05:16] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:05:16] [INFO ] Invariant cache hit.
[2025-06-05 02:05:16] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:39] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:39] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:39] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:40] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:45] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:45] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:46] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:53] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:53] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:05:53] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40589ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40590ms
[2025-06-05 02:05:57] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:05:59] [INFO ] Implicit Places using invariants in 1533 ms returned []
[2025-06-05 02:05:59] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:05:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:06:09] [INFO ] Implicit Places using invariants and state equation in 10354 ms returned []
Implicit Place search using SMT with State Equation took 11890 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:06:09] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:06:09] [INFO ] Invariant cache hit.
[2025-06-05 02:06: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, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:41] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:42] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:42] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:43] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:47] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:48] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:49] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:55] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:55] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:06:56] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:00] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:01] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:02] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:03] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:09] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:09] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60572ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60575ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113088 ms. Remains : 623/629 places, 839/840 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1921 steps with 137 reset in 10 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-11 finished in 113188 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 (X(p2)&&p1)))'
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 33 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:07:10] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:07:10] [INFO ] Invariant cache hit.
[2025-06-05 02:07: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/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:32] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:32] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:32] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:34] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:38] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:39] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:40] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:46] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:46] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:07:47] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40585ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40587ms
[2025-06-05 02:07:50] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:07:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:07:52] [INFO ] Implicit Places using invariants in 1454 ms returned []
[2025-06-05 02:07:52] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:07:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:07:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:08:02] [INFO ] Implicit Places using invariants and state equation in 10124 ms returned []
Implicit Place search using SMT with State Equation took 11583 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:08:02] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:08:02] [INFO ] Invariant cache hit.
[2025-06-05 02:08:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:34] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:34] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:35] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:36] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:40] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:41] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:42] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:48] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:49] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:49] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:53] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:54] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:56] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:08:56] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:02] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:02] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60564ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60567ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112775 ms. Remains : 623/629 places, 839/840 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 421 ms.
Product exploration explored 100000 steps with 50000 reset in 437 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 p1 p0 p2), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 100 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-13 finished in 113909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 580 transition count 794
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 92 place count 578 transition count 751
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 178 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 534 transition count 750
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 534 transition count 750
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 184 place count 532 transition count 748
Applied a total of 184 rules in 82 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2025-06-05 02:09:04] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2025-06-05 02:09:04] [INFO ] Computed 97 invariants in 11 ms
[2025-06-05 02:09:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:11] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:12] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:12] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:12] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:12] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:12] [INFO ] Deduced a trap composed of 138 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-05 02:09:13] [INFO ] Deduced a trap composed of 135 places in 219 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:13] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:13] [INFO ] Deduced a trap composed of 135 places in 231 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:14] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:14] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:14] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:14] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:14] [INFO ] Deduced a trap composed of 138 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-05 02:09:15] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:15] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:15] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:15] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:16] [INFO ] Deduced a trap composed of 135 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-05 02:09:16] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 58 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:18] [INFO ] Deduced a trap composed of 138 places in 249 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:18] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:18] [INFO ] Deduced a trap composed of 138 places in 220 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:19] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:19] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:19] [INFO ] Deduced a trap composed of 138 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-05 02:09:19] [INFO ] Deduced a trap composed of 138 places in 220 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:20] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:20] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:20] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:20] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:20] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:21] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:21] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:21] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:21] [INFO ] Deduced a trap composed of 138 places in 251 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:23] [INFO ] Deduced a trap composed of 138 places in 2042 ms of which 1866 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:24] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:24] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 131 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:29] [INFO ] Deduced a trap composed of 175 places in 193 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:30] [INFO ] Deduced a trap composed of 175 places in 191 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:30] [INFO ] Deduced a trap composed of 175 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-05 02:09:30] [INFO ] Deduced a trap composed of 175 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-05 02:09:30] [INFO ] Deduced a trap composed of 175 places in 193 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:31] [INFO ] Deduced a trap composed of 175 places in 221 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:31] [INFO ] Deduced a trap composed of 175 places in 267 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:31] [INFO ] Deduced a trap composed of 175 places in 241 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:31] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:32] [INFO ] Deduced a trap composed of 175 places in 219 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:32] [INFO ] Deduced a trap composed of 175 places in 259 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:38] [INFO ] Deduced a trap composed of 135 places in 210 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:38] [INFO ] Deduced a trap composed of 135 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-05 02:09:39] [INFO ] Deduced a trap composed of 138 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-05 02:09:42] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:42] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:43] [INFO ] Deduced a trap composed of 138 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-05 02:09:43] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:43] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:09:44] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1276 variables, and 151 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40603ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 40606ms
[2025-06-05 02:09:44] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2025-06-05 02:09:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:09:45] [INFO ] Implicit Places using invariants in 988 ms returned []
[2025-06-05 02:09:45] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2025-06-05 02:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:09:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:09:53] [INFO ] Implicit Places using invariants and state equation in 7367 ms returned []
Implicit Place search using SMT with State Equation took 8358 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:09:53] [INFO ] Redundant transitions in 10 ms returned []
Running 742 sub problems to find dead transitions.
[2025-06-05 02:09:53] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2025-06-05 02:09:53] [INFO ] Invariant cache hit.
[2025-06-05 02:09:53] [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/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:00] [INFO ] Deduced a trap composed of 142 places in 217 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:00] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:01] [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-05 02:10:01] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:01] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:01] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:02] [INFO ] Deduced a trap composed of 135 places in 217 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:02] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:02] [INFO ] Deduced a trap composed of 135 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:03] [INFO ] Deduced a trap composed of 135 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:03] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:03] [INFO ] Deduced a trap composed of 138 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-05 02:10:03] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:04] [INFO ] Deduced a trap composed of 138 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-05 02:10:04] [INFO ] Deduced a trap composed of 138 places in 232 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:04] [INFO ] Deduced a trap composed of 138 places in 272 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:04] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:05] [INFO ] Deduced a trap composed of 138 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-05 02:10:05] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:05] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:07] [INFO ] Deduced a trap composed of 135 places in 242 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:07] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:07] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:07] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:08] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:08] [INFO ] Deduced a trap composed of 138 places in 410 ms of which 229 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:09] [INFO ] Deduced a trap composed of 138 places in 302 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:09] [INFO ] Deduced a trap composed of 138 places in 236 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:10] [INFO ] Deduced a trap composed of 138 places in 1278 ms of which 1097 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:10] [INFO ] Deduced a trap composed of 138 places in 246 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:11] [INFO ] Deduced a trap composed of 138 places in 255 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:11] [INFO ] Deduced a trap composed of 138 places in 241 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:11] [INFO ] Deduced a trap composed of 139 places in 244 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:11] [INFO ] Deduced a trap composed of 138 places in 337 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:12] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:13] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:13] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:13] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:13] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:13] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:29] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:29] [INFO ] Deduced a trap composed of 140 places in 223 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:30] [INFO ] Deduced a trap composed of 142 places in 228 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:30] [INFO ] Deduced a trap composed of 140 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-05 02:10:31] [INFO ] Deduced a trap composed of 140 places in 263 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:31] [INFO ] Deduced a trap composed of 140 places in 218 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:31] [INFO ] Deduced a trap composed of 141 places in 270 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:31] [INFO ] Deduced a trap composed of 141 places in 244 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:33] [INFO ] Deduced a trap composed of 140 places in 258 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:33] [INFO ] Deduced a trap composed of 140 places in 271 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:33] [INFO ] Deduced a trap composed of 140 places in 263 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:33] [INFO ] Deduced a trap composed of 140 places in 249 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:34] [INFO ] Deduced a trap composed of 140 places in 228 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:35] [INFO ] Deduced a trap composed of 142 places in 248 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:35] [INFO ] Deduced a trap composed of 140 places in 251 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:36] [INFO ] Deduced a trap composed of 140 places in 220 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:36] [INFO ] Deduced a trap composed of 142 places in 254 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:37] [INFO ] Deduced a trap composed of 140 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-05 02:10:38] [INFO ] Deduced a trap composed of 142 places in 251 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:38] [INFO ] Deduced a trap composed of 140 places in 216 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:43] [INFO ] Deduced a trap composed of 142 places in 276 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:44] [INFO ] Deduced a trap composed of 142 places in 254 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:44] [INFO ] Deduced a trap composed of 140 places in 253 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:44] [INFO ] Deduced a trap composed of 140 places in 252 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:45] [INFO ] Deduced a trap composed of 141 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-05 02:10:46] [INFO ] Deduced a trap composed of 215 places in 243 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:46] [INFO ] Deduced a trap composed of 142 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-05 02:10:48] [INFO ] Deduced a trap composed of 142 places in 220 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:48] [INFO ] Deduced a trap composed of 93 places in 228 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:49] [INFO ] Deduced a trap composed of 215 places in 254 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:50] [INFO ] Deduced a trap composed of 142 places in 226 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:51] [INFO ] Deduced a trap composed of 139 places in 262 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:51] [INFO ] Deduced a trap composed of 143 places in 265 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:52] [INFO ] Deduced a trap composed of 139 places in 234 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:10:53] [INFO ] Deduced a trap composed of 140 places in 255 ms of which 71 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1276 variables, and 167 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60564ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Starting structural reductions in SI_LTL mode, iteration 1 : 532/629 places, 748/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109630 ms. Remains : 532/629 places, 748/840 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-14
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-14 finished in 109751 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)))||((p0||G(p1))&&F(p2))))))'
Support contains 4 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 27 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:10:53] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2025-06-05 02:10:53] [INFO ] Computed 97 invariants in 17 ms
[2025-06-05 02:10:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:20] [INFO ] Deduced a trap composed of 98 places in 192 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:22] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:23] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:23] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:24] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:24] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:25] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:25] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:26] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:28] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:28] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:31] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:11:31] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 104 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40697ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40699ms
[2025-06-05 02:11:34] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:11:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:11:35] [INFO ] Implicit Places using invariants in 1392 ms returned []
[2025-06-05 02:11:35] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:11:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:11:44] [INFO ] Implicit Places using invariants and state equation in 9020 ms returned []
Implicit Place search using SMT with State Equation took 10424 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2025-06-05 02:11:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2025-06-05 02:11:44] [INFO ] Invariant cache hit.
[2025-06-05 02:11:44] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.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 1.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 1.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 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 9.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.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 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.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 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 timeout
0.0)
(s216 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:16] [INFO ] Deduced a trap composed of 97 places in 214 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:17] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:17] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:21] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:25] [INFO ] Deduced a trap composed of 98 places in 170 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:25] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:25] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:25] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:26] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:26] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:27] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:29] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:12:37] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 104 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60615ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60616ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111771 ms. Remains : 623/629 places, 839/840 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 15 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-15 finished in 112116 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-PT-S05J40-LTLCardinality-01
Stuttering acceptance computed with spot in 327 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, 840/840 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 836
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 795
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 795
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 791
Deduced a syphon composed of 4 places in 1 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 791
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 574 transition count 790
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 574 transition count 790
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 789
Applied a total of 102 rules in 65 ms. Remains 573 /629 variables (removed 56) and now considering 789/840 (removed 51) transitions.
Running 783 sub problems to find dead transitions.
[2025-06-05 02:12:46] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
// Phase 1: matrix 785 rows 573 cols
[2025-06-05 02:12:46] [INFO ] Computed 97 invariants in 19 ms
[2025-06-05 02:12:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 15/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-05 02:13:00] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:13:01] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/1358 variables, and 93 constraints, problems are : Problem set: 0 solved, 783 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 2/2 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, 76/76 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (OVERLAPS) 6/573 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/1358 variables, and 99 constraints, problems are : Problem set: 0 solved, 783 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/783 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40645ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 40646ms
[2025-06-05 02:13:27] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 02:13:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:13:28] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2025-06-05 02:13:28] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 02:13:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:13:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:13:38] [INFO ] Implicit Places using invariants and state equation in 10188 ms returned []
Implicit Place search using SMT with State Equation took 11370 ms to find 0 implicit places.
Running 783 sub problems to find dead transitions.
[2025-06-05 02:13:38] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 02:13:38] [INFO ] Invariant cache hit.
[2025-06-05 02:13:38] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 15/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-05 02:13:52] [INFO ] Deduced a trap composed of 93 places in 184 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:13:52] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:13:52] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 783 unsolved
SMT process timed out in 30565ms, After SMT, problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 30567ms
Starting structural reductions in LI_LTL mode, iteration 1 : 573/629 places, 789/840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 82655 ms. Remains : 573/629 places, 789/840 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-01
Product exploration explored 100000 steps with 6036 reset in 559 ms.
Product exploration explored 100000 steps with 5999 reset in 571 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 p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 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 295 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 (2260 resets) in 621 ms. (64 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1376 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
[2025-06-05 02:14:10] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 02:14:10] [INFO ] Invariant cache hit.
[2025-06-05 02:14: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) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 251/262 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/541 variables, 74/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/571 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/572 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 785/1357 variables, 572/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1357 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1357 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1358 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1358 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (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 501 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 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) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 251/262 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/541 variables, 74/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 571/1358 variables, and 96 constraints, problems are : Problem set: 1 solved, 0 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 75/76 constraints, Generalized P Invariants (flows): 21/21 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 654ms 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 p0)), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 185 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 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 47 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-05 02:14:11] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 02:14:11] [INFO ] Invariant cache hit.
[2025-06-05 02:14: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, 76/76 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 15/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-05 02:14:26] [INFO ] Deduced a trap composed of 93 places in 176 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:26] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:26] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/1358 variables, and 94 constraints, problems are : Problem set: 0 solved, 783 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/573 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 3/3 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, 76/76 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (OVERLAPS) 6/573 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:50] [INFO ] Deduced a trap composed of 93 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-05 02:14:50] [INFO ] Deduced a trap composed of 93 places in 255 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:50] [INFO ] Deduced a trap composed of 93 places in 280 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:50] [INFO ] Deduced a trap composed of 177 places in 290 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:51] [INFO ] Deduced a trap composed of 93 places in 250 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:51] [INFO ] Deduced a trap composed of 177 places in 291 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:51] [INFO ] Deduced a trap composed of 93 places in 246 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:52] [INFO ] Deduced a trap composed of 177 places in 295 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:52] [INFO ] Deduced a trap composed of 177 places in 229 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:14:52] [INFO ] Deduced a trap composed of 177 places in 231 ms of which 35 ms to minimize.
SMT process timed out in 40815ms, After SMT, problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 40816ms
[2025-06-05 02:14:52] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 02:14:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:14:53] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2025-06-05 02:14:53] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 02:14:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:14:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:15:04] [INFO ] Implicit Places using invariants and state equation in 10415 ms returned []
Implicit Place search using SMT with State Equation took 11593 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:15:04] [INFO ] Redundant transitions in 9 ms returned []
Running 783 sub problems to find dead transitions.
[2025-06-05 02:15:04] [INFO ] Flow matrix only has 785 transitions (discarded 4 similar events)
[2025-06-05 02:15:04] [INFO ] Invariant cache hit.
[2025-06-05 02:15:04] [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, 76/76 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 15/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-05 02:15:18] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:15:18] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:15:18] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 783 unsolved
SMT process timed out in 30521ms, After SMT, problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 30523ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83000 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 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 634 steps (43 resets) in 13 ms. (45 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 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6456 reset in 548 ms.
Product exploration explored 100000 steps with 6389 reset in 566 ms.
Built C files in :
/tmp/ltsmin9866200127716968567
[2025-06-05 02:15:36] [INFO ] Computing symmetric may disable matrix : 789 transitions.
[2025-06-05 02:15:36] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:15:36] [INFO ] Computing symmetric may enable matrix : 789 transitions.
[2025-06-05 02:15:36] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:15:36] [INFO ] Computing Do-Not-Accords matrix : 789 transitions.
[2025-06-05 02:15:36] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:15:36] [INFO ] Built C files in 213ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9866200127716968567
Running compilation step : cd /tmp/ltsmin9866200127716968567;'/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 2313 ms.
Running link step : cd /tmp/ltsmin9866200127716968567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9866200127716968567;'/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/stateBased15368473627978711837.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 44 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-05 02:15:51] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
// Phase 1: matrix 783 rows 571 cols
[2025-06-05 02:15:51] [INFO ] Computed 97 invariants in 18 ms
[2025-06-05 02:15:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 16/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-05 02:16:00] [INFO ] Deduced a trap composed of 175 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-05 02:16:00] [INFO ] Deduced a trap composed of 177 places in 236 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:00] [INFO ] Deduced a trap composed of 175 places in 227 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:00] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:01] [INFO ] Deduced a trap composed of 175 places in 238 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:01] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:01] [INFO ] Deduced a trap composed of 177 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-05 02:16:01] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:02] [INFO ] Deduced a trap composed of 177 places in 230 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:02] [INFO ] Deduced a trap composed of 177 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-05 02:16:02] [INFO ] Deduced a trap composed of 177 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-05 02:16:02] [INFO ] Deduced a trap composed of 177 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-05 02:16:03] [INFO ] Deduced a trap composed of 177 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-05 02:16:03] [INFO ] Deduced a trap composed of 175 places in 286 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:03] [INFO ] Deduced a trap composed of 177 places in 238 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:03] [INFO ] Deduced a trap composed of 177 places in 236 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:04] [INFO ] Deduced a trap composed of 177 places in 238 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:04] [INFO ] Deduced a trap composed of 177 places in 230 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:04] [INFO ] Deduced a trap composed of 176 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-05 02:16:04] [INFO ] Deduced a trap composed of 175 places in 210 ms of which 31 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-05 02:16:07] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:07] [INFO ] Deduced a trap composed of 177 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-05 02:16:07] [INFO ] Deduced a trap composed of 96 places in 208 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:08] [INFO ] Deduced a trap composed of 177 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-05 02:16:08] [INFO ] Deduced a trap composed of 177 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-05 02:16:09] [INFO ] Deduced a trap composed of 177 places in 217 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:09] [INFO ] Deduced a trap composed of 177 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-05 02:16:09] [INFO ] Deduced a trap composed of 177 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-05 02:16:09] [INFO ] Deduced a trap composed of 177 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-05 02:16:10] [INFO ] Deduced a trap composed of 177 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-05 02:16:10] [INFO ] Deduced a trap composed of 177 places in 236 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:10] [INFO ] Deduced a trap composed of 177 places in 212 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:10] [INFO ] Deduced a trap composed of 177 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-05 02:16:11] [INFO ] Deduced a trap composed of 177 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-05 02:16:11] [INFO ] Deduced a trap composed of 177 places in 206 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:11] [INFO ] Deduced a trap composed of 175 places in 225 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:11] [INFO ] Deduced a trap composed of 175 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-05 02:16:12] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:12] [INFO ] Deduced a trap composed of 177 places in 233 ms of which 33 ms to minimize.
SMT process timed out in 20816ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 20818ms
[2025-06-05 02:16:12] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2025-06-05 02:16:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:16:13] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2025-06-05 02:16:13] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2025-06-05 02:16:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:16:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:16:21] [INFO ] Implicit Places using invariants and state equation in 8197 ms returned []
Implicit Place search using SMT with State Equation took 9380 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:16:21] [INFO ] Redundant transitions in 16 ms returned []
Running 781 sub problems to find dead transitions.
[2025-06-05 02:16:21] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2025-06-05 02:16:21] [INFO ] Invariant cache hit.
[2025-06-05 02:16: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/566 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 16/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-05 02:16:30] [INFO ] Deduced a trap composed of 177 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-05 02:16:30] [INFO ] Deduced a trap composed of 175 places in 248 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:30] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:31] [INFO ] Deduced a trap composed of 177 places in 256 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:31] [INFO ] Deduced a trap composed of 177 places in 260 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:31] [INFO ] Deduced a trap composed of 175 places in 215 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:32] [INFO ] Deduced a trap composed of 177 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-05 02:16:32] [INFO ] Deduced a trap composed of 175 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-05 02:16:32] [INFO ] Deduced a trap composed of 175 places in 210 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:32] [INFO ] Deduced a trap composed of 177 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-05 02:16:33] [INFO ] Deduced a trap composed of 177 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-05 02:16:33] [INFO ] Deduced a trap composed of 177 places in 230 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:33] [INFO ] Deduced a trap composed of 177 places in 241 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:33] [INFO ] Deduced a trap composed of 177 places in 206 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:34] [INFO ] Deduced a trap composed of 177 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-05 02:16:34] [INFO ] Deduced a trap composed of 177 places in 248 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:34] [INFO ] Deduced a trap composed of 177 places in 253 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:34] [INFO ] Deduced a trap composed of 177 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-05 02:16:35] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:35] [INFO ] Deduced a trap composed of 177 places in 263 ms of which 76 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-05 02:16:37] [INFO ] Deduced a trap composed of 175 places in 218 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:37] [INFO ] Deduced a trap composed of 177 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-05 02:16:37] [INFO ] Deduced a trap composed of 175 places in 327 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:38] [INFO ] Deduced a trap composed of 175 places in 330 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:38] [INFO ] Deduced a trap composed of 177 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-05 02:16:38] [INFO ] Deduced a trap composed of 177 places in 275 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:39] [INFO ] Deduced a trap composed of 177 places in 238 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:39] [INFO ] Deduced a trap composed of 177 places in 239 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:39] [INFO ] Deduced a trap composed of 177 places in 231 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:39] [INFO ] Deduced a trap composed of 177 places in 230 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:40] [INFO ] Deduced a trap composed of 177 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-05 02:16:40] [INFO ] Deduced a trap composed of 177 places in 241 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:40] [INFO ] Deduced a trap composed of 177 places in 206 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:41] [INFO ] Deduced a trap composed of 177 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-05 02:16:41] [INFO ] Deduced a trap composed of 177 places in 207 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:41] [INFO ] Deduced a trap composed of 177 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-05 02:16:41] [INFO ] Deduced a trap composed of 177 places in 281 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:42] [INFO ] Deduced a trap composed of 177 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-05 02:16:44] [INFO ] Deduced a trap composed of 177 places in 2795 ms of which 2601 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:16:45] [INFO ] Deduced a trap composed of 177 places in 332 ms of which 145 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/132 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 132 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 40/40 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, 76/76 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:04] [INFO ] Deduced a trap composed of 96 places in 287 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:04] [INFO ] Deduced a trap composed of 96 places in 261 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:05] [INFO ] Deduced a trap composed of 96 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-05 02:17:05] [INFO ] Deduced a trap composed of 96 places in 243 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:05] [INFO ] Deduced a trap composed of 96 places in 254 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:05] [INFO ] Deduced a trap composed of 96 places in 255 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:06] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:06] [INFO ] Deduced a trap composed of 177 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-05 02:17:06] [INFO ] Deduced a trap composed of 177 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-05 02:17:06] [INFO ] Deduced a trap composed of 177 places in 258 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:07] [INFO ] Deduced a trap composed of 177 places in 232 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:07] [INFO ] Deduced a trap composed of 177 places in 238 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:07] [INFO ] Deduced a trap composed of 177 places in 257 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:08] [INFO ] Deduced a trap composed of 177 places in 257 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:08] [INFO ] Deduced a trap composed of 177 places in 299 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:08] [INFO ] Deduced a trap composed of 177 places in 268 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:08] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:09] [INFO ] Deduced a trap composed of 177 places in 269 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:09] [INFO ] Deduced a trap composed of 177 places in 274 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:09] [INFO ] Deduced a trap composed of 177 places in 273 ms of which 81 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:17] [INFO ] Deduced a trap composed of 177 places in 226 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:17] [INFO ] Deduced a trap composed of 177 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-05 02:17:17] [INFO ] Deduced a trap composed of 177 places in 231 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:17] [INFO ] Deduced a trap composed of 177 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-05 02:17:18] [INFO ] Deduced a trap composed of 177 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-05 02:17:18] [INFO ] Deduced a trap composed of 177 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-05 02:17:18] [INFO ] Deduced a trap composed of 177 places in 236 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:18] [INFO ] Deduced a trap composed of 177 places in 226 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:19] [INFO ] Deduced a trap composed of 177 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-05 02:17:19] [INFO ] Deduced a trap composed of 177 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-05 02:17:19] [INFO ] Deduced a trap composed of 177 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-05 02:17:19] [INFO ] Deduced a trap composed of 177 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-05 02:17:20] [INFO ] Deduced a trap composed of 177 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-05 02:17:20] [INFO ] Deduced a trap composed of 177 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-05 02:17:20] [INFO ] Deduced a trap composed of 177 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-05 02:17:20] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:21] [INFO ] Deduced a trap composed of 177 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-05 02:17:21] [INFO ] Deduced a trap composed of 177 places in 203 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:21] [INFO ] Deduced a trap composed of 177 places in 261 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:17:21] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/1354 variables, and 172 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/781 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60620ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60621ms
Starting structural reductions in SI_LTL mode, iteration 1 : 571/573 places, 787/789 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90892 ms. Remains : 571/573 places, 787/789 transitions.
Built C files in :
/tmp/ltsmin15526223249385973010
[2025-06-05 02:17:22] [INFO ] Computing symmetric may disable matrix : 787 transitions.
[2025-06-05 02:17:22] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:17:22] [INFO ] Computing symmetric may enable matrix : 787 transitions.
[2025-06-05 02:17:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:17:22] [INFO ] Computing Do-Not-Accords matrix : 787 transitions.
[2025-06-05 02:17:22] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:17:22] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15526223249385973010
Running compilation step : cd /tmp/ltsmin15526223249385973010;'/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 2326 ms.
Running link step : cd /tmp/ltsmin15526223249385973010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin15526223249385973010;'/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/stateBased16031031111837768452.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 02:17:37] [INFO ] Flatten gal took : 160 ms
[2025-06-05 02:17:37] [INFO ] Flatten gal took : 136 ms
[2025-06-05 02:17:37] [INFO ] Time to serialize gal into /tmp/LTL11513776564788013306.gal : 18 ms
[2025-06-05 02:17:37] [INFO ] Time to serialize properties into /tmp/LTL4872118770610080279.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/LTL11513776564788013306.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3282591160045261007.hoa' '-atoms' '/tmp/LTL4872118770610080279.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4872118770610080279.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3282591160045261007.hoa
Detected timeout of ITS tools.
[2025-06-05 02:17:53] [INFO ] Flatten gal took : 37 ms
[2025-06-05 02:17:53] [INFO ] Flatten gal took : 36 ms
[2025-06-05 02:17:53] [INFO ] Time to serialize gal into /tmp/LTL4126862796469921995.gal : 6 ms
[2025-06-05 02:17:53] [INFO ] Time to serialize properties into /tmp/LTL18089663488277334903.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/LTL4126862796469921995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18089663488277334903.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(("(((((((FetchJobE_1_40+FetchJobE_1_23)+(FetchJobE_1_4+FetchJobE_1_19))+((FetchJobE_1_39+FetchJobE_1_5)+(FetchJobE_1_26+FetchJo...1606
Formula 0 simplified : XF(!"(((((((FetchJobE_1_40+FetchJobE_1_23)+(FetchJobE_1_4+FetchJobE_1_19))+((FetchJobE_1_39+FetchJobE_1_5)+(FetchJobE_1_26+FetchJobE...1509
Detected timeout of ITS tools.
[2025-06-05 02:18:08] [INFO ] Flatten gal took : 31 ms
[2025-06-05 02:18:08] [INFO ] Applying decomposition
[2025-06-05 02:18:08] [INFO ] Flatten gal took : 31 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/graph12354985768971873983.txt' '-o' '/tmp/graph12354985768971873983.bin' '-w' '/tmp/graph12354985768971873983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12354985768971873983.bin' '-l' '-1' '-v' '-w' '/tmp/graph12354985768971873983.weights' '-q' '0' '-e' '0.001'
[2025-06-05 02:18:08] [INFO ] Decomposing Gal with order
[2025-06-05 02:18:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 02:18:08] [INFO ] Removed a total of 854 redundant transitions.
[2025-06-05 02:18:08] [INFO ] Flatten gal took : 142 ms
[2025-06-05 02:18:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 47 ms.
[2025-06-05 02:18:08] [INFO ] Time to serialize gal into /tmp/LTL380576350999027192.gal : 9 ms
[2025-06-05 02:18:08] [INFO ] Time to serialize properties into /tmp/LTL1781431050278491103.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/LTL380576350999027192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1781431050278491103.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(("(((((((gu5.FetchJobE_1_40+gu5.FetchJobE_1_23)+(gu5.FetchJobE_1_4+gu5.FetchJobE_1_19))+((gu5.FetchJobE_1_39+gu5.FetchJobE_1_5)...2046
Formula 0 simplified : XF(!"(((((((gu5.FetchJobE_1_40+gu5.FetchJobE_1_23)+(gu5.FetchJobE_1_4+gu5.FetchJobE_1_19))+((gu5.FetchJobE_1_39+gu5.FetchJobE_1_5)+(...1897
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-01 finished in 337885 ms.
[2025-06-05 02:18:23] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7749728072045159395
[2025-06-05 02:18:23] [INFO ] Computing symmetric may disable matrix : 840 transitions.
[2025-06-05 02:18:23] [INFO ] Applying decomposition
[2025-06-05 02:18:23] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:18:23] [INFO ] Computing symmetric may enable matrix : 840 transitions.
[2025-06-05 02:18:23] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:18:23] [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/graph14350307058739936913.txt' '-o' '/tmp/graph14350307058739936913.bin' '-w' '/tmp/graph14350307058739936913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14350307058739936913.bin' '-l' '-1' '-v' '-w' '/tmp/graph14350307058739936913.weights' '-q' '0' '-e' '0.001'
[2025-06-05 02:18:23] [INFO ] Decomposing Gal with order
[2025-06-05 02:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 02:18:23] [INFO ] Computing Do-Not-Accords matrix : 840 transitions.
[2025-06-05 02:18:23] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 02:18:23] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7749728072045159395
Running compilation step : cd /tmp/ltsmin7749728072045159395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-05 02:18:24] [INFO ] Removed a total of 641 redundant transitions.
[2025-06-05 02:18:24] [INFO ] Flatten gal took : 106 ms
[2025-06-05 02:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 621 labels/synchronizations in 20 ms.
[2025-06-05 02:18:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality7485079055305882402.gal : 6 ms
[2025-06-05 02:18:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality14475025725786600017.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/LTLCardinality7485079055305882402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14475025725786600017.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 1 LTL properties
Checking formula 0 : !((X(G(("(((((((gu2.FetchJobE_1_40+gu2.FetchJobE_1_23)+(gu2.FetchJobE_1_4+gu2.FetchJobE_1_19))+((gu2.FetchJobE_1_39+gu2.FetchJobE_1_5)...2046
Formula 0 simplified : XF(!"(((((((gu2.FetchJobE_1_40+gu2.FetchJobE_1_23)+(gu2.FetchJobE_1_4+gu2.FetchJobE_1_19))+((gu2.FetchJobE_1_39+gu2.FetchJobE_1_5)+(...1897
Compilation finished in 2517 ms.
Running link step : cd /tmp/ltsmin7749728072045159395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin7749728072045159395;'/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( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 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( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.076: 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.076: "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( 2/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.079: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.113: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.116: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.118: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.120: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.122: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.288: DFS-FIFO for weak LTL, using special progress label 844
pins2lts-mc-linux64( 0/ 8), 0.288: There are 845 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.288: State length is 630, there are 851 groups
pins2lts-mc-linux64( 0/ 8), 0.288: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.288: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.289: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.289: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.369: ~1 levels ~960 states ~10344 transitions
pins2lts-mc-linux64( 1/ 8), 0.435: ~1 levels ~1920 states ~4248 transitions
pins2lts-mc-linux64( 1/ 8), 0.508: ~1 levels ~3840 states ~6168 transitions
pins2lts-mc-linux64( 1/ 8), 0.645: ~1 levels ~7680 states ~10008 transitions
pins2lts-mc-linux64( 1/ 8), 1.052: ~1 levels ~15360 states ~41288 transitions
pins2lts-mc-linux64( 1/ 8), 1.608: ~1 levels ~30720 states ~96232 transitions
pins2lts-mc-linux64( 1/ 8), 2.589: ~1 levels ~61440 states ~191032 transitions
pins2lts-mc-linux64( 1/ 8), 4.525: ~6 levels ~122880 states ~377280 transitions
pins2lts-mc-linux64( 1/ 8), 7.971: ~6 levels ~245760 states ~793704 transitions
pins2lts-mc-linux64( 0/ 8), 15.387: ~1 levels ~491520 states ~1472856 transitions
pins2lts-mc-linux64( 0/ 8), 27.180: ~1 levels ~983040 states ~2202904 transitions
pins2lts-mc-linux64( 0/ 8), 51.801: ~1 levels ~1966080 states ~4155784 transitions
pins2lts-mc-linux64( 1/ 8), 101.931: ~6 levels ~3932160 states ~9447384 transitions
pins2lts-mc-linux64( 1/ 8), 199.367: ~6 levels ~7864320 states ~16774592 transitions
pins2lts-mc-linux64( 4/ 8), 351.377: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 351.790:
pins2lts-mc-linux64( 0/ 8), 351.791: mean standard work distribution: 15.3% (states) 35.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 351.791:
pins2lts-mc-linux64( 0/ 8), 351.791: Explored 11331184 states 55790801 transitions, fanout: 4.924
pins2lts-mc-linux64( 0/ 8), 351.791: Total exploration time 351.480 sec (351.120 sec minimum, 351.194 sec on average)
pins2lts-mc-linux64( 0/ 8), 351.791: States per second: 32238, Transitions per second: 158731
pins2lts-mc-linux64( 0/ 8), 351.791:
pins2lts-mc-linux64( 0/ 8), 351.791: Progress states detected: 20367966
pins2lts-mc-linux64( 0/ 8), 351.791: Redundant explorations: -45.3500
pins2lts-mc-linux64( 0/ 8), 351.791:
pins2lts-mc-linux64( 0/ 8), 351.791: Queue width: 8B, total height: 18004909, memory: 137.37MB
pins2lts-mc-linux64( 0/ 8), 351.791: Tree memory: 414.2MB, 20.9 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 351.791: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 351.791: Stored 907 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 351.791: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 351.791: Est. total memory use: 551.6MB (~1161.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7749728072045159395;'/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/ltsmin7749728072045159395;'/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-PT-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-PT-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-174881254400651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-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 ;