About the Execution of GreatSPN+red for AutonomousCar-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6656.436 | 3600000.00 | 5877134.00 | 8833.80 | FFFFFT??F?F?F?F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166500372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is AutonomousCar-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166500372
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716365744785
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:15:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 08:15:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:15:48] [INFO ] Load time of PNML (sax parser for PT used): 634 ms
[2024-05-22 08:15:48] [INFO ] Transformed 425 places.
[2024-05-22 08:15:48] [INFO ] Transformed 2252 transitions.
[2024-05-22 08:15:48] [INFO ] Found NUPN structural information;
[2024-05-22 08:15:48] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 914 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-10b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 364 transition count 2191
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 364 transition count 2191
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 522 place count 364 transition count 1791
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 533 place count 353 transition count 1780
Iterating global reduction 1 with 11 rules applied. Total rules applied 544 place count 353 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 545 place count 352 transition count 1779
Iterating global reduction 1 with 1 rules applied. Total rules applied 546 place count 352 transition count 1779
Applied a total of 546 rules in 290 ms. Remains 352 /425 variables (removed 73) and now considering 1779/2252 (removed 473) transitions.
// Phase 1: matrix 1779 rows 352 cols
[2024-05-22 08:15:49] [INFO ] Computed 15 invariants in 84 ms
[2024-05-22 08:15:49] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-22 08:15:49] [INFO ] Invariant cache hit.
[2024-05-22 08:15:51] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
Running 1778 sub problems to find dead transitions.
[2024-05-22 08:15:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1778 unsolved
SMT process timed out in 57036ms, After SMT, problems are : Problem set: 0 solved, 1778 unsolved
Search for dead transitions found 0 dead transitions in 57144ms
Starting structural reductions in LTL mode, iteration 1 : 352/425 places, 1779/2252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59604 ms. Remains : 352/425 places, 1779/2252 transitions.
Support contains 45 out of 352 places after structural reductions.
[2024-05-22 08:16:49] [INFO ] Flatten gal took : 566 ms
[2024-05-22 08:16:49] [INFO ] Flatten gal took : 250 ms
[2024-05-22 08:16:50] [INFO ] Input system was already deterministic with 1779 transitions.
Support contains 44 out of 352 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (306 resets) in 3551 ms. (11 steps per ms) remains 29/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
[2024-05-22 08:16:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 284/320 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 32/352 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1779/2131 variables, 352/367 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2131 variables, 0/367 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2131/2131 variables, and 367 constraints, problems are : Problem set: 2 solved, 27 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 284/320 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
[2024-05-22 08:16:59] [INFO ] Deduced a trap composed of 5 places in 946 ms of which 36 ms to minimize.
[2024-05-22 08:17:00] [INFO ] Deduced a trap composed of 26 places in 765 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 32/352 variables, 2/17 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 27 unsolved
SMT process timed out in 11123ms, After SMT, problems are : Problem set: 2 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 284 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1867 edges and 350 vertex of which 348 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.36 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 348 transition count 1647
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 222 transition count 1588
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 187 transition count 1588
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 350 place count 187 transition count 1581
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 364 place count 180 transition count 1581
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 366 place count 178 transition count 1579
Iterating global reduction 3 with 2 rules applied. Total rules applied 368 place count 178 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 177 transition count 1569
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 177 transition count 1569
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 177 transition count 1567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 176 transition count 1567
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 483 place count 121 transition count 1512
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 484 place count 121 transition count 1511
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 492 place count 113 transition count 1440
Iterating global reduction 6 with 8 rules applied. Total rules applied 500 place count 113 transition count 1440
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 507 place count 113 transition count 1433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 509 place count 112 transition count 1432
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 531 place count 112 transition count 1410
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 553 place count 90 transition count 1410
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 561 place count 90 transition count 1410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 562 place count 89 transition count 1409
Applied a total of 562 rules in 813 ms. Remains 89 /352 variables (removed 263) and now considering 1409/1779 (removed 370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 89/352 places, 1409/1779 transitions.
RANDOM walk for 40000 steps (259 resets) in 1382 ms. (28 steps per ms) remains 20/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (11 resets) in 19 ms. (200 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 12/12 properties
// Phase 1: matrix 1409 rows 89 cols
[2024-05-22 08:17:04] [INFO ] Computed 15 invariants in 15 ms
[2024-05-22 08:17:04] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 53/84 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1406/1490 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1490 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/1498 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1498 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1498/1498 variables, and 105 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 89/89 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 53/84 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1406/1490 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1490 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/1498 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1498 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1498/1498 variables, and 105 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2548 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 89/89 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4601ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 9517 ms.
Support contains 31 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1409/1409 transitions.
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 2 place count 88 transition count 1408
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 87 transition count 1407
Applied a total of 3 rules in 245 ms. Remains 87 /89 variables (removed 2) and now considering 1407/1409 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 87/89 places, 1407/1409 transitions.
RANDOM walk for 40000 steps (282 resets) in 1457 ms. (27 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40002 steps (35 resets) in 192 ms. (207 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (40 resets) in 189 ms. (210 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (124 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (82 resets) in 183 ms. (217 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (80 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (65 resets) in 97 ms. (408 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (124 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
// Phase 1: matrix 1407 rows 87 cols
[2024-05-22 08:17:19] [INFO ] Computed 15 invariants in 14 ms
[2024-05-22 08:17:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/82 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1404/1486 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1486 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/1494 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1494 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1494 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1494 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1494 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1494/1494 variables, and 103 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/82 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1404/1486 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1486 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/1494 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1494 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1494 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1494 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1494 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1494/1494 variables, and 103 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1188 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2705ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2389 ms.
Support contains 20 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1407/1407 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 83 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 82 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 82 transition count 1392
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 0 with 4 rules applied. Total rules applied 14 place count 80 transition count 1390
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 80 transition count 1388
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 38 place count 78 transition count 1368
Applied a total of 38 rules in 207 ms. Remains 78 /87 variables (removed 9) and now considering 1368/1407 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 78/87 places, 1368/1407 transitions.
RANDOM walk for 40000 steps (108 resets) in 1574 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (123 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (124 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 360585 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 4
Probabilistic random walk after 360585 steps, saw 54289 distinct states, run finished after 3007 ms. (steps per millisecond=119 ) properties seen :0
// Phase 1: matrix 1368 rows 78 cols
[2024-05-22 08:17:28] [INFO ] Computed 15 invariants in 16 ms
[2024-05-22 08:17:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 53/73 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1365/1438 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1438 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/1446 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1446 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1446 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1446 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1446 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1446/1446 variables, and 94 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1121 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 53/73 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1365/1438 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1438 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/1446 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1446 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1446 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1446 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1446 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1446/1446 variables, and 94 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1405 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2653ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2708 ms.
Support contains 20 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 1368/1368 transitions.
Applied a total of 0 rules in 83 ms. Remains 78 /78 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 78/78 places, 1368/1368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 1368/1368 transitions.
Applied a total of 0 rules in 73 ms. Remains 78 /78 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
[2024-05-22 08:17:33] [INFO ] Invariant cache hit.
[2024-05-22 08:17:34] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-22 08:17:34] [INFO ] Invariant cache hit.
[2024-05-22 08:17:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:17:35] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned [73, 77]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1405 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/78 places, 1367/1368 transitions.
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 2 place count 75 transition count 1366
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 75 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 74 transition count 1365
Applied a total of 4 rules in 269 ms. Remains 74 /76 variables (removed 2) and now considering 1365/1367 (removed 2) transitions.
// Phase 1: matrix 1365 rows 74 cols
[2024-05-22 08:17:35] [INFO ] Computed 13 invariants in 14 ms
[2024-05-22 08:17:35] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-22 08:17:35] [INFO ] Invariant cache hit.
[2024-05-22 08:17:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:17:37] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1484 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 74/78 places, 1365/1368 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3231 ms. Remains : 74/78 places, 1365/1368 transitions.
RANDOM walk for 40000 steps (31 resets) in 2727 ms. (14 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (123 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (124 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 404344 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 4
Probabilistic random walk after 404344 steps, saw 57502 distinct states, run finished after 3002 ms. (steps per millisecond=134 ) properties seen :0
[2024-05-22 08:17:40] [INFO ] Invariant cache hit.
[2024-05-22 08:17:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 52/72 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1365/1437 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1437 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1437 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1439 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1439 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1439 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1439/1439 variables, and 89 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1199 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 74/74 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 52/72 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1365/1437 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1437 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1437 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1439 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1439 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1439 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1439/1439 variables, and 89 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 74/74 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2476ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2615 ms.
Support contains 20 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1365/1365 transitions.
Applied a total of 0 rules in 72 ms. Remains 74 /74 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 74/74 places, 1365/1365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1365/1365 transitions.
Applied a total of 0 rules in 71 ms. Remains 74 /74 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
[2024-05-22 08:17:46] [INFO ] Invariant cache hit.
[2024-05-22 08:17:46] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-22 08:17:46] [INFO ] Invariant cache hit.
[2024-05-22 08:17:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:17:47] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2024-05-22 08:17:47] [INFO ] Redundant transitions in 202 ms returned []
Running 1355 sub problems to find dead transitions.
[2024-05-22 08:17:47] [INFO ] Invariant cache hit.
[2024-05-22 08:17:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 2 (OVERLAPS) 10/74 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
[2024-05-22 08:18:29] [INFO ] Deduced a trap composed of 6 places in 1354 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/1439 variables, and 14 constraints, problems are : Problem set: 0 solved, 1355 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/74 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1355/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 2 (OVERLAPS) 10/74 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 5 (OVERLAPS) 1365/1439 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
SMT process timed out in 84525ms, After SMT, problems are : Problem set: 0 solved, 1355 unsolved
Search for dead transitions found 0 dead transitions in 84555ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86184 ms. Remains : 74/74 places, 1365/1365 transitions.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Computed a total of 53 stabilizing places and 54 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))&&p0))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 60 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:19:12] [INFO ] Computed 15 invariants in 16 ms
[2024-05-22 08:19:13] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-05-22 08:19:13] [INFO ] Invariant cache hit.
[2024-05-22 08:19:15] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2574 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:19:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 57202ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 57242ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59890 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 490 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-00 finished in 60511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&(p1||G(p0))))||X(F(p2))))'
Support contains 6 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 53 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
[2024-05-22 08:20:13] [INFO ] Invariant cache hit.
[2024-05-22 08:20:14] [INFO ] Implicit Places using invariants in 837 ms returned []
[2024-05-22 08:20:14] [INFO ] Invariant cache hit.
[2024-05-22 08:20:16] [INFO ] Implicit Places using invariants and state equation in 1902 ms returned []
Implicit Place search using SMT with State Equation took 2746 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:20:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 56395ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 56443ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59264 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01
Product exploration explored 100000 steps with 499 reset in 905 ms.
Product exploration explored 100000 steps with 746 reset in 565 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
RANDOM walk for 40000 steps (306 resets) in 510 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (45 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 556 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (42 resets) in 682 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (43 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 177621 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 6
Probabilistic random walk after 177621 steps, saw 34271 distinct states, run finished after 3009 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-22 08:21:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 105/111 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 236/347 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1774/2121 variables, 347/362 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2121/2121 variables, and 362 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1122 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 105/111 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 236/347 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 08:21:21] [INFO ] Deduced a trap composed of 31 places in 1590 ms of which 7 ms to minimize.
[2024-05-22 08:21:23] [INFO ] Deduced a trap composed of 31 places in 1730 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1774/2121 variables, 347/364 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 08:21:26] [INFO ] Deduced a trap composed of 31 places in 1424 ms of which 5 ms to minimize.
SMT process timed out in 7660ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 343 transition count 1642
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 217 transition count 1583
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 182 transition count 1583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 182 transition count 1577
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 362 place count 176 transition count 1577
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 522 place count 96 transition count 1497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 523 place count 96 transition count 1496
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 542 place count 77 transition count 1305
Iterating global reduction 4 with 19 rules applied. Total rules applied 561 place count 77 transition count 1305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 569 place count 77 transition count 1297
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 5 with 2 rules applied. Total rules applied 571 place count 76 transition count 1296
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 583 place count 76 transition count 1284
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 595 place count 64 transition count 1284
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 64 transition count 1284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 597 place count 63 transition count 1283
Applied a total of 597 rules in 519 ms. Remains 63 /347 variables (removed 284) and now considering 1283/1774 (removed 491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 63/347 places, 1283/1774 transitions.
RANDOM walk for 40000 steps (417 resets) in 1803 ms. (22 steps per ms) remains 2/5 properties
BEST_FIRST walk for 7991 steps (6 resets) in 30 ms. (257 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 10 factoid took 320 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 338 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 365 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 6 out of 347 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 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 307 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 344 transition count 1646
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 342 place count 185 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 342 place count 185 transition count 1584
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 352 place count 180 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 353 place count 179 transition count 1583
Iterating global reduction 3 with 1 rules applied. Total rules applied 354 place count 179 transition count 1583
Performed 69 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 492 place count 110 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 110 transition count 1512
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 506 place count 97 transition count 1387
Iterating global reduction 4 with 13 rules applied. Total rules applied 519 place count 97 transition count 1387
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 527 place count 97 transition count 1379
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 5 with 4 rules applied. Total rules applied 531 place count 95 transition count 1377
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 533 place count 95 transition count 1377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 535 place count 93 transition count 1375
Applied a total of 535 rules in 1005 ms. Remains 93 /347 variables (removed 254) and now considering 1375/1774 (removed 399) transitions.
// Phase 1: matrix 1375 rows 93 cols
[2024-05-22 08:21:29] [INFO ] Computed 14 invariants in 11 ms
[2024-05-22 08:21:29] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-22 08:21:29] [INFO ] Invariant cache hit.
[2024-05-22 08:21:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:21:30] [INFO ] Implicit Places using invariants and state equation in 899 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1255 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/347 places, 1375/1774 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 1374
Applied a total of 2 rules in 152 ms. Remains 90 /91 variables (removed 1) and now considering 1374/1375 (removed 1) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2024-05-22 08:21:30] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 08:21:31] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-22 08:21:31] [INFO ] Invariant cache hit.
[2024-05-22 08:21:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:21:32] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/347 places, 1374/1774 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3655 ms. Remains : 90/347 places, 1374/1774 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 211 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), false, false]
RANDOM walk for 40000 steps (1430 resets) in 1206 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (114 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (113 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (111 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (108 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 264013 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 6
Probabilistic random walk after 264013 steps, saw 43867 distinct states, run finished after 3007 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-22 08:21:36] [INFO ] Invariant cache hit.
[2024-05-22 08:21:36] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1323/1355 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 107/1462 variables, 57/93 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 8/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1462 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1463 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1463 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/1464 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1464 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1464 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1464/1464 variables, and 103 constraints, problems are : Problem set: 1 solved, 5 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1323/1355 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 107/1462 variables, 57/93 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 8/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 08:21:39] [INFO ] Deduced a trap composed of 7 places in 1250 ms of which 2 ms to minimize.
[2024-05-22 08:21:40] [INFO ] Deduced a trap composed of 7 places in 1204 ms of which 2 ms to minimize.
[2024-05-22 08:21:41] [INFO ] Deduced a trap composed of 7 places in 1098 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1462 variables, 3/104 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1462 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/1463 variables, 1/105 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1463 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1464 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1464 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1464 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1464/1464 variables, and 106 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 3/3 constraints]
After SMT, in 5978ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1244 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 326 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 59/90 places, 1283/1374 transitions.
RANDOM walk for 40000 steps (468 resets) in 1129 ms. (35 steps per ms) remains 2/5 properties
BEST_FIRST walk for 8116 steps (5 resets) in 28 ms. (279 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 14 factoid took 374 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 1440 reset in 660 ms.
Product exploration explored 100000 steps with 1226 reset in 591 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 1374/1374 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 90 transition count 1373
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 89 transition count 1373
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 83 transition count 1367
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 77 transition count 1301
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 77 transition count 1301
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 73 transition count 1297
Applied a total of 34 rules in 179 ms. Remains 73 /90 variables (removed 17) and now considering 1297/1374 (removed 77) transitions.
// Phase 1: matrix 1297 rows 73 cols
[2024-05-22 08:21:47] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 08:21:47] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-22 08:21:47] [INFO ] Invariant cache hit.
[2024-05-22 08:21:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:21:49] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2024-05-22 08:21:49] [INFO ] Redundant transitions in 150 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1293 sub problems to find dead transitions.
// Phase 1: matrix 1296 rows 73 cols
[2024-05-22 08:21:49] [INFO ] Computed 12 invariants in 13 ms
[2024-05-22 08:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 72/1369 variables, and 12 constraints, problems are : Problem set: 0 solved, 1293 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/73 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1293/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 72/1369 variables, and 12 constraints, problems are : Problem set: 0 solved, 1293 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/73 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1245/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 83295ms problems are : Problem set: 0 solved, 1293 unsolved
Search for dead transitions found 0 dead transitions in 83313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/90 places, 1296/1374 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 71 transition count 1294
Applied a total of 2 rules in 206 ms. Remains 71 /73 variables (removed 2) and now considering 1294/1296 (removed 2) transitions.
// Phase 1: matrix 1294 rows 71 cols
[2024-05-22 08:23:12] [INFO ] Computed 12 invariants in 13 ms
[2024-05-22 08:23:13] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-22 08:23:13] [INFO ] Invariant cache hit.
[2024-05-22 08:23:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:23:15] [INFO ] Implicit Places using invariants and state equation in 1731 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/90 places, 1294/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88295 ms. Remains : 71/90 places, 1294/1374 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-01 finished in 182652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((F(p1)&&F(p2)))))'
Support contains 19 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 298 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 349 transition count 1649
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 181 rules applied. Total rules applied 309 place count 222 transition count 1595
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 341 place count 190 transition count 1595
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 341 place count 190 transition count 1587
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 357 place count 182 transition count 1587
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 360 place count 179 transition count 1584
Iterating global reduction 3 with 3 rules applied. Total rules applied 363 place count 179 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 364 place count 178 transition count 1574
Iterating global reduction 3 with 1 rules applied. Total rules applied 365 place count 178 transition count 1574
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 367 place count 178 transition count 1572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 368 place count 177 transition count 1572
Performed 62 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 492 place count 115 transition count 1509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 493 place count 115 transition count 1508
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 504 place count 104 transition count 1406
Iterating global reduction 6 with 11 rules applied. Total rules applied 515 place count 104 transition count 1406
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 524 place count 104 transition count 1397
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 528 place count 102 transition count 1395
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 530 place count 100 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 531 place count 99 transition count 1393
Applied a total of 531 rules in 509 ms. Remains 99 /352 variables (removed 253) and now considering 1393/1779 (removed 386) transitions.
// Phase 1: matrix 1393 rows 99 cols
[2024-05-22 08:23:16] [INFO ] Computed 13 invariants in 12 ms
[2024-05-22 08:23:16] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 08:23:16] [INFO ] Invariant cache hit.
[2024-05-22 08:23:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:23:17] [INFO ] Implicit Places using invariants and state equation in 886 ms returned [94, 98]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1123 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/352 places, 1393/1779 transitions.
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 2 place count 96 transition count 1392
Applied a total of 2 rules in 146 ms. Remains 96 /97 variables (removed 1) and now considering 1392/1393 (removed 1) transitions.
// Phase 1: matrix 1392 rows 96 cols
[2024-05-22 08:23:17] [INFO ] Computed 11 invariants in 10 ms
[2024-05-22 08:23:17] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 08:23:17] [INFO ] Invariant cache hit.
[2024-05-22 08:23:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:23:18] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/352 places, 1392/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2732 ms. Remains : 96/352 places, 1392/1779 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-03
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-03 finished in 2939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 350 transition count 1777
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 350 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 349 transition count 1776
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 349 transition count 1776
Applied a total of 6 rules in 33 ms. Remains 349 /352 variables (removed 3) and now considering 1776/1779 (removed 3) transitions.
// Phase 1: matrix 1776 rows 349 cols
[2024-05-22 08:23:18] [INFO ] Computed 15 invariants in 11 ms
[2024-05-22 08:23:19] [INFO ] Implicit Places using invariants in 885 ms returned []
[2024-05-22 08:23:19] [INFO ] Invariant cache hit.
[2024-05-22 08:23:21] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 2677 ms to find 0 implicit places.
Running 1775 sub problems to find dead transitions.
[2024-05-22 08:23:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1775 unsolved
SMT process timed out in 55331ms, After SMT, problems are : Problem set: 0 solved, 1775 unsolved
Search for dead transitions found 0 dead transitions in 55352ms
Starting structural reductions in LTL mode, iteration 1 : 349/352 places, 1776/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58070 ms. Remains : 349/352 places, 1776/1779 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-04 finished in 58263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G((F(p0)||G(!p1)))||((F(p0)||G(!p1))&&(G(!p1)||(!p1&&F(p2))))))))'
Support contains 20 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 349 transition count 1776
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 348 transition count 1775
Applied a total of 8 rules in 29 ms. Remains 348 /352 variables (removed 4) and now considering 1775/1779 (removed 4) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2024-05-22 08:24:17] [INFO ] Computed 15 invariants in 19 ms
[2024-05-22 08:24:17] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 08:24:17] [INFO ] Invariant cache hit.
[2024-05-22 08:24:18] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
Running 1774 sub problems to find dead transitions.
[2024-05-22 08:24:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
SMT process timed out in 56730ms, After SMT, problems are : Problem set: 0 solved, 1774 unsolved
Search for dead transitions found 0 dead transitions in 56750ms
Starting structural reductions in LTL mode, iteration 1 : 348/352 places, 1775/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58076 ms. Remains : 348/352 places, 1775/1779 transitions.
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-05
Product exploration explored 100000 steps with 266 reset in 511 ms.
Product exploration explored 100000 steps with 525 reset in 399 ms.
Computed a total of 52 stabilizing places and 53 stable transitions
Computed a total of 52 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 288 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (258 resets) in 587 ms. (68 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (51 resets) in 179 ms. (222 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (53 resets) in 127 ms. (312 steps per ms) remains 1/2 properties
[2024-05-22 08:25:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 297/2123 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, State Equation: 0/348 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p2 p0))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLFireability-05 finished in 60514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 332 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 349 transition count 1648
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 185 rules applied. Total rules applied 314 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 348 place count 187 transition count 1591
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 348 place count 187 transition count 1584
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 77 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 527 place count 98 transition count 1491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 528 place count 98 transition count 1490
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 547 place count 79 transition count 1300
Iterating global reduction 6 with 19 rules applied. Total rules applied 566 place count 79 transition count 1300
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 575 place count 79 transition count 1291
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 7 with 4 rules applied. Total rules applied 579 place count 77 transition count 1289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 580 place count 76 transition count 1288
Applied a total of 580 rules in 404 ms. Remains 76 /352 variables (removed 276) and now considering 1288/1779 (removed 491) transitions.
// Phase 1: matrix 1288 rows 76 cols
[2024-05-22 08:25:18] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 08:25:18] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-22 08:25:18] [INFO ] Invariant cache hit.
[2024-05-22 08:25:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:25:20] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned [71, 75]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2250 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/352 places, 1288/1779 transitions.
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 2 place count 73 transition count 1287
Applied a total of 2 rules in 121 ms. Remains 73 /74 variables (removed 1) and now considering 1287/1288 (removed 1) transitions.
// Phase 1: matrix 1287 rows 73 cols
[2024-05-22 08:25:20] [INFO ] Computed 12 invariants in 15 ms
[2024-05-22 08:25:21] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-05-22 08:25:21] [INFO ] Invariant cache hit.
[2024-05-22 08:25:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:25:22] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 2442 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/352 places, 1287/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5218 ms. Remains : 73/352 places, 1287/1779 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-06
Product exploration explored 100000 steps with 28 reset in 162 ms.
Product exploration explored 100000 steps with 331 reset in 225 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 806 steps (36 resets) in 18 ms. (42 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 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 1287/1287 transitions.
Applied a total of 0 rules in 104 ms. Remains 73 /73 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
[2024-05-22 08:25:23] [INFO ] Invariant cache hit.
[2024-05-22 08:25:24] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-05-22 08:25:24] [INFO ] Invariant cache hit.
[2024-05-22 08:25:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:25:25] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
[2024-05-22 08:25:25] [INFO ] Redundant transitions in 105 ms returned [1074]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1283 sub problems to find dead transitions.
// Phase 1: matrix 1286 rows 73 cols
[2024-05-22 08:25:25] [INFO ] Computed 12 invariants in 11 ms
[2024-05-22 08:25:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
SMT process timed out in 53328ms, After SMT, problems are : Problem set: 0 solved, 1283 unsolved
Search for dead transitions found 0 dead transitions in 53343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/73 places, 1286/1287 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 71 transition count 1284
Applied a total of 2 rules in 200 ms. Remains 71 /73 variables (removed 2) and now considering 1284/1286 (removed 2) transitions.
// Phase 1: matrix 1284 rows 71 cols
[2024-05-22 08:26:19] [INFO ] Computed 12 invariants in 11 ms
[2024-05-22 08:26:19] [INFO ] Implicit Places using invariants in 738 ms returned []
[2024-05-22 08:26:19] [INFO ] Invariant cache hit.
[2024-05-22 08:26:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:26:21] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1951 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/73 places, 1284/1287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57487 ms. Remains : 71/73 places, 1284/1287 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 635 steps (29 resets) in 16 ms. (37 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 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 54 reset in 175 ms.
Product exploration explored 100000 steps with 1781 reset in 933 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 1284/1284 transitions.
Applied a total of 0 rules in 110 ms. Remains 71 /71 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2024-05-22 08:26:22] [INFO ] Invariant cache hit.
[2024-05-22 08:26:23] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-05-22 08:26:23] [INFO ] Invariant cache hit.
[2024-05-22 08:26:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:26:24] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2024-05-22 08:26:24] [INFO ] Redundant transitions in 85 ms returned []
Running 1282 sub problems to find dead transitions.
[2024-05-22 08:26:24] [INFO ] Invariant cache hit.
[2024-05-22 08:26:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
SMT process timed out in 53412ms, After SMT, problems are : Problem set: 0 solved, 1282 unsolved
Search for dead transitions found 0 dead transitions in 53437ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55391 ms. Remains : 71/71 places, 1284/1284 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-06 finished in 120740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 16 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 304 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 350 place count 186 transition count 1583
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 364 place count 179 transition count 1583
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 367 place count 176 transition count 1580
Iterating global reduction 3 with 3 rules applied. Total rules applied 370 place count 176 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 371 place count 175 transition count 1570
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 175 transition count 1570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 374 place count 175 transition count 1568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 375 place count 174 transition count 1568
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 501 place count 111 transition count 1504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 502 place count 111 transition count 1503
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 512 place count 101 transition count 1412
Iterating global reduction 6 with 10 rules applied. Total rules applied 522 place count 101 transition count 1412
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 531 place count 101 transition count 1403
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 535 place count 99 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 537 place count 97 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 538 place count 96 transition count 1399
Applied a total of 538 rules in 554 ms. Remains 96 /352 variables (removed 256) and now considering 1399/1779 (removed 380) transitions.
// Phase 1: matrix 1399 rows 96 cols
[2024-05-22 08:27:19] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 08:27:19] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-22 08:27:19] [INFO ] Invariant cache hit.
[2024-05-22 08:27:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:27:20] [INFO ] Implicit Places using invariants and state equation in 873 ms returned [91, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1151 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/352 places, 1399/1779 transitions.
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 2 place count 93 transition count 1398
Applied a total of 2 rules in 151 ms. Remains 93 /94 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 93 cols
[2024-05-22 08:27:20] [INFO ] Computed 11 invariants in 8 ms
[2024-05-22 08:27:20] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-22 08:27:20] [INFO ] Invariant cache hit.
[2024-05-22 08:27:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:27:21] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/352 places, 1398/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3013 ms. Remains : 93/352 places, 1398/1779 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-07
Product exploration explored 100000 steps with 274 reset in 257 ms.
Product exploration explored 100000 steps with 905 reset in 465 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 164 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1410 resets) in 2523 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (127 resets) in 183 ms. (217 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (116 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (123 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (123 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
[2024-05-22 08:27:23] [INFO ] Invariant cache hit.
[2024-05-22 08:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/76 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1390/1466 variables, 76/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/1481 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1481 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1481 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 8/1489 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1489 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1490 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1490 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/1491 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1491 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1491 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1491/1491 variables, and 105 constraints, problems are : Problem set: 0 solved, 3 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/76 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1390/1466 variables, 76/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/1481 variables, 13/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1481 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1481 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/1489 variables, 3/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1489 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1490 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1490 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1491 variables, 1/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1491 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1491 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1491/1491 variables, and 105 constraints, problems are : Problem set: 1 solved, 2 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1815ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 17 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 485 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 1398/1398 transitions.
Applied a total of 0 rules in 79 ms. Remains 93 /93 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-22 08:27:26] [INFO ] Invariant cache hit.
[2024-05-22 08:27:26] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-22 08:27:26] [INFO ] Invariant cache hit.
[2024-05-22 08:27:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:27:27] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2024-05-22 08:27:27] [INFO ] Redundant transitions in 57 ms returned [1095]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1390 sub problems to find dead transitions.
// Phase 1: matrix 1397 rows 93 cols
[2024-05-22 08:27:27] [INFO ] Computed 11 invariants in 11 ms
[2024-05-22 08:27:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 91/1490 variables, and 11 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/93 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1390/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 91/1490 variables, and 11 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/93 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1326/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 85324ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 85340ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/93 places, 1397/1398 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 91 transition count 1395
Applied a total of 2 rules in 152 ms. Remains 91 /93 variables (removed 2) and now considering 1395/1397 (removed 2) transitions.
// Phase 1: matrix 1395 rows 91 cols
[2024-05-22 08:28:52] [INFO ] Computed 11 invariants in 13 ms
[2024-05-22 08:28:53] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-22 08:28:53] [INFO ] Invariant cache hit.
[2024-05-22 08:28:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:28:54] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/93 places, 1395/1398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88025 ms. Remains : 91/93 places, 1395/1398 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 170 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1417 resets) in 1669 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (135 resets) in 204 ms. (195 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (131 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (129 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
[2024-05-22 08:28:55] [INFO ] Invariant cache hit.
[2024-05-22 08:28:55] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/76 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1390/1466 variables, 76/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 17/1483 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1483 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1483 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/1485 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1485 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1486 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1486 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1486 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1486/1486 variables, and 103 constraints, problems are : Problem set: 0 solved, 3 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/76 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1390/1466 variables, 76/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/1483 variables, 13/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1483 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1483 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/1485 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1485 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1486 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1486 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1486 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1486/1486 variables, and 103 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1996ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 533 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1268 reset in 712 ms.
Product exploration explored 100000 steps with 824 reset in 440 ms.
Support contains 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1395/1395 transitions.
Applied a total of 0 rules in 108 ms. Remains 91 /91 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2024-05-22 08:28:59] [INFO ] Invariant cache hit.
[2024-05-22 08:28:59] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-22 08:28:59] [INFO ] Invariant cache hit.
[2024-05-22 08:29:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:29:00] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
[2024-05-22 08:29:00] [INFO ] Redundant transitions in 98 ms returned []
Running 1389 sub problems to find dead transitions.
[2024-05-22 08:29:01] [INFO ] Invariant cache hit.
[2024-05-22 08:29:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 2 (OVERLAPS) 5/90 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 90/1486 variables, and 11 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/91 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1389/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 2 (OVERLAPS) 5/90 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 90/1486 variables, and 11 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/91 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1328/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 85275ms problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 85303ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86998 ms. Remains : 91/91 places, 1395/1395 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-07 finished in 188120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0) U p1))&&(G((p2 U p1))||F(p3)))))'
Support contains 20 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 49 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:30:26] [INFO ] Computed 15 invariants in 13 ms
[2024-05-22 08:30:26] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-22 08:30:26] [INFO ] Invariant cache hit.
[2024-05-22 08:30:28] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:30:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 58269ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 58303ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60110 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-08 finished in 60548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1&&F(p2)))||p0))))'
Support contains 16 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 309 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 349 transition count 1651
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 224 transition count 1594
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 343 place count 190 transition count 1593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 344 place count 189 transition count 1593
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 344 place count 189 transition count 1586
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 358 place count 182 transition count 1586
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 361 place count 179 transition count 1583
Iterating global reduction 4 with 3 rules applied. Total rules applied 364 place count 179 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 365 place count 178 transition count 1573
Iterating global reduction 4 with 1 rules applied. Total rules applied 366 place count 178 transition count 1573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 368 place count 178 transition count 1571
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 369 place count 177 transition count 1571
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 501 place count 111 transition count 1504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 502 place count 111 transition count 1503
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 517 place count 96 transition count 1357
Iterating global reduction 7 with 15 rules applied. Total rules applied 532 place count 96 transition count 1357
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 541 place count 96 transition count 1348
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 8 with 4 rules applied. Total rules applied 545 place count 94 transition count 1346
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 546 place count 93 transition count 1345
Applied a total of 546 rules in 310 ms. Remains 93 /352 variables (removed 259) and now considering 1345/1779 (removed 434) transitions.
// Phase 1: matrix 1345 rows 93 cols
[2024-05-22 08:31:27] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 08:31:27] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-22 08:31:27] [INFO ] Invariant cache hit.
[2024-05-22 08:31:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:31:28] [INFO ] Implicit Places using invariants and state equation in 940 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1432 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/352 places, 1345/1779 transitions.
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 2 place count 90 transition count 1344
Applied a total of 2 rules in 147 ms. Remains 90 /91 variables (removed 1) and now considering 1344/1345 (removed 1) transitions.
// Phase 1: matrix 1344 rows 90 cols
[2024-05-22 08:31:29] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 08:31:29] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-22 08:31:29] [INFO ] Invariant cache hit.
[2024-05-22 08:31:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:31:30] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/352 places, 1344/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3428 ms. Remains : 90/352 places, 1344/1779 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-09
Product exploration explored 100000 steps with 1241 reset in 1018 ms.
Product exploration explored 100000 steps with 377 reset in 296 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/90 stabilizing places and 5/1344 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 605 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1252 resets) in 1404 ms. (28 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (122 resets) in 243 ms. (163 steps per ms) remains 1/5 properties
[2024-05-22 08:31:33] [INFO ] Invariant cache hit.
[2024-05-22 08:31:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1333/1402 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/1422 variables, 15/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1422 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1424 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1424 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1424 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/1432 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1432 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1433 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1433 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1434 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1434 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1434 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1434/1434 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 69/1434 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, State Equation: 0/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 733ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 15 factoid took 792 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 15 out of 90 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 : 90/90 places, 1344/1344 transitions.
Applied a total of 0 rules in 122 ms. Remains 90 /90 variables (removed 0) and now considering 1344/1344 (removed 0) transitions.
[2024-05-22 08:31:35] [INFO ] Invariant cache hit.
[2024-05-22 08:31:35] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-22 08:31:35] [INFO ] Invariant cache hit.
[2024-05-22 08:31:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:31:37] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
[2024-05-22 08:31:37] [INFO ] Redundant transitions in 94 ms returned [1091]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1339 sub problems to find dead transitions.
// Phase 1: matrix 1343 rows 90 cols
[2024-05-22 08:31:37] [INFO ] Computed 12 invariants in 13 ms
[2024-05-22 08:31:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 1 (OVERLAPS) 2/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
[2024-05-22 08:32:30] [INFO ] Deduced a trap composed of 38 places in 1708 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 88/1433 variables, and 13 constraints, problems are : Problem set: 0 solved, 1339 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1339/63 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 1 (OVERLAPS) 2/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 4 (OVERLAPS) 1342/1430 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1430 variables, 33/134 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/1433 variables, and 134 constraints, problems are : Problem set: 0 solved, 1339 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 88/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/63 constraints, Known Traps: 1/1 constraints]
After SMT, in 84990ms problems are : Problem set: 0 solved, 1339 unsolved
Search for dead transitions found 0 dead transitions in 85016ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/90 places, 1343/1344 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 88 transition count 1341
Applied a total of 2 rules in 86 ms. Remains 88 /90 variables (removed 2) and now considering 1341/1343 (removed 2) transitions.
// Phase 1: matrix 1341 rows 88 cols
[2024-05-22 08:33:02] [INFO ] Computed 12 invariants in 13 ms
[2024-05-22 08:33:02] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-22 08:33:02] [INFO ] Invariant cache hit.
[2024-05-22 08:33:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:33:03] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/90 places, 1341/1344 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88888 ms. Remains : 88/90 places, 1341/1344 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 39801 steps (1247 resets) in 1608 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 95 reset in 279 ms.
Product exploration explored 100000 steps with 1746 reset in 995 ms.
Support contains 15 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 1341/1341 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 1339
Applied a total of 1 rules in 142 ms. Remains 86 /88 variables (removed 2) and now considering 1339/1341 (removed 2) transitions.
// Phase 1: matrix 1339 rows 86 cols
[2024-05-22 08:33:06] [INFO ] Computed 12 invariants in 12 ms
[2024-05-22 08:33:07] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-22 08:33:07] [INFO ] Invariant cache hit.
[2024-05-22 08:33:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:33:08] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
[2024-05-22 08:33:08] [INFO ] Redundant transitions in 93 ms returned []
Running 1332 sub problems to find dead transitions.
[2024-05-22 08:33:08] [INFO ] Invariant cache hit.
[2024-05-22 08:33:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
At refinement iteration 2 (OVERLAPS) 6/85 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/1425 variables, and 12 constraints, problems are : Problem set: 0 solved, 1332 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/86 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1332/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
At refinement iteration 2 (OVERLAPS) 6/85 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 85/1425 variables, and 12 constraints, problems are : Problem set: 0 solved, 1332 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/86 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1278/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 84091ms problems are : Problem set: 0 solved, 1332 unsolved
Search for dead transitions found 0 dead transitions in 84121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/88 places, 1339/1341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86185 ms. Remains : 86/88 places, 1339/1341 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-09 finished in 186191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 15 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 314 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 349 transition count 1646
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 187 rules applied. Total rules applied 318 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 352 place count 185 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 352 place count 185 transition count 1584
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 509 place count 107 transition count 1500
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 510 place count 107 transition count 1499
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 525 place count 92 transition count 1353
Iterating global reduction 6 with 15 rules applied. Total rules applied 540 place count 92 transition count 1353
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 549 place count 92 transition count 1344
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 553 place count 90 transition count 1342
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 555 place count 88 transition count 1340
Applied a total of 555 rules in 502 ms. Remains 88 /352 variables (removed 264) and now considering 1340/1779 (removed 439) transitions.
// Phase 1: matrix 1340 rows 88 cols
[2024-05-22 08:34:33] [INFO ] Computed 14 invariants in 12 ms
[2024-05-22 08:34:34] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-22 08:34:34] [INFO ] Invariant cache hit.
[2024-05-22 08:34:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:34:35] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1816 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/352 places, 1340/1779 transitions.
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 2 place count 85 transition count 1339
Applied a total of 2 rules in 150 ms. Remains 85 /86 variables (removed 1) and now considering 1339/1340 (removed 1) transitions.
// Phase 1: matrix 1339 rows 85 cols
[2024-05-22 08:34:35] [INFO ] Computed 12 invariants in 12 ms
[2024-05-22 08:34:36] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-22 08:34:36] [INFO ] Invariant cache hit.
[2024-05-22 08:34:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:34:37] [INFO ] Implicit Places using invariants and state equation in 1307 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/352 places, 1339/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4327 ms. Remains : 85/352 places, 1339/1779 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-10
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-10 finished in 4520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0||F(G((p1 U !p2)))))))))'
Support contains 21 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 49 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:34:37] [INFO ] Computed 15 invariants in 19 ms
[2024-05-22 08:34:38] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-22 08:34:38] [INFO ] Invariant cache hit.
[2024-05-22 08:34:39] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:34:39] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)timeout
(s155 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 57605ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 57639ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59577 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 434 ms :[(AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-11
Product exploration explored 100000 steps with 559 reset in 862 ms.
Product exploration explored 100000 steps with 446 reset in 416 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (307 resets) in 379 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (42 resets) in 272 ms. (146 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (70 resets) in 464 ms. (86 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (41 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (59 resets) in 491 ms. (81 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (64 resets) in 502 ms. (79 steps per ms) remains 4/5 properties
[2024-05-22 08:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 294/315 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/347 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1774/2121 variables, 347/362 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2121/2121 variables, and 362 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1786 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 294/315 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 08:35:43] [INFO ] Deduced a trap composed of 31 places in 1202 ms of which 4 ms to minimize.
[2024-05-22 08:35:44] [INFO ] Deduced a trap composed of 31 places in 974 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 32/347 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 08:35:45] [INFO ] Deduced a trap composed of 21 places in 333 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1774/2121 variables, 347/365 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 08:35:47] [INFO ] Deduced a trap composed of 31 places in 1036 ms of which 5 ms to minimize.
[2024-05-22 08:35:48] [INFO ] Deduced a trap composed of 31 places in 1277 ms of which 4 ms to minimize.
SMT process timed out in 8148ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 295 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 348 place count 183 transition count 1579
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 358 place count 178 transition count 1579
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 490 place count 112 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 491 place count 112 transition count 1512
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 505 place count 98 transition count 1378
Iterating global reduction 4 with 14 rules applied. Total rules applied 519 place count 98 transition count 1378
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 529 place count 98 transition count 1368
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 5 with 2 rules applied. Total rules applied 531 place count 97 transition count 1367
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 548 place count 97 transition count 1350
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 565 place count 80 transition count 1350
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 572 place count 80 transition count 1350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 573 place count 79 transition count 1349
Applied a total of 573 rules in 571 ms. Remains 79 /347 variables (removed 268) and now considering 1349/1774 (removed 425) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 79/347 places, 1349/1774 transitions.
RANDOM walk for 40000 steps (95 resets) in 2904 ms. (13 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (112 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (113 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 294499 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 3
Probabilistic random walk after 294499 steps, saw 46912 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 1349 rows 79 cols
[2024-05-22 08:35:53] [INFO ] Computed 15 invariants in 11 ms
[2024-05-22 08:35:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/74 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1346/1420 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1420 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/1428 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1428 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1428 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1428 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1428 variables, and 95 constraints, problems are : Problem set: 0 solved, 3 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/74 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1346/1420 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 08:35:55] [INFO ] Deduced a trap composed of 8 places in 1075 ms of which 4 ms to minimize.
[2024-05-22 08:35:57] [INFO ] Deduced a trap composed of 8 places in 1072 ms of which 1 ms to minimize.
[2024-05-22 08:35:58] [INFO ] Deduced a trap composed of 8 places in 987 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1420 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1420 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/1428 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1428 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1428 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1428 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1428 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1428 variables, and 98 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4493 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 3/3 constraints]
After SMT, in 5393ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 2949 ms.
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 1349/1349 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 74 transition count 1344
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 12 place count 73 transition count 1343
Applied a total of 12 rules in 150 ms. Remains 73 /79 variables (removed 6) and now considering 1343/1349 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 73/79 places, 1343/1349 transitions.
RANDOM walk for 40000 steps (107 resets) in 2422 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (117 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (117 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 308444 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 2
Probabilistic random walk after 308444 steps, saw 46358 distinct states, run finished after 3004 ms. (steps per millisecond=102 ) properties seen :0
// Phase 1: matrix 1343 rows 73 cols
[2024-05-22 08:36:05] [INFO ] Computed 15 invariants in 6 ms
[2024-05-22 08:36:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1340/1408 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1408 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/1416 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1416 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1416 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 08:36:07] [INFO ] Deduced a trap composed of 6 places in 887 ms of which 1 ms to minimize.
[2024-05-22 08:36:08] [INFO ] Deduced a trap composed of 8 places in 887 ms of which 1 ms to minimize.
[2024-05-22 08:36:08] [INFO ] Deduced a trap composed of 6 places in 969 ms of which 2 ms to minimize.
[2024-05-22 08:36:10] [INFO ] Deduced a trap composed of 6 places in 1268 ms of which 2 ms to minimize.
[2024-05-22 08:36:11] [INFO ] Deduced a trap composed of 6 places in 1435 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1340/1408 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1408 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 8/1416 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1416 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1416 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1416 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 94 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6544 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 5/5 constraints]
After SMT, in 7318ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 879 ms.
Support contains 15 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1343/1343 transitions.
Applied a total of 0 rules in 69 ms. Remains 73 /73 variables (removed 0) and now considering 1343/1343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 73/73 places, 1343/1343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1343/1343 transitions.
Applied a total of 0 rules in 68 ms. Remains 73 /73 variables (removed 0) and now considering 1343/1343 (removed 0) transitions.
[2024-05-22 08:36:13] [INFO ] Invariant cache hit.
[2024-05-22 08:36:14] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-22 08:36:14] [INFO ] Invariant cache hit.
[2024-05-22 08:36:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:36:15] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned [68, 72]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1501 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/73 places, 1342/1343 transitions.
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 2 place count 70 transition count 1341
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 70 transition count 1340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 69 transition count 1340
Applied a total of 4 rules in 263 ms. Remains 69 /71 variables (removed 2) and now considering 1340/1342 (removed 2) transitions.
// Phase 1: matrix 1340 rows 69 cols
[2024-05-22 08:36:15] [INFO ] Computed 13 invariants in 10 ms
[2024-05-22 08:36:16] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-22 08:36:16] [INFO ] Invariant cache hit.
[2024-05-22 08:36:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:36:17] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 69/73 places, 1340/1343 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3514 ms. Remains : 69/73 places, 1340/1343 transitions.
RANDOM walk for 40000 steps (28 resets) in 2656 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (119 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (117 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 320832 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 2
Probabilistic random walk after 320832 steps, saw 45449 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-05-22 08:36:21] [INFO ] Invariant cache hit.
[2024-05-22 08:36:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1340/1407 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1407 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1407 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1409 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1409 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1409 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1409/1409 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 08:36:22] [INFO ] Deduced a trap composed of 6 places in 940 ms of which 2 ms to minimize.
[2024-05-22 08:36:23] [INFO ] Deduced a trap composed of 6 places in 899 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1340/1407 variables, 67/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1407 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 08:36:25] [INFO ] Deduced a trap composed of 6 places in 1002 ms of which 2 ms to minimize.
[2024-05-22 08:36:26] [INFO ] Deduced a trap composed of 6 places in 985 ms of which 2 ms to minimize.
[2024-05-22 08:36:27] [INFO ] Deduced a trap composed of 6 places in 1005 ms of which 2 ms to minimize.
[2024-05-22 08:36:28] [INFO ] Deduced a trap composed of 6 places in 946 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1407 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1407 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/1409 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1409 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1409 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1409/1409 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6868 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 6/6 constraints]
After SMT, in 7477ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 659 ms.
Support contains 15 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1340/1340 transitions.
Applied a total of 0 rules in 76 ms. Remains 69 /69 variables (removed 0) and now considering 1340/1340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 69/69 places, 1340/1340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1340/1340 transitions.
Applied a total of 0 rules in 79 ms. Remains 69 /69 variables (removed 0) and now considering 1340/1340 (removed 0) transitions.
[2024-05-22 08:36:29] [INFO ] Invariant cache hit.
[2024-05-22 08:36:29] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-22 08:36:29] [INFO ] Invariant cache hit.
[2024-05-22 08:36:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:36:30] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2024-05-22 08:36:30] [INFO ] Redundant transitions in 95 ms returned []
Running 1329 sub problems to find dead transitions.
[2024-05-22 08:36:30] [INFO ] Invariant cache hit.
[2024-05-22 08:36:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1329 unsolved
At refinement iteration 2 (OVERLAPS) 11/69 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1329 unsolved
[2024-05-22 08:37:11] [INFO ] Deduced a trap composed of 6 places in 1188 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 69/1409 variables, and 14 constraints, problems are : Problem set: 0 solved, 1329 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/69 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1329/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1329 unsolved
At refinement iteration 2 (OVERLAPS) 11/69 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1329 unsolved
Problem TDEAD1339 is UNSAT
At refinement iteration 5 (OVERLAPS) 1340/1409 variables, 69/83 constraints. Problems are: Problem set: 1 solved, 1328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1409 variables, 2/85 constraints. Problems are: Problem set: 1 solved, 1328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1409/1409 variables, and 117 constraints, problems are : Problem set: 1 solved, 1328 unsolved in 30193 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1329/32 constraints, Known Traps: 1/1 constraints]
After SMT, in 85124ms problems are : Problem set: 1 solved, 1328 unsolved
Search for dead transitions found 1 dead transitions in 85153ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 69/69 places, 1339/1340 transitions.
Applied a total of 0 rules in 108 ms. Remains 69 /69 variables (removed 0) and now considering 1339/1339 (removed 0) transitions.
[2024-05-22 08:37:56] [INFO ] Redundant transitions in 75 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 86774 ms. Remains : 69/69 places, 1339/1340 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 15 out of 347 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 10 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:37:56] [INFO ] Computed 15 invariants in 12 ms
[2024-05-22 08:37:57] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-22 08:37:57] [INFO ] Invariant cache hit.
[2024-05-22 08:37:58] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:37:58] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 56901ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 56923ms
Finished structural reductions in LTL mode , in 1 iterations and 58218 ms. Remains : 347/347 places, 1774/1774 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (270 resets) in 787 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (55 resets) in 223 ms. (178 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (41 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
[2024-05-22 08:38:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/347 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:38:58] [INFO ] Deduced a trap composed of 31 places in 1884 ms of which 5 ms to minimize.
[2024-05-22 08:39:00] [INFO ] Deduced a trap composed of 21 places in 1992 ms of which 5 ms to minimize.
[2024-05-22 08:39:01] [INFO ] Deduced a trap composed of 31 places in 1878 ms of which 4 ms to minimize.
SMT process timed out in 5956ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 183 transition count 1578
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 360 place count 177 transition count 1578
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 524 place count 95 transition count 1496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 95 transition count 1495
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 545 place count 75 transition count 1295
Iterating global reduction 4 with 20 rules applied. Total rules applied 565 place count 75 transition count 1295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 575 place count 75 transition count 1285
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 5 with 2 rules applied. Total rules applied 577 place count 74 transition count 1284
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 588 place count 74 transition count 1273
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 599 place count 63 transition count 1273
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 63 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 62 transition count 1272
Applied a total of 601 rules in 602 ms. Remains 62 /347 variables (removed 285) and now considering 1272/1774 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 602 ms. Remains : 62/347 places, 1272/1774 transitions.
RANDOM walk for 40000 steps (129 resets) in 1112 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (139 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 530136 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 530136 steps, saw 75518 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
// Phase 1: matrix 1272 rows 62 cols
[2024-05-22 08:39:05] [INFO ] Computed 15 invariants in 7 ms
[2024-05-22 08:39:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1438ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 75 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 62/62 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 109 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-22 08:39:07] [INFO ] Invariant cache hit.
[2024-05-22 08:39:08] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2024-05-22 08:39:08] [INFO ] Invariant cache hit.
[2024-05-22 08:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:39:10] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned [57, 61]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 2890 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 1271/1272 transitions.
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 2 place count 59 transition count 1270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 1269
Applied a total of 4 rules in 271 ms. Remains 58 /60 variables (removed 2) and now considering 1269/1271 (removed 2) transitions.
// Phase 1: matrix 1269 rows 58 cols
[2024-05-22 08:39:10] [INFO ] Computed 13 invariants in 11 ms
[2024-05-22 08:39:11] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-05-22 08:39:11] [INFO ] Invariant cache hit.
[2024-05-22 08:39:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:39:13] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 1269/1272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6004 ms. Remains : 58/62 places, 1269/1272 transitions.
RANDOM walk for 40000 steps (44 resets) in 1394 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (138 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 466499 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 466499 steps, saw 65288 distinct states, run finished after 3005 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-22 08:39:16] [INFO ] Invariant cache hit.
[2024-05-22 08:39:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1625ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 125 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 58/58 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 126 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2024-05-22 08:39:18] [INFO ] Invariant cache hit.
[2024-05-22 08:39:19] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2024-05-22 08:39:19] [INFO ] Invariant cache hit.
[2024-05-22 08:39:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:39:21] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 2561 ms to find 0 implicit places.
[2024-05-22 08:39:21] [INFO ] Redundant transitions in 84 ms returned []
Running 1267 sub problems to find dead transitions.
[2024-05-22 08:39:21] [INFO ] Invariant cache hit.
[2024-05-22 08:39:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/1327 variables, and 13 constraints, problems are : Problem set: 0 solved, 1267 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/58 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1267/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 58/1327 variables, and 13 constraints, problems are : Problem set: 0 solved, 1267 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/58 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1236/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 83913ms problems are : Problem set: 0 solved, 1267 unsolved
Search for dead transitions found 0 dead transitions in 83940ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86726 ms. Remains : 58/58 places, 1269/1269 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 642 reset in 706 ms.
Product exploration explored 100000 steps with 645 reset in 521 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 307 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 345 transition count 1772
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 148 place count 345 transition count 1749
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 148 place count 345 transition count 1749
Deduced a syphon composed of 149 places in 2 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 173 place count 345 transition count 1749
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 280 place count 238 transition count 1642
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 387 place count 238 transition count 1642
Performed 87 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 2 with 87 rules applied. Total rules applied 474 place count 238 transition count 1655
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 476 place count 238 transition count 1653
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 543 place count 171 transition count 1456
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 3 with 67 rules applied. Total rules applied 610 place count 171 transition count 1456
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 630 place count 171 transition count 1436
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 641 place count 160 transition count 1425
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 652 place count 160 transition count 1425
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 653 place count 160 transition count 1425
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 655 place count 158 transition count 1423
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 657 place count 158 transition count 1423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 658 place count 158 transition count 1425
Deduced a syphon composed of 67 places in 1 ms
Applied a total of 658 rules in 321 ms. Remains 158 /347 variables (removed 189) and now considering 1425/1774 (removed 349) transitions.
[2024-05-22 08:40:49] [INFO ] Redundant transitions in 60 ms returned []
Running 1424 sub problems to find dead transitions.
// Phase 1: matrix 1425 rows 158 cols
[2024-05-22 08:40:49] [INFO ] Computed 14 invariants in 10 ms
[2024-05-22 08:40:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1424 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1424 unsolved
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 5 places in 432 ms of which 4 ms to minimize.
[2024-05-22 08:41:34] [INFO ] Deduced a trap composed of 6 places in 1380 ms of which 4 ms to minimize.
[2024-05-22 08:41:35] [INFO ] Deduced a trap composed of 5 places in 1014 ms of which 2 ms to minimize.
[2024-05-22 08:41:37] [INFO ] Deduced a trap composed of 6 places in 1397 ms of which 2 ms to minimize.
[2024-05-22 08:41:38] [INFO ] Deduced a trap composed of 16 places in 1509 ms of which 3 ms to minimize.
[2024-05-22 08:41:40] [INFO ] Deduced a trap composed of 7 places in 1201 ms of which 2 ms to minimize.
[2024-05-22 08:41:40] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 08:41:42] [INFO ] Deduced a trap composed of 35 places in 1480 ms of which 3 ms to minimize.
[2024-05-22 08:41:43] [INFO ] Deduced a trap composed of 8 places in 1258 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/1583 variables, and 23 constraints, problems are : Problem set: 2 solved, 1422 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/158 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1424/136 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1422 unsolved
At refinement iteration 1 (OVERLAPS) 3/158 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 1422 unsolved
Problem TDEAD1076 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 9/23 constraints. Problems are: Problem set: 12 solved, 1412 unsolved
[2024-05-22 08:41:56] [INFO ] Deduced a trap composed of 8 places in 1428 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-22 08:41:58] [INFO ] Deduced a trap composed of 8 places in 1451 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-22 08:41:59] [INFO ] Deduced a trap composed of 8 places in 1281 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-22 08:42:00] [INFO ] Deduced a trap composed of 8 places in 1198 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-22 08:42:02] [INFO ] Deduced a trap composed of 9 places in 1309 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-22 08:42:04] [INFO ] Deduced a trap composed of 16 places in 1735 ms of which 2 ms to minimize.
[2024-05-22 08:42:05] [INFO ] Deduced a trap composed of 16 places in 1610 ms of which 2 ms to minimize.
[2024-05-22 08:42:07] [INFO ] Deduced a trap composed of 14 places in 1577 ms of which 3 ms to minimize.
[2024-05-22 08:42:08] [INFO ] Deduced a trap composed of 19 places in 1412 ms of which 4 ms to minimize.
[2024-05-22 08:42:09] [INFO ] Deduced a trap composed of 12 places in 1255 ms of which 3 ms to minimize.
Problem TDEAD50 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/1583 variables, and 33 constraints, problems are : Problem set: 18 solved, 1406 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/158 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1288/136 constraints, Known Traps: 19/19 constraints]
After SMT, in 84584ms problems are : Problem set: 18 solved, 1406 unsolved
Search for dead transitions found 18 dead transitions in 84605ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/347 places, 1407/1774 transitions.
Graph (complete) has 1241 edges and 158 vertex of which 141 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.5 ms
Discarding 17 places :
Also discarding 0 output transitions
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 1 rules in 89 ms. Remains 141 /158 variables (removed 17) and now considering 1407/1407 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/347 places, 1407/1774 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85092 ms. Remains : 141/347 places, 1407/1774 transitions.
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 19 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:42:13] [INFO ] Computed 15 invariants in 20 ms
[2024-05-22 08:42:14] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-22 08:42:14] [INFO ] Invariant cache hit.
[2024-05-22 08:42:16] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:42:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 56635ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 56669ms
Finished structural reductions in LTL mode , in 1 iterations and 59100 ms. Remains : 347/347 places, 1774/1774 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-11 finished in 515305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p0)))))'
Support contains 11 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 60 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
[2024-05-22 08:43:13] [INFO ] Invariant cache hit.
[2024-05-22 08:43:13] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-05-22 08:43:13] [INFO ] Invariant cache hit.
[2024-05-22 08:43:15] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:43:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 58452ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 58487ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61065 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-12
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-12 finished in 61225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 11 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 314 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 350 place count 186 transition count 1583
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 364 place count 179 transition count 1583
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 367 place count 176 transition count 1580
Iterating global reduction 3 with 3 rules applied. Total rules applied 370 place count 176 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 371 place count 175 transition count 1570
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 175 transition count 1570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 374 place count 175 transition count 1568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 375 place count 174 transition count 1568
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 511 place count 106 transition count 1499
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 512 place count 106 transition count 1498
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 528 place count 90 transition count 1341
Iterating global reduction 6 with 16 rules applied. Total rules applied 544 place count 90 transition count 1341
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 553 place count 90 transition count 1332
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 557 place count 88 transition count 1330
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 559 place count 86 transition count 1328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 560 place count 85 transition count 1328
Applied a total of 560 rules in 548 ms. Remains 85 /352 variables (removed 267) and now considering 1328/1779 (removed 451) transitions.
// Phase 1: matrix 1328 rows 85 cols
[2024-05-22 08:44:14] [INFO ] Computed 13 invariants in 12 ms
[2024-05-22 08:44:15] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-22 08:44:15] [INFO ] Invariant cache hit.
[2024-05-22 08:44:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:44:16] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned [80, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1886 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/352 places, 1328/1779 transitions.
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 2 place count 82 transition count 1327
Applied a total of 2 rules in 147 ms. Remains 82 /83 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
// Phase 1: matrix 1327 rows 82 cols
[2024-05-22 08:44:16] [INFO ] Computed 11 invariants in 13 ms
[2024-05-22 08:44:17] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-05-22 08:44:17] [INFO ] Invariant cache hit.
[2024-05-22 08:44:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:44:18] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/352 places, 1327/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4405 ms. Remains : 82/352 places, 1327/1779 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-13
Product exploration explored 100000 steps with 1592 reset in 928 ms.
Product exploration explored 100000 steps with 155 reset in 417 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1466 resets) in 840 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 23415 steps (58 resets) in 69 ms. (334 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 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 1327/1327 transitions.
Applied a total of 0 rules in 134 ms. Remains 82 /82 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-22 08:44:20] [INFO ] Invariant cache hit.
[2024-05-22 08:44:21] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-22 08:44:21] [INFO ] Invariant cache hit.
[2024-05-22 08:44:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:44:22] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2024-05-22 08:44:22] [INFO ] Redundant transitions in 87 ms returned [1084]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1318 sub problems to find dead transitions.
// Phase 1: matrix 1326 rows 82 cols
[2024-05-22 08:44:22] [INFO ] Computed 11 invariants in 12 ms
[2024-05-22 08:44:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 2 (OVERLAPS) 6/80 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 80/1408 variables, and 11 constraints, problems are : Problem set: 0 solved, 1318 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/82 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1318/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 2 (OVERLAPS) 6/80 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
SMT process timed out in 85274ms, After SMT, problems are : Problem set: 0 solved, 1318 unsolved
Search for dead transitions found 0 dead transitions in 85304ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/82 places, 1326/1327 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 80 transition count 1324
Applied a total of 2 rules in 149 ms. Remains 80 /82 variables (removed 2) and now considering 1324/1326 (removed 2) transitions.
// Phase 1: matrix 1324 rows 80 cols
[2024-05-22 08:45:48] [INFO ] Computed 11 invariants in 11 ms
[2024-05-22 08:45:48] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-22 08:45:48] [INFO ] Invariant cache hit.
[2024-05-22 08:45:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:45:49] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/82 places, 1324/1327 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89082 ms. Remains : 80/82 places, 1324/1327 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1495 resets) in 868 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 15346 steps (44 resets) in 45 ms. (333 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 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 526 reset in 364 ms.
Product exploration explored 100000 steps with 896 reset in 457 ms.
Support contains 11 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 1324/1324 transitions.
Applied a total of 0 rules in 76 ms. Remains 80 /80 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-22 08:45:51] [INFO ] Invariant cache hit.
[2024-05-22 08:45:51] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-22 08:45:51] [INFO ] Invariant cache hit.
[2024-05-22 08:45:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:45:52] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2024-05-22 08:45:52] [INFO ] Redundant transitions in 82 ms returned []
Running 1317 sub problems to find dead transitions.
[2024-05-22 08:45:52] [INFO ] Invariant cache hit.
[2024-05-22 08:45:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 2 (OVERLAPS) 6/79 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 79/1404 variables, and 11 constraints, problems are : Problem set: 0 solved, 1317 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/80 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1317/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 2 (OVERLAPS) 6/79 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
SMT process timed out in 85286ms, After SMT, problems are : Problem set: 0 solved, 1317 unsolved
Search for dead transitions found 0 dead transitions in 85310ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86845 ms. Remains : 80/80 places, 1324/1324 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-13 finished in 184027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U (F(p3)&&p2)))'
Support contains 21 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 301 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 349 transition count 1648
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 185 rules applied. Total rules applied 314 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 348 place count 187 transition count 1591
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 187 transition count 1585
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 360 place count 181 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 362 place count 179 transition count 1583
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 179 transition count 1583
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 490 place count 116 transition count 1519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 491 place count 116 transition count 1518
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 505 place count 102 transition count 1383
Iterating global reduction 4 with 14 rules applied. Total rules applied 519 place count 102 transition count 1383
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 528 place count 102 transition count 1374
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 5 with 4 rules applied. Total rules applied 532 place count 100 transition count 1372
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 533 place count 99 transition count 1371
Applied a total of 533 rules in 267 ms. Remains 99 /352 variables (removed 253) and now considering 1371/1779 (removed 408) transitions.
// Phase 1: matrix 1371 rows 99 cols
[2024-05-22 08:47:18] [INFO ] Computed 14 invariants in 12 ms
[2024-05-22 08:47:18] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-22 08:47:18] [INFO ] Invariant cache hit.
[2024-05-22 08:47:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:47:20] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned [94, 98]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1370 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/352 places, 1371/1779 transitions.
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 2 place count 96 transition count 1370
Applied a total of 2 rules in 141 ms. Remains 96 /97 variables (removed 1) and now considering 1370/1371 (removed 1) transitions.
// Phase 1: matrix 1370 rows 96 cols
[2024-05-22 08:47:20] [INFO ] Computed 12 invariants in 12 ms
[2024-05-22 08:47:20] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-22 08:47:20] [INFO ] Invariant cache hit.
[2024-05-22 08:47:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:47:21] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/352 places, 1370/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3109 ms. Remains : 96/352 places, 1370/1779 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-14
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-14 finished in 3342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(G(F(p0))||p1))))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 67 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:47:21] [INFO ] Computed 15 invariants in 19 ms
[2024-05-22 08:47:23] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2024-05-22 08:47:23] [INFO ] Invariant cache hit.
[2024-05-22 08:47:25] [INFO ] Implicit Places using invariants and state equation in 1980 ms returned []
Implicit Place search using SMT with State Equation took 3244 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:47:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
[2024-05-22 08:48:23] [INFO ] Deduced a trap composed of 31 places in 1550 ms of which 5 ms to minimize.
SMT process timed out in 58389ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 58412ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61728 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-15
Product exploration explored 100000 steps with 503 reset in 409 ms.
Product exploration explored 100000 steps with 191 reset in 281 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (304 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (43 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 307141 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 307141 steps, saw 56220 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2024-05-22 08:48:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/347 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:48:29] [INFO ] Deduced a trap composed of 31 places in 1291 ms of which 3 ms to minimize.
[2024-05-22 08:48:30] [INFO ] Deduced a trap composed of 32 places in 1325 ms of which 3 ms to minimize.
[2024-05-22 08:48:31] [INFO ] Deduced a trap composed of 31 places in 1309 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1774/2121 variables, 347/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:48:33] [INFO ] Deduced a trap composed of 31 places in 1180 ms of which 7 ms to minimize.
SMT process timed out in 6030ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 183 transition count 1578
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 360 place count 177 transition count 1578
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 524 place count 95 transition count 1496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 95 transition count 1495
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 545 place count 75 transition count 1295
Iterating global reduction 4 with 20 rules applied. Total rules applied 565 place count 75 transition count 1295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 575 place count 75 transition count 1285
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 5 with 2 rules applied. Total rules applied 577 place count 74 transition count 1284
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 588 place count 74 transition count 1273
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 599 place count 63 transition count 1273
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 63 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 62 transition count 1272
Applied a total of 601 rules in 459 ms. Remains 62 /347 variables (removed 285) and now considering 1272/1774 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 62/347 places, 1272/1774 transitions.
RANDOM walk for 40000 steps (132 resets) in 1098 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (139 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 515900 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 515900 steps, saw 73906 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
// Phase 1: matrix 1272 rows 62 cols
[2024-05-22 08:48:37] [INFO ] Computed 15 invariants in 6 ms
[2024-05-22 08:48:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1068ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 77 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 62/62 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 77 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-22 08:48:38] [INFO ] Invariant cache hit.
[2024-05-22 08:48:39] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-22 08:48:39] [INFO ] Invariant cache hit.
[2024-05-22 08:48:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:48:40] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned [57, 61]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1955 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 1271/1272 transitions.
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 2 place count 59 transition count 1270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 1269
Applied a total of 4 rules in 183 ms. Remains 58 /60 variables (removed 2) and now considering 1269/1271 (removed 2) transitions.
// Phase 1: matrix 1269 rows 58 cols
[2024-05-22 08:48:40] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 08:48:41] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-05-22 08:48:41] [INFO ] Invariant cache hit.
[2024-05-22 08:48:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:48:42] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 1269/1272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4177 ms. Remains : 58/62 places, 1269/1272 transitions.
RANDOM walk for 40000 steps (36 resets) in 1144 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (141 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 539453 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 539453 steps, saw 74210 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2024-05-22 08:48:46] [INFO ] Invariant cache hit.
[2024-05-22 08:48:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1117ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 126 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 58/58 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 132 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2024-05-22 08:48:47] [INFO ] Invariant cache hit.
[2024-05-22 08:48:48] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-05-22 08:48:48] [INFO ] Invariant cache hit.
[2024-05-22 08:48:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:48:49] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2024-05-22 08:48:49] [INFO ] Redundant transitions in 80 ms returned []
Running 1267 sub problems to find dead transitions.
[2024-05-22 08:48:49] [INFO ] Invariant cache hit.
[2024-05-22 08:48:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
SMT process timed out in 53647ms, After SMT, problems are : Problem set: 0 solved, 1267 unsolved
Search for dead transitions found 0 dead transitions in 53671ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55768 ms. Remains : 58/58 places, 1269/1269 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1011 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 1268
Applied a total of 2 rules in 110 ms. Remains 57 /58 variables (removed 1) and now considering 1268/1269 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2024-05-22 08:49:43] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 08:49:43] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 08:49:44] [INFO ] After 600ms SMT Verify possible using After timeout in real domain returned unsat :0 sat :1
[2024-05-22 08:49:44] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 811 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 347 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 21 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:49:44] [INFO ] Computed 15 invariants in 12 ms
[2024-05-22 08:49:45] [INFO ] Implicit Places using invariants in 1226 ms returned []
[2024-05-22 08:49:45] [INFO ] Invariant cache hit.
[2024-05-22 08:49:47] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:49:47] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 58318ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 58338ms
Finished structural reductions in LTL mode , in 1 iterations and 61100 ms. Remains : 347/347 places, 1774/1774 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (307 resets) in 315 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (43 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 275636 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 275636 steps, saw 50723 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-22 08:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/347 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:50:51] [INFO ] Deduced a trap composed of 31 places in 1917 ms of which 5 ms to minimize.
[2024-05-22 08:50:52] [INFO ] Deduced a trap composed of 32 places in 1620 ms of which 3 ms to minimize.
[2024-05-22 08:50:54] [INFO ] Deduced a trap composed of 31 places in 1555 ms of which 3 ms to minimize.
SMT process timed out in 5266ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 183 transition count 1578
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 360 place count 177 transition count 1578
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 524 place count 95 transition count 1496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 95 transition count 1495
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 545 place count 75 transition count 1295
Iterating global reduction 4 with 20 rules applied. Total rules applied 565 place count 75 transition count 1295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 575 place count 75 transition count 1285
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 5 with 2 rules applied. Total rules applied 577 place count 74 transition count 1284
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 588 place count 74 transition count 1273
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 599 place count 63 transition count 1273
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 63 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 62 transition count 1272
Applied a total of 601 rules in 591 ms. Remains 62 /347 variables (removed 285) and now considering 1272/1774 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 62/347 places, 1272/1774 transitions.
RANDOM walk for 40000 steps (127 resets) in 933 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (137 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 561565 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 561565 steps, saw 78974 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
// Phase 1: matrix 1272 rows 62 cols
[2024-05-22 08:50:58] [INFO ] Computed 15 invariants in 10 ms
[2024-05-22 08:50:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1303ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 133 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 62/62 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 128 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-22 08:50:59] [INFO ] Invariant cache hit.
[2024-05-22 08:51:00] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-22 08:51:00] [INFO ] Invariant cache hit.
[2024-05-22 08:51:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:51:02] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned [57, 61]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 2310 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 1271/1272 transitions.
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 2 place count 59 transition count 1270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 1269
Applied a total of 4 rules in 282 ms. Remains 58 /60 variables (removed 2) and now considering 1269/1271 (removed 2) transitions.
// Phase 1: matrix 1269 rows 58 cols
[2024-05-22 08:51:02] [INFO ] Computed 13 invariants in 11 ms
[2024-05-22 08:51:03] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-22 08:51:03] [INFO ] Invariant cache hit.
[2024-05-22 08:51:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:51:04] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1782 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 1269/1272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4502 ms. Remains : 58/62 places, 1269/1272 transitions.
RANDOM walk for 40000 steps (34 resets) in 1122 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (138 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 519921 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 519921 steps, saw 71862 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-22 08:51:07] [INFO ] Invariant cache hit.
[2024-05-22 08:51:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1255ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 74 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 58/58 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 76 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2024-05-22 08:51:09] [INFO ] Invariant cache hit.
[2024-05-22 08:51:09] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-22 08:51:09] [INFO ] Invariant cache hit.
[2024-05-22 08:51:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:51:10] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2024-05-22 08:51:10] [INFO ] Redundant transitions in 79 ms returned []
Running 1267 sub problems to find dead transitions.
[2024-05-22 08:51:10] [INFO ] Invariant cache hit.
[2024-05-22 08:51:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/1327 variables, and 13 constraints, problems are : Problem set: 0 solved, 1267 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/58 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1267/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 4 (OVERLAPS) 1269/1327 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
SMT process timed out in 84444ms, After SMT, problems are : Problem set: 0 solved, 1267 unsolved
Search for dead transitions found 0 dead transitions in 84470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86468 ms. Remains : 58/58 places, 1269/1269 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 411 reset in 521 ms.
Product exploration explored 100000 steps with 150 reset in 377 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 345 transition count 1772
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 148 place count 345 transition count 1749
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 148 place count 345 transition count 1749
Deduced a syphon composed of 149 places in 2 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 173 place count 345 transition count 1749
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 280 place count 238 transition count 1642
Deduced a syphon composed of 43 places in 3 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 387 place count 238 transition count 1642
Performed 98 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 485 place count 238 transition count 1655
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 487 place count 238 transition count 1653
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 570 place count 155 transition count 1390
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 3 with 83 rules applied. Total rules applied 653 place count 155 transition count 1390
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 673 place count 155 transition count 1370
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 684 place count 144 transition count 1359
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 695 place count 144 transition count 1359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 696 place count 144 transition count 1359
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 698 place count 142 transition count 1357
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 700 place count 142 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 701 place count 142 transition count 1359
Deduced a syphon composed of 67 places in 1 ms
Applied a total of 701 rules in 489 ms. Remains 142 /347 variables (removed 205) and now considering 1359/1774 (removed 415) transitions.
[2024-05-22 08:52:37] [INFO ] Redundant transitions in 77 ms returned []
Running 1358 sub problems to find dead transitions.
// Phase 1: matrix 1359 rows 142 cols
[2024-05-22 08:52:37] [INFO ] Computed 14 invariants in 13 ms
[2024-05-22 08:52:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1358 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1358 unsolved
[2024-05-22 08:53:18] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-22 08:53:20] [INFO ] Deduced a trap composed of 5 places in 1404 ms of which 2 ms to minimize.
[2024-05-22 08:53:21] [INFO ] Deduced a trap composed of 4 places in 1271 ms of which 2 ms to minimize.
[2024-05-22 08:53:22] [INFO ] Deduced a trap composed of 5 places in 1253 ms of which 4 ms to minimize.
[2024-05-22 08:53:23] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 08:53:24] [INFO ] Deduced a trap composed of 8 places in 1346 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-22 08:53:25] [INFO ] Deduced a trap composed of 14 places in 1270 ms of which 2 ms to minimize.
[2024-05-22 08:53:27] [INFO ] Deduced a trap composed of 14 places in 1163 ms of which 2 ms to minimize.
[2024-05-22 08:53:28] [INFO ] Deduced a trap composed of 14 places in 1088 ms of which 1 ms to minimize.
[2024-05-22 08:53:29] [INFO ] Deduced a trap composed of 14 places in 1011 ms of which 2 ms to minimize.
[2024-05-22 08:53:30] [INFO ] Deduced a trap composed of 12 places in 870 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 142/1501 variables, and 25 constraints, problems are : Problem set: 3 solved, 1355 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/142 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1358/120 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1355 unsolved
At refinement iteration 1 (OVERLAPS) 4/142 variables, 14/14 constraints. Problems are: Problem set: 3 solved, 1355 unsolved
Problem TDEAD1084 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 11/25 constraints. Problems are: Problem set: 19 solved, 1339 unsolved
[2024-05-22 08:53:58] [INFO ] Deduced a trap composed of 6 places in 734 ms of which 2 ms to minimize.
Problem TDEAD1055 is UNSAT
[2024-05-22 08:53:59] [INFO ] Deduced a trap composed of 6 places in 692 ms of which 2 ms to minimize.
Problem TDEAD1056 is UNSAT
[2024-05-22 08:54:00] [INFO ] Deduced a trap composed of 6 places in 744 ms of which 1 ms to minimize.
Problem TDEAD1057 is UNSAT
[2024-05-22 08:54:00] [INFO ] Deduced a trap composed of 6 places in 635 ms of which 2 ms to minimize.
Problem TDEAD1058 is UNSAT
[2024-05-22 08:54:01] [INFO ] Deduced a trap composed of 6 places in 659 ms of which 2 ms to minimize.
Problem TDEAD1059 is UNSAT
[2024-05-22 08:54:02] [INFO ] Deduced a trap composed of 6 places in 726 ms of which 1 ms to minimize.
Problem TDEAD1060 is UNSAT
[2024-05-22 08:54:02] [INFO ] Deduced a trap composed of 6 places in 681 ms of which 2 ms to minimize.
SMT process timed out in 85097ms, After SMT, problems are : Problem set: 19 solved, 1339 unsolved
Search for dead transitions found 25 dead transitions in 85123ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 142/347 places, 1334/1774 transitions.
Graph (complete) has 1122 edges and 142 vertex of which 118 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 0 output transitions
Deduced a syphon composed of 43 places in 1 ms
Applied a total of 1 rules in 167 ms. Remains 118 /142 variables (removed 24) and now considering 1334/1334 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/347 places, 1334/1774 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85875 ms. Remains : 118/347 places, 1334/1774 transitions.
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 19 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:54:03] [INFO ] Computed 15 invariants in 19 ms
[2024-05-22 08:54:04] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2024-05-22 08:54:04] [INFO ] Invariant cache hit.
[2024-05-22 08:54:06] [INFO ] Implicit Places using invariants and state equation in 2206 ms returned []
Implicit Place search using SMT with State Equation took 3378 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:54:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 57330ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 57365ms
Finished structural reductions in LTL mode , in 1 iterations and 60770 ms. Remains : 347/347 places, 1774/1774 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-15 finished in 462450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&(p1||G(p0))))||X(F(p2))))'
Found a Shortening insensitive property : AutonomousCar-PT-10b-LTLFireability-01
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 311 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 186 transition count 1584
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 505 place count 109 transition count 1502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 506 place count 109 transition count 1501
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 518 place count 97 transition count 1386
Iterating global reduction 6 with 12 rules applied. Total rules applied 530 place count 97 transition count 1386
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 537 place count 97 transition count 1379
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 541 place count 95 transition count 1377
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 543 place count 95 transition count 1377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 545 place count 93 transition count 1375
Applied a total of 545 rules in 274 ms. Remains 93 /352 variables (removed 259) and now considering 1375/1779 (removed 404) transitions.
// Phase 1: matrix 1375 rows 93 cols
[2024-05-22 08:55:04] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 08:55:05] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-22 08:55:05] [INFO ] Invariant cache hit.
[2024-05-22 08:55:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:55:05] [INFO ] Implicit Places using invariants and state equation in 796 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1148 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 91/352 places, 1375/1779 transitions.
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 2 place count 90 transition count 1374
Applied a total of 2 rules in 39 ms. Remains 90 /91 variables (removed 1) and now considering 1374/1375 (removed 1) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2024-05-22 08:55:06] [INFO ] Computed 12 invariants in 10 ms
[2024-05-22 08:55:06] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-22 08:55:06] [INFO ] Invariant cache hit.
[2024-05-22 08:55:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:55:07] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/352 places, 1374/1779 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2823 ms. Remains : 90/352 places, 1374/1779 transitions.
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01
Product exploration explored 100000 steps with 2958 reset in 1426 ms.
Product exploration explored 100000 steps with 2923 reset in 1422 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
RANDOM walk for 40000 steps (1443 resets) in 1341 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (106 resets) in 498 ms. (80 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (116 resets) in 486 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (113 resets) in 413 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (113 resets) in 480 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 507 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (115 resets) in 655 ms. (60 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 127960 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 6
Probabilistic random walk after 127960 steps, saw 22419 distinct states, run finished after 3006 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-22 08:55:14] [INFO ] Invariant cache hit.
[2024-05-22 08:55:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1323/1355 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 107/1462 variables, 57/93 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 8/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1462 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1463 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1463 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/1464 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1464 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1464 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1464/1464 variables, and 103 constraints, problems are : Problem set: 1 solved, 5 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1323/1355 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 107/1462 variables, 57/93 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 8/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 08:55:18] [INFO ] Deduced a trap composed of 8 places in 1487 ms of which 2 ms to minimize.
[2024-05-22 08:55:19] [INFO ] Deduced a trap composed of 7 places in 1451 ms of which 2 ms to minimize.
[2024-05-22 08:55:21] [INFO ] Deduced a trap composed of 8 places in 1301 ms of which 1 ms to minimize.
SMT process timed out in 6227ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 312 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 59/90 places, 1283/1374 transitions.
RANDOM walk for 40000 steps (500 resets) in 4681 ms. (8 steps per ms) remains 2/5 properties
BEST_FIRST walk for 8279 steps (6 resets) in 67 ms. (121 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 10 factoid took 356 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 6 out of 90 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 : 90/90 places, 1374/1374 transitions.
Applied a total of 0 rules in 77 ms. Remains 90 /90 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-05-22 08:55:23] [INFO ] Invariant cache hit.
[2024-05-22 08:55:24] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-22 08:55:24] [INFO ] Invariant cache hit.
[2024-05-22 08:55:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:55:25] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
[2024-05-22 08:55:25] [INFO ] Redundant transitions in 59 ms returned [1089]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1366 sub problems to find dead transitions.
// Phase 1: matrix 1373 rows 90 cols
[2024-05-22 08:55:25] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 08:55:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 2 (OVERLAPS) 5/88 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 88/1463 variables, and 12 constraints, problems are : Problem set: 0 solved, 1366 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1366/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 2 (OVERLAPS) 5/88 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 88/1463 variables, and 12 constraints, problems are : Problem set: 0 solved, 1366 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1306/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 86227ms problems are : Problem set: 0 solved, 1366 unsolved
Search for dead transitions found 0 dead transitions in 86244ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/90 places, 1373/1374 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 88 transition count 1371
Applied a total of 2 rules in 155 ms. Remains 88 /90 variables (removed 2) and now considering 1371/1373 (removed 2) transitions.
// Phase 1: matrix 1371 rows 88 cols
[2024-05-22 08:56:51] [INFO ] Computed 12 invariants in 12 ms
[2024-05-22 08:56:52] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-22 08:56:52] [INFO ] Invariant cache hit.
[2024-05-22 08:56:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:56:53] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/90 places, 1371/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89832 ms. Remains : 88/90 places, 1371/1374 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 211 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), false, false]
RANDOM walk for 40000 steps (1494 resets) in 4538 ms. (8 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (111 resets) in 433 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 514 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (115 resets) in 548 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 510 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (117 resets) in 474 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (121 resets) in 454 ms. (87 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 286828 steps, run timeout after 6001 ms. (steps per millisecond=47 ) properties seen :0 out of 6
Probabilistic random walk after 286828 steps, saw 51039 distinct states, run finished after 6006 ms. (steps per millisecond=47 ) properties seen :0
[2024-05-22 08:57:02] [INFO ] Invariant cache hit.
[2024-05-22 08:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1325/1357 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 101/1458 variables, 56/92 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1458 variables, 8/100 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1458 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1459 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1459 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1459 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1459/1459 variables, and 101 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1325/1357 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 101/1458 variables, 56/92 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1458 variables, 8/100 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 08:57:06] [INFO ] Deduced a trap composed of 7 places in 1532 ms of which 2 ms to minimize.
[2024-05-22 08:57:07] [INFO ] Deduced a trap composed of 8 places in 1367 ms of which 2 ms to minimize.
[2024-05-22 08:57:08] [INFO ] Deduced a trap composed of 7 places in 1380 ms of which 2 ms to minimize.
SMT process timed out in 6472ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 1371/1371 transitions.
Graph (complete) has 1143 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 1369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 1368
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 1368
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 1362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 74 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 74 transition count 1296
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 70 transition count 1292
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 70 transition count 1280
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 60 place count 58 transition count 1280
Applied a total of 60 rules in 381 ms. Remains 58 /88 variables (removed 30) and now considering 1280/1371 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 58/88 places, 1280/1371 transitions.
RANDOM walk for 40000 steps (459 resets) in 3559 ms. (11 steps per ms) remains 2/5 properties
BEST_FIRST walk for 9750 steps (6 resets) in 48 ms. (198 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 14 factoid took 410 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 877 reset in 610 ms.
Product exploration explored 100000 steps with 2012 reset in 813 ms.
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 1371/1371 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 88 transition count 1370
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 87 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 81 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 75 transition count 1298
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 75 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 71 transition count 1294
Applied a total of 34 rules in 177 ms. Remains 71 /88 variables (removed 17) and now considering 1294/1371 (removed 77) transitions.
// Phase 1: matrix 1294 rows 71 cols
[2024-05-22 08:57:13] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 08:57:13] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-05-22 08:57:13] [INFO ] Invariant cache hit.
[2024-05-22 08:57:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:57:15] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
[2024-05-22 08:57:15] [INFO ] Redundant transitions in 89 ms returned []
Running 1292 sub problems to find dead transitions.
[2024-05-22 08:57:15] [INFO ] Invariant cache hit.
[2024-05-22 08:57:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
SMT process timed out in 54773ms, After SMT, problems are : Problem set: 0 solved, 1292 unsolved
Search for dead transitions found 0 dead transitions in 54803ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/88 places, 1294/1371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57301 ms. Remains : 71/88 places, 1294/1371 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-01 finished in 186281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1&&F(p2)))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0||F(G((p1 U !p2)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(G(F(p0))||p1))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-10b-LTLFireability-15
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 332 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 186 transition count 1584
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 78 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 529 place count 97 transition count 1490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 530 place count 97 transition count 1489
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 548 place count 79 transition count 1310
Iterating global reduction 6 with 18 rules applied. Total rules applied 566 place count 79 transition count 1310
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 575 place count 79 transition count 1301
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 579 place count 77 transition count 1299
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 581 place count 75 transition count 1297
Applied a total of 581 rules in 232 ms. Remains 75 /352 variables (removed 277) and now considering 1297/1779 (removed 482) transitions.
// Phase 1: matrix 1297 rows 75 cols
[2024-05-22 08:58:11] [INFO ] Computed 14 invariants in 7 ms
[2024-05-22 08:58:12] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-22 08:58:12] [INFO ] Invariant cache hit.
[2024-05-22 08:58:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:58:13] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned [70, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1935 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 73/352 places, 1297/1779 transitions.
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 2 place count 72 transition count 1296
Applied a total of 2 rules in 48 ms. Remains 72 /73 variables (removed 1) and now considering 1296/1297 (removed 1) transitions.
// Phase 1: matrix 1296 rows 72 cols
[2024-05-22 08:58:13] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 08:58:14] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-22 08:58:14] [INFO ] Invariant cache hit.
[2024-05-22 08:58:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:58:15] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 72/352 places, 1296/1779 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4153 ms. Remains : 72/352 places, 1296/1779 transitions.
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-15
Product exploration explored 100000 steps with 545 reset in 220 ms.
Product exploration explored 100000 steps with 631 reset in 243 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1977 resets) in 531 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (118 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 447548 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 447548 steps, saw 75371 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-22 08:58:19] [INFO ] Invariant cache hit.
[2024-05-22 08:58:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1253/1274 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1274 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1366 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1367 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1368/1368 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1253/1274 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1274 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1366 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1367 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1368/1368 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1173ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Graph (complete) has 1052 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1282
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1282
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 16 place count 70 transition count 1271
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 27 place count 59 transition count 1271
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 59 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 58 transition count 1272
Applied a total of 29 rules in 272 ms. Remains 58 /72 variables (removed 14) and now considering 1272/1296 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 58/72 places, 1272/1296 transitions.
RANDOM walk for 33705 steps (170 resets) in 717 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 72 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Applied a total of 0 rules in 8 ms. Remains 72 /72 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2024-05-22 08:58:21] [INFO ] Invariant cache hit.
[2024-05-22 08:58:22] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-05-22 08:58:22] [INFO ] Invariant cache hit.
[2024-05-22 08:58:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:58:23] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
Running 1293 sub problems to find dead transitions.
[2024-05-22 08:58:23] [INFO ] Invariant cache hit.
[2024-05-22 08:58:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
SMT process timed out in 55011ms, After SMT, problems are : Problem set: 0 solved, 1293 unsolved
Search for dead transitions found 0 dead transitions in 55027ms
Finished structural reductions in LTL mode , in 1 iterations and 56884 ms. Remains : 72/72 places, 1296/1296 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1962 resets) in 507 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (114 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 449926 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 449926 steps, saw 75772 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-22 08:59:21] [INFO ] Invariant cache hit.
[2024-05-22 08:59:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1253/1274 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1274 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1366 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1367 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1368/1368 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1253/1274 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1274 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1366 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1367 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1368/1368 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1205ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Graph (complete) has 1052 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1282
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1282
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 16 place count 70 transition count 1271
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 27 place count 59 transition count 1271
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 59 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 58 transition count 1272
Applied a total of 29 rules in 286 ms. Remains 58 /72 variables (removed 14) and now considering 1272/1296 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 58/72 places, 1272/1296 transitions.
RANDOM walk for 40000 steps (171 resets) in 859 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (138 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 537809 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 537809 steps, saw 73276 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 1272 rows 58 cols
[2024-05-22 08:59:26] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 08:59:26] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1245/1264 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1264 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1264 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 66/1330 variables, 39/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1330 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1330 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1245/1264 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1264 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1264 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 66/1330 variables, 39/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1330 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1330 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1090ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 85 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 58/58 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-22 08:59:27] [INFO ] Invariant cache hit.
[2024-05-22 08:59:28] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-05-22 08:59:28] [INFO ] Invariant cache hit.
[2024-05-22 08:59:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:59:29] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2024-05-22 08:59:29] [INFO ] Redundant transitions in 58 ms returned []
Running 1270 sub problems to find dead transitions.
[2024-05-22 08:59:29] [INFO ] Invariant cache hit.
[2024-05-22 08:59:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
At refinement iteration 4 (OVERLAPS) 1272/1330 variables, 58/70 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 2/72 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 72 constraints, problems are : Problem set: 2 solved, 1268 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1270/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 4 (OVERLAPS) 1272/1330 variables, 58/70 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 2/72 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1330 variables, 31/103 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 103 constraints, problems are : Problem set: 2 solved, 1268 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1268/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 84691ms problems are : Problem set: 2 solved, 1268 unsolved
Search for dead transitions found 2 dead transitions in 84710ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/58 places, 1270/1272 transitions.
Applied a total of 0 rules in 78 ms. Remains 58 /58 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-22 09:00:54] [INFO ] Redundant transitions in 40 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 86788 ms. Remains : 58/58 places, 1270/1272 transitions.
RANDOM walk for 40000 steps (176 resets) in 1093 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (139 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 550456 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 550456 steps, saw 74851 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
// Phase 1: matrix 1270 rows 58 cols
[2024-05-22 09:00:57] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 09:00:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1265 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1265 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/1328 variables, 36/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1328 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1328/1328 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1265 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1265 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/1328 variables, 36/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1328 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1328/1328 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1065ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1270/1270 transitions.
Applied a total of 0 rules in 78 ms. Remains 58 /58 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 58/58 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1270/1270 transitions.
Applied a total of 0 rules in 77 ms. Remains 58 /58 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-22 09:00:59] [INFO ] Invariant cache hit.
[2024-05-22 09:00:59] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-05-22 09:00:59] [INFO ] Invariant cache hit.
[2024-05-22 09:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:01:01] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2024-05-22 09:01:01] [INFO ] Redundant transitions in 41 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-22 09:01:01] [INFO ] Invariant cache hit.
[2024-05-22 09:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 5 (OVERLAPS) 1270/1328 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1328 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1328/1328 variables, and 72 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1268/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 5 (OVERLAPS) 1270/1328 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1328 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1328 variables, 31/103 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1328/1328 variables, and 103 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1268/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 84354ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 84369ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86316 ms. Remains : 58/58 places, 1270/1270 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 232 reset in 141 ms.
Product exploration explored 100000 steps with 1086 reset in 344 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 71 transition count 1285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 1285
Applied a total of 2 rules in 123 ms. Remains 71 /72 variables (removed 1) and now considering 1285/1296 (removed 11) transitions.
[2024-05-22 09:02:26] [INFO ] Redundant transitions in 54 ms returned [1072]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1281 sub problems to find dead transitions.
// Phase 1: matrix 1284 rows 71 cols
[2024-05-22 09:02:26] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 09:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 4 (OVERLAPS) 1283/1353 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1353/1355 variables, and 82 constraints, problems are : Problem set: 0 solved, 1281 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/71 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1281/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 4 (OVERLAPS) 1283/1353 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1353 variables, 46/128 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1353/1355 variables, and 128 constraints, problems are : Problem set: 0 solved, 1281 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/71 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1281/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 85003ms problems are : Problem set: 0 solved, 1281 unsolved
Search for dead transitions found 0 dead transitions in 85019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/72 places, 1284/1296 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 71 transition count 1286
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 125 ms. Remains 71 /71 variables (removed 0) and now considering 1286/1284 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/72 places, 1286/1296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85348 ms. Remains : 71/72 places, 1286/1296 transitions.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 71 transition count 1285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 1285
Applied a total of 2 rules in 15 ms. Remains 71 /72 variables (removed 1) and now considering 1285/1296 (removed 11) transitions.
// Phase 1: matrix 1285 rows 71 cols
[2024-05-22 09:03:52] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 09:03:52] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-05-22 09:03:52] [INFO ] Invariant cache hit.
[2024-05-22 09:03:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:03:53] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
Running 1282 sub problems to find dead transitions.
[2024-05-22 09:03:53] [INFO ] Invariant cache hit.
[2024-05-22 09:03:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
SMT process timed out in 55188ms, After SMT, problems are : Problem set: 0 solved, 1282 unsolved
Search for dead transitions found 0 dead transitions in 55205ms
Starting structural reductions in LTL mode, iteration 1 : 71/72 places, 1285/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57059 ms. Remains : 71/72 places, 1285/1296 transitions.
Treatment of property AutonomousCar-PT-10b-LTLFireability-15 finished in 398095 ms.
[2024-05-22 09:04:49] [INFO ] Flatten gal took : 250 ms
[2024-05-22 09:04:49] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-05-22 09:04:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 352 places, 1779 transitions and 26470 arcs took 77 ms.
Total runtime 2942356 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running AutonomousCar-PT-10b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 352
TRANSITIONS: 1779
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.175s, Sys 0.008s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.016s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 3568
MODEL NAME: /home/mcc/execution/414/model
352 places, 1779 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-10b-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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="AutonomousCar-PT-10b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-10b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166500372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10b.tgz
mv AutonomousCar-PT-10b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;