About the Execution of GreatSPN+red for AutonomousCar-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6344.600 | 1224408.00 | 1787363.00 | 3811.10 | FT?FFFFFFTFTFFFF | 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-171620166300308.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-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166300308
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 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 228K 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-06b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716349201136
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-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:40:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 03:40:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:40:04] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2024-05-22 03:40:04] [INFO ] Transformed 289 places.
[2024-05-22 03:40:04] [INFO ] Transformed 644 transitions.
[2024-05-22 03:40:04] [INFO ] Found NUPN structural information;
[2024-05-22 03:40:04] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-06b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 248 transition count 603
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 248 transition count 603
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 226 place count 248 transition count 459
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 234 place count 240 transition count 451
Iterating global reduction 1 with 8 rules applied. Total rules applied 242 place count 240 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 243 place count 239 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 239 transition count 450
Applied a total of 244 rules in 202 ms. Remains 239 /289 variables (removed 50) and now considering 450/644 (removed 194) transitions.
// Phase 1: matrix 450 rows 239 cols
[2024-05-22 03:40:04] [INFO ] Computed 11 invariants in 53 ms
[2024-05-22 03:40:05] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-22 03:40:05] [INFO ] Invariant cache hit.
[2024-05-22 03:40:05] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-05-22 03:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-22 03:40:15] [INFO ] Deduced a trap composed of 18 places in 348 ms of which 51 ms to minimize.
[2024-05-22 03:40:16] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 4 ms to minimize.
[2024-05-22 03:40:16] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 5 ms to minimize.
[2024-05-22 03:40:16] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2024-05-22 03:40:16] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 2 ms to minimize.
[2024-05-22 03:40:16] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2024-05-22 03:40:17] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-22 03:40:17] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 3 ms to minimize.
[2024-05-22 03:40:17] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 3 ms to minimize.
[2024-05-22 03:40:17] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 3 ms to minimize.
[2024-05-22 03:40:18] [INFO ] Deduced a trap composed of 49 places in 277 ms of which 4 ms to minimize.
[2024-05-22 03:40:18] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 3 ms to minimize.
[2024-05-22 03:40:18] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 4 ms to minimize.
[2024-05-22 03:40:19] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 4 ms to minimize.
[2024-05-22 03:40:19] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 3 ms to minimize.
[2024-05-22 03:40:19] [INFO ] Deduced a trap composed of 32 places in 330 ms of which 4 ms to minimize.
[2024-05-22 03:40:20] [INFO ] Deduced a trap composed of 53 places in 312 ms of which 4 ms to minimize.
[2024-05-22 03:40:20] [INFO ] Deduced a trap composed of 62 places in 286 ms of which 3 ms to minimize.
[2024-05-22 03:40:20] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 3 ms to minimize.
[2024-05-22 03:40:21] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-22 03:40:21] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 4 ms to minimize.
[2024-05-22 03:40:21] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 2 ms to minimize.
[2024-05-22 03:40:22] [INFO ] Deduced a trap composed of 44 places in 308 ms of which 4 ms to minimize.
[2024-05-22 03:40:22] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 2 ms to minimize.
[2024-05-22 03:40:22] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 2 ms to minimize.
[2024-05-22 03:40:23] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 3 ms to minimize.
[2024-05-22 03:40:23] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 4 ms to minimize.
[2024-05-22 03:40:23] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 4 ms to minimize.
[2024-05-22 03:40:24] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 3 ms to minimize.
[2024-05-22 03:40:24] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 4 ms to minimize.
[2024-05-22 03:40:24] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-05-22 03:40:25] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 3 ms to minimize.
[2024-05-22 03:40:25] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2024-05-22 03:40:25] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 4 ms to minimize.
[2024-05-22 03:40:25] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-22 03:40:25] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-05-22 03:40:25] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-05-22 03:40:26] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:40:26] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 4 ms to minimize.
[2024-05-22 03:40:26] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-22 03:40:30] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 5 ms to minimize.
[2024-05-22 03:40:31] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 4 ms to minimize.
[2024-05-22 03:40:31] [INFO ] Deduced a trap composed of 40 places in 270 ms of which 4 ms to minimize.
[2024-05-22 03:40:31] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 5 ms to minimize.
[2024-05-22 03:40:32] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 3 ms to minimize.
[2024-05-22 03:40:32] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 4 ms to minimize.
[2024-05-22 03:40:32] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 3 ms to minimize.
[2024-05-22 03:40:33] [INFO ] Deduced a trap composed of 60 places in 259 ms of which 4 ms to minimize.
[2024-05-22 03:40:33] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:40:34] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 4 ms to minimize.
[2024-05-22 03:40:34] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 4 ms to minimize.
[2024-05-22 03:40:34] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 4 ms to minimize.
[2024-05-22 03:40:35] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 4 ms to minimize.
[2024-05-22 03:40:35] [INFO ] Deduced a trap composed of 47 places in 260 ms of which 4 ms to minimize.
[2024-05-22 03:40:35] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-05-22 03:40:36] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2024-05-22 03:40:36] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
[2024-05-22 03:40:36] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-05-22 03:40:36] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 2 ms to minimize.
[2024-05-22 03:40:36] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 239/689 variables, and 71 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/239 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-22 03:40:42] [INFO ] Deduced a trap composed of 46 places in 302 ms of which 4 ms to minimize.
[2024-05-22 03:40:43] [INFO ] Deduced a trap composed of 33 places in 330 ms of which 4 ms to minimize.
[2024-05-22 03:40:43] [INFO ] Deduced a trap composed of 38 places in 323 ms of which 4 ms to minimize.
[2024-05-22 03:40:44] [INFO ] Deduced a trap composed of 52 places in 330 ms of which 4 ms to minimize.
[2024-05-22 03:40:44] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 2 ms to minimize.
[2024-05-22 03:40:44] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 4 ms to minimize.
[2024-05-22 03:40:45] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 3 ms to minimize.
[2024-05-22 03:40:45] [INFO ] Deduced a trap composed of 52 places in 316 ms of which 4 ms to minimize.
[2024-05-22 03:40:46] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 3 ms to minimize.
[2024-05-22 03:40:46] [INFO ] Deduced a trap composed of 35 places in 319 ms of which 6 ms to minimize.
[2024-05-22 03:40:46] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2024-05-22 03:40:47] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 2 ms to minimize.
[2024-05-22 03:40:47] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
[2024-05-22 03:40:47] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2024-05-22 03:40:47] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 2 ms to minimize.
[2024-05-22 03:40:48] [INFO ] Deduced a trap composed of 31 places in 279 ms of which 4 ms to minimize.
[2024-05-22 03:40:48] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-22 03:40:48] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-22 03:40:48] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-05-22 03:40:49] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-22 03:40:50] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
[2024-05-22 03:40:52] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-05-22 03:40:52] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 4 ms to minimize.
[2024-05-22 03:40:52] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 6 (OVERLAPS) 450/689 variables, 239/334 constraints. Problems are: Problem set: 2 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 447/781 constraints. Problems are: Problem set: 2 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 781 constraints, problems are : Problem set: 2 solved, 447 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 447/449 constraints, Known Traps: 84/84 constraints]
After SMT, in 61634ms problems are : Problem set: 2 solved, 447 unsolved
Search for dead transitions found 2 dead transitions in 61696ms
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 LTL mode, iteration 1 : 239/289 places, 448/644 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 448
Applied a total of 1 rules in 12 ms. Remains 238 /239 variables (removed 1) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 238 cols
[2024-05-22 03:41:07] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 03:41:07] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 03:41:07] [INFO ] Invariant cache hit.
[2024-05-22 03:41:07] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 238/289 places, 448/644 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63330 ms. Remains : 238/289 places, 448/644 transitions.
Support contains 41 out of 238 places after structural reductions.
[2024-05-22 03:41:08] [INFO ] Flatten gal took : 152 ms
[2024-05-22 03:41:08] [INFO ] Flatten gal took : 88 ms
[2024-05-22 03:41:08] [INFO ] Input system was already deterministic with 448 transitions.
Support contains 40 out of 238 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (227 resets) in 3229 ms. (12 steps per ms) remains 8/26 properties
BEST_FIRST walk for 40003 steps (65 resets) in 501 ms. (79 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (68 resets) in 149 ms. (266 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (76 resets) in 92 ms. (430 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (68 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
[2024-05-22 03:41:10] [INFO ] Invariant cache hit.
Problem AtomicPropp22 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 201/206 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/238 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 448/686 variables, 238/249 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 03:41:10] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 2 ms to minimize.
[2024-05-22 03:41:10] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 3 ms to minimize.
[2024-05-22 03:41:10] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 2 ms to minimize.
[2024-05-22 03:41:11] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 4/253 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 0/253 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/686 variables, 0/253 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 253 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/75 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 163/238 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 03:41:11] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 448/686 variables, 238/254 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/686 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 03:41:11] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/686 variables, 1/256 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/686 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 686/686 variables, and 256 constraints, problems are : Problem set: 1 solved, 1 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 2086ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 448/448 transitions.
Graph (trivial) has 224 edges and 238 vertex of which 4 / 238 are part of one of the 2 SCC in 7 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 870 edges and 236 vertex of which 234 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 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 234 transition count 352
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 128 rules applied. Total rules applied 222 place count 144 transition count 314
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 244 place count 122 transition count 314
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 244 place count 122 transition count 308
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 256 place count 116 transition count 308
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 259 place count 113 transition count 305
Iterating global reduction 3 with 3 rules applied. Total rules applied 262 place count 113 transition count 305
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 364 place count 62 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 62 transition count 253
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 377 place count 50 transition count 180
Iterating global reduction 4 with 12 rules applied. Total rules applied 389 place count 50 transition count 180
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 394 place count 50 transition count 175
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 396 place count 49 transition count 174
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 403 place count 49 transition count 167
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 410 place count 42 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 411 place count 41 transition count 166
Applied a total of 411 rules in 231 ms. Remains 41 /238 variables (removed 197) and now considering 166/448 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 41/238 places, 166/448 transitions.
RANDOM walk for 15011 steps (249 resets) in 145 ms. (102 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 39 stabilizing places and 39 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(X((G(!p0) U (p1||F((G(F(!p2))||(!p3&&F(!p2)))))))))'
Support contains 12 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 234 transition count 444
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 234 transition count 444
Applied a total of 8 rules in 18 ms. Remains 234 /238 variables (removed 4) and now considering 444/448 (removed 4) transitions.
// Phase 1: matrix 444 rows 234 cols
[2024-05-22 03:41:13] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 03:41:13] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 03:41:13] [INFO ] Invariant cache hit.
[2024-05-22 03:41:13] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2024-05-22 03:41:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:41:21] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 4 ms to minimize.
[2024-05-22 03:41:22] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 3 ms to minimize.
[2024-05-22 03:41:22] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 4 ms to minimize.
[2024-05-22 03:41:22] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-22 03:41:23] [INFO ] Deduced a trap composed of 38 places in 295 ms of which 4 ms to minimize.
[2024-05-22 03:41:23] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 4 ms to minimize.
[2024-05-22 03:41:23] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 2 ms to minimize.
[2024-05-22 03:41:23] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 4 ms to minimize.
[2024-05-22 03:41:24] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 4 ms to minimize.
[2024-05-22 03:41:24] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2024-05-22 03:41:24] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 2 ms to minimize.
[2024-05-22 03:41:24] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2024-05-22 03:41:24] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-05-22 03:41:25] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 5 ms to minimize.
[2024-05-22 03:41:25] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-22 03:41:25] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 2 ms to minimize.
[2024-05-22 03:41:25] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-05-22 03:41:25] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-05-22 03:41:26] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:41:26] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:41:27] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 4 ms to minimize.
[2024-05-22 03:41:27] [INFO ] Deduced a trap composed of 31 places in 279 ms of which 4 ms to minimize.
[2024-05-22 03:41:28] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 4 ms to minimize.
[2024-05-22 03:41:28] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 3 ms to minimize.
[2024-05-22 03:41:28] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 3 ms to minimize.
[2024-05-22 03:41:29] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 3 ms to minimize.
[2024-05-22 03:41:29] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 3 ms to minimize.
[2024-05-22 03:41:29] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-05-22 03:41:29] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 3 ms to minimize.
[2024-05-22 03:41:30] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 4 ms to minimize.
[2024-05-22 03:41:30] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-22 03:41:30] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 3 ms to minimize.
[2024-05-22 03:41:31] [INFO ] Deduced a trap composed of 43 places in 280 ms of which 3 ms to minimize.
[2024-05-22 03:41:31] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-05-22 03:41:31] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-05-22 03:41:32] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 3 ms to minimize.
[2024-05-22 03:41:32] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 3 ms to minimize.
[2024-05-22 03:41:32] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 3 ms to minimize.
[2024-05-22 03:41:32] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-05-22 03:41:32] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:41:35] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2024-05-22 03:41:36] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 2 ms to minimize.
[2024-05-22 03:41:37] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 3 ms to minimize.
[2024-05-22 03:41:37] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2024-05-22 03:41:37] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-05-22 03:41:38] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-22 03:41:38] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2024-05-22 03:41:38] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-05-22 03:41:38] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 3 ms to minimize.
[2024-05-22 03:41:38] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-22 03:41:38] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-22 03:41:39] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2024-05-22 03:41:39] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 4 ms to minimize.
[2024-05-22 03:41:39] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2024-05-22 03:41:40] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-05-22 03:41:40] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2024-05-22 03:41:40] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 3 ms to minimize.
[2024-05-22 03:41:41] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:41:44] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/678 variables, and 70 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:41:50] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 4 ms to minimize.
[2024-05-22 03:41:50] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 4 ms to minimize.
[2024-05-22 03:41:50] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2024-05-22 03:41:52] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:41:57] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-05-22 03:41:57] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (OVERLAPS) 444/678 variables, 234/310 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 443/753 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:42:13] [INFO ] Deduced a trap composed of 57 places in 201 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/678 variables, and 754 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 66/66 constraints]
After SMT, in 61338ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 61349ms
Starting structural reductions in LTL mode, iteration 1 : 234/238 places, 444/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61955 ms. Remains : 234/238 places, 444/448 transitions.
Stuttering acceptance computed with spot in 784 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND p0 p2), (AND (NOT p1) p2), (AND p2 p0), p2]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 587 ms.
Product exploration explored 100000 steps with 33333 reset in 280 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p3 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 31 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-01 finished in 63815 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 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Graph (trivial) has 224 edges and 238 vertex of which 4 / 238 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 235 transition count 359
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 119 rules applied. Total rules applied 206 place count 149 transition count 326
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 226 place count 130 transition count 325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 129 transition count 325
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 227 place count 129 transition count 317
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 243 place count 121 transition count 317
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 247 place count 117 transition count 313
Iterating global reduction 4 with 4 rules applied. Total rules applied 251 place count 117 transition count 313
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 355 place count 65 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 356 place count 65 transition count 259
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 369 place count 52 transition count 180
Iterating global reduction 5 with 13 rules applied. Total rules applied 382 place count 52 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 388 place count 52 transition count 174
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 6 with 4 rules applied. Total rules applied 392 place count 50 transition count 172
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 394 place count 48 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 395 place count 47 transition count 170
Applied a total of 395 rules in 112 ms. Remains 47 /238 variables (removed 191) and now considering 170/448 (removed 278) transitions.
// Phase 1: matrix 170 rows 47 cols
[2024-05-22 03:42:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 03:42:17] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 03:42:17] [INFO ] Invariant cache hit.
[2024-05-22 03:42:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:42:17] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [43, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 375 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/238 places, 170/448 transitions.
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 4 place count 43 transition count 168
Applied a total of 4 rules in 11 ms. Remains 43 /45 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 43 cols
[2024-05-22 03:42:17] [INFO ] Computed 7 invariants in 1 ms
[2024-05-22 03:42:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 03:42:17] [INFO ] Invariant cache hit.
[2024-05-22 03:42:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:42:17] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/238 places, 168/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 805 ms. Remains : 43/238 places, 168/448 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-02
Product exploration explored 100000 steps with 22 reset in 375 ms.
Product exploration explored 100000 steps with 9 reset in 206 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 131 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 52 ms :[(NOT p0)]
RANDOM walk for 127 steps (8 resets) in 7 ms. (15 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 32 ms :[(NOT p0)]
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-22 03:42:18] [INFO ] Invariant cache hit.
[2024-05-22 03:42:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-22 03:42:18] [INFO ] Invariant cache hit.
[2024-05-22 03:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:42:18] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-22 03:42:18] [INFO ] Redundant transitions in 19 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-22 03:42:18] [INFO ] Invariant cache hit.
[2024-05-22 03:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 167/210 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-22 03:42:20] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 1/211 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 52 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5306 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 167/210 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 167/218 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 1/211 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 219 constraints, problems are : Problem set: 0 solved, 167 unsolved in 13965 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 1/1 constraints]
After SMT, in 19839ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 19841ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20093 ms. Remains : 43/43 places, 168/168 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 111 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 51 ms :[(NOT p0)]
RANDOM walk for 280 steps (13 resets) in 6 ms. (40 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 136 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 70 reset in 102 ms.
Product exploration explored 100000 steps with 182 reset in 219 ms.
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 168/168 transitions.
Applied a total of 0 rules in 10 ms. Remains 43 /43 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-22 03:42:39] [INFO ] Invariant cache hit.
[2024-05-22 03:42:39] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 03:42:39] [INFO ] Invariant cache hit.
[2024-05-22 03:42:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:42:39] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-22 03:42:39] [INFO ] Redundant transitions in 25 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-22 03:42:39] [INFO ] Invariant cache hit.
[2024-05-22 03:42:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 167/210 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-22 03:42:42] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 1/211 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 52 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6597 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 167/210 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 167/218 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 1/211 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 219 constraints, problems are : Problem set: 0 solved, 167 unsolved in 14111 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 1/1 constraints]
After SMT, in 21335ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 21338ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21700 ms. Remains : 43/43 places, 168/168 transitions.
Treatment of property AutonomousCar-PT-06b-LTLFireability-02 finished in 44582 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((X(p0)&&(p1 U G(!p1)))))'
Support contains 5 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 235 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 235 transition count 445
Applied a total of 6 rules in 7 ms. Remains 235 /238 variables (removed 3) and now considering 445/448 (removed 3) transitions.
// Phase 1: matrix 445 rows 235 cols
[2024-05-22 03:43:01] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 03:43:01] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-22 03:43:01] [INFO ] Invariant cache hit.
[2024-05-22 03:43:01] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2024-05-22 03:43:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:43:09] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 4 ms to minimize.
[2024-05-22 03:43:09] [INFO ] Deduced a trap composed of 50 places in 332 ms of which 4 ms to minimize.
[2024-05-22 03:43:09] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 4 ms to minimize.
[2024-05-22 03:43:09] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:43:10] [INFO ] Deduced a trap composed of 55 places in 241 ms of which 3 ms to minimize.
[2024-05-22 03:43:10] [INFO ] Deduced a trap composed of 36 places in 312 ms of which 4 ms to minimize.
[2024-05-22 03:43:10] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 4 ms to minimize.
[2024-05-22 03:43:11] [INFO ] Deduced a trap composed of 53 places in 290 ms of which 4 ms to minimize.
[2024-05-22 03:43:11] [INFO ] Deduced a trap composed of 52 places in 266 ms of which 4 ms to minimize.
[2024-05-22 03:43:11] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 3 ms to minimize.
[2024-05-22 03:43:11] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 3 ms to minimize.
[2024-05-22 03:43:12] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 2 ms to minimize.
[2024-05-22 03:43:12] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 4 ms to minimize.
[2024-05-22 03:43:12] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 3 ms to minimize.
[2024-05-22 03:43:12] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 3 ms to minimize.
[2024-05-22 03:43:13] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 2 ms to minimize.
[2024-05-22 03:43:13] [INFO ] Deduced a trap composed of 67 places in 315 ms of which 4 ms to minimize.
[2024-05-22 03:43:13] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 2 ms to minimize.
[2024-05-22 03:43:14] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 4 ms to minimize.
[2024-05-22 03:43:14] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:43:15] [INFO ] Deduced a trap composed of 51 places in 327 ms of which 4 ms to minimize.
[2024-05-22 03:43:15] [INFO ] Deduced a trap composed of 41 places in 300 ms of which 3 ms to minimize.
[2024-05-22 03:43:15] [INFO ] Deduced a trap composed of 34 places in 293 ms of which 4 ms to minimize.
[2024-05-22 03:43:16] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 4 ms to minimize.
[2024-05-22 03:43:16] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 3 ms to minimize.
[2024-05-22 03:43:16] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 2 ms to minimize.
[2024-05-22 03:43:16] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 4 ms to minimize.
[2024-05-22 03:43:17] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2024-05-22 03:43:17] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2024-05-22 03:43:17] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 4 ms to minimize.
[2024-05-22 03:43:18] [INFO ] Deduced a trap composed of 14 places in 293 ms of which 3 ms to minimize.
[2024-05-22 03:43:18] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 4 ms to minimize.
[2024-05-22 03:43:19] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 4 ms to minimize.
[2024-05-22 03:43:19] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-05-22 03:43:19] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 4 ms to minimize.
[2024-05-22 03:43:20] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 4 ms to minimize.
[2024-05-22 03:43:20] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 4 ms to minimize.
[2024-05-22 03:43:20] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 4 ms to minimize.
[2024-05-22 03:43:21] [INFO ] Deduced a trap composed of 58 places in 290 ms of which 4 ms to minimize.
[2024-05-22 03:43:21] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:43:25] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2024-05-22 03:43:26] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 4 ms to minimize.
[2024-05-22 03:43:26] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 3 ms to minimize.
[2024-05-22 03:43:27] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2024-05-22 03:43:27] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 3 ms to minimize.
[2024-05-22 03:43:27] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 4 ms to minimize.
[2024-05-22 03:43:28] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 6 ms to minimize.
[2024-05-22 03:43:28] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-05-22 03:43:28] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2024-05-22 03:43:28] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
[2024-05-22 03:43:29] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-05-22 03:43:29] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-05-22 03:43:29] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 2 ms to minimize.
[2024-05-22 03:43:30] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 3 ms to minimize.
[2024-05-22 03:43:30] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2024-05-22 03:43:30] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2024-05-22 03:43:30] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-05-22 03:43:31] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-05-22 03:43:31] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-05-22 03:43:31] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:43:32] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/680 variables, and 72 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:43:37] [INFO ] Deduced a trap composed of 43 places in 279 ms of which 4 ms to minimize.
[2024-05-22 03:43:37] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 2 ms to minimize.
[2024-05-22 03:43:38] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-22 03:43:38] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-05-22 03:43:38] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-05-22 03:43:38] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-22 03:43:39] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
[2024-05-22 03:43:39] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-22 03:43:40] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 3 ms to minimize.
[2024-05-22 03:43:41] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 3 ms to minimize.
[2024-05-22 03:43:41] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 3 ms to minimize.
[2024-05-22 03:43:41] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 4 ms to minimize.
[2024-05-22 03:43:41] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 4 ms to minimize.
[2024-05-22 03:43:42] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 3 ms to minimize.
[2024-05-22 03:43:42] [INFO ] Deduced a trap composed of 32 places in 281 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/87 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:43:45] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 4 ms to minimize.
[2024-05-22 03:43:45] [INFO ] Deduced a trap composed of 60 places in 296 ms of which 3 ms to minimize.
[2024-05-22 03:43:46] [INFO ] Deduced a trap composed of 40 places in 300 ms of which 3 ms to minimize.
[2024-05-22 03:43:47] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 3 ms to minimize.
[2024-05-22 03:43:47] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 4 ms to minimize.
[2024-05-22 03:43:48] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 4 ms to minimize.
[2024-05-22 03:43:49] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (OVERLAPS) 445/680 variables, 235/329 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/680 variables, 444/773 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/680 variables, and 773 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 83/83 constraints]
After SMT, in 60807ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60814ms
Starting structural reductions in LTL mode, iteration 1 : 235/238 places, 445/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61437 ms. Remains : 235/238 places, 445/448 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) p1), true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-03 finished in 61602 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 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Graph (trivial) has 224 edges and 238 vertex of which 4 / 238 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 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 235 transition count 357
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 124 rules applied. Total rules applied 213 place count 147 transition count 321
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 234 place count 126 transition count 321
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 234 place count 126 transition count 315
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 246 place count 120 transition count 315
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 250 place count 116 transition count 311
Iterating global reduction 3 with 4 rules applied. Total rules applied 254 place count 116 transition count 311
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 356 place count 65 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 357 place count 65 transition count 258
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 369 place count 53 transition count 185
Iterating global reduction 4 with 12 rules applied. Total rules applied 381 place count 53 transition count 185
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 386 place count 53 transition count 180
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 390 place count 51 transition count 178
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 392 place count 49 transition count 176
Applied a total of 392 rules in 79 ms. Remains 49 /238 variables (removed 189) and now considering 176/448 (removed 272) transitions.
// Phase 1: matrix 176 rows 49 cols
[2024-05-22 03:44:03] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 03:44:03] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 03:44:03] [INFO ] Invariant cache hit.
[2024-05-22 03:44:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:44:03] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [45, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 328 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/238 places, 176/448 transitions.
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 4 place count 45 transition count 174
Applied a total of 4 rules in 13 ms. Remains 45 /47 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 45 cols
[2024-05-22 03:44:03] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 03:44:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 03:44:03] [INFO ] Invariant cache hit.
[2024-05-22 03:44:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:44:03] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/238 places, 174/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 730 ms. Remains : 45/238 places, 174/448 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-04 finished in 798 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)||(p1 U p2)))))'
Support contains 6 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 234 transition count 444
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 234 transition count 444
Applied a total of 8 rules in 9 ms. Remains 234 /238 variables (removed 4) and now considering 444/448 (removed 4) transitions.
// Phase 1: matrix 444 rows 234 cols
[2024-05-22 03:44:03] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 03:44:03] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 03:44:03] [INFO ] Invariant cache hit.
[2024-05-22 03:44:04] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2024-05-22 03:44:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:44:12] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 4 ms to minimize.
[2024-05-22 03:44:12] [INFO ] Deduced a trap composed of 55 places in 321 ms of which 4 ms to minimize.
[2024-05-22 03:44:13] [INFO ] Deduced a trap composed of 14 places in 329 ms of which 3 ms to minimize.
[2024-05-22 03:44:13] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-22 03:44:13] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 4 ms to minimize.
[2024-05-22 03:44:14] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 2 ms to minimize.
[2024-05-22 03:44:14] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 2 ms to minimize.
[2024-05-22 03:44:14] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-05-22 03:44:14] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 2 ms to minimize.
[2024-05-22 03:44:14] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 2 ms to minimize.
[2024-05-22 03:44:14] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-05-22 03:44:15] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-22 03:44:15] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-05-22 03:44:15] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 4 ms to minimize.
[2024-05-22 03:44:15] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 6 ms to minimize.
[2024-05-22 03:44:15] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-05-22 03:44:16] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-22 03:44:16] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-22 03:44:17] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 4 ms to minimize.
[2024-05-22 03:44:17] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:44:17] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 4 ms to minimize.
[2024-05-22 03:44:17] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 4 ms to minimize.
[2024-05-22 03:44:18] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 4 ms to minimize.
[2024-05-22 03:44:18] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 3 ms to minimize.
[2024-05-22 03:44:19] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 3 ms to minimize.
[2024-05-22 03:44:19] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 4 ms to minimize.
[2024-05-22 03:44:19] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 3 ms to minimize.
[2024-05-22 03:44:19] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 4 ms to minimize.
[2024-05-22 03:44:20] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 4 ms to minimize.
[2024-05-22 03:44:20] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 4 ms to minimize.
[2024-05-22 03:44:20] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-22 03:44:21] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 4 ms to minimize.
[2024-05-22 03:44:21] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 3 ms to minimize.
[2024-05-22 03:44:21] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-05-22 03:44:22] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 3 ms to minimize.
[2024-05-22 03:44:22] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
[2024-05-22 03:44:22] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 3 ms to minimize.
[2024-05-22 03:44:22] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
[2024-05-22 03:44:23] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 15 ms to minimize.
[2024-05-22 03:44:23] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:44:27] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 3 ms to minimize.
[2024-05-22 03:44:27] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 3 ms to minimize.
[2024-05-22 03:44:28] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-05-22 03:44:29] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-05-22 03:44:29] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 2 ms to minimize.
[2024-05-22 03:44:29] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-05-22 03:44:29] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
[2024-05-22 03:44:30] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
[2024-05-22 03:44:30] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 3 ms to minimize.
[2024-05-22 03:44:30] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-05-22 03:44:30] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-22 03:44:31] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 2 ms to minimize.
[2024-05-22 03:44:31] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2024-05-22 03:44:31] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2024-05-22 03:44:31] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-22 03:44:31] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-22 03:44:32] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 3 ms to minimize.
[2024-05-22 03:44:32] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/678 variables, and 69 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:44:40] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 3 ms to minimize.
[2024-05-22 03:44:41] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 2 ms to minimize.
[2024-05-22 03:44:42] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-22 03:44:42] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:44:48] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (OVERLAPS) 444/678 variables, 234/308 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 443/751 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/678 variables, and 751 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 63/63 constraints]
After SMT, in 61025ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 61034ms
Starting structural reductions in LTL mode, iteration 1 : 234/238 places, 444/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61654 ms. Remains : 234/238 places, 444/448 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-06
Product exploration explored 100000 steps with 10 reset in 174 ms.
Product exploration explored 100000 steps with 17 reset in 191 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 162 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (195 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 29459 steps (56 resets) in 70 ms. (414 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 176 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 234 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 444/444 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-05-22 03:45:07] [INFO ] Invariant cache hit.
[2024-05-22 03:45:07] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 03:45:07] [INFO ] Invariant cache hit.
[2024-05-22 03:45:07] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2024-05-22 03:45:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:45:15] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 3 ms to minimize.
[2024-05-22 03:45:16] [INFO ] Deduced a trap composed of 55 places in 284 ms of which 4 ms to minimize.
[2024-05-22 03:45:16] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 3 ms to minimize.
[2024-05-22 03:45:16] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-22 03:45:17] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 3 ms to minimize.
[2024-05-22 03:45:17] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 3 ms to minimize.
[2024-05-22 03:45:17] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 4 ms to minimize.
[2024-05-22 03:45:17] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2024-05-22 03:45:18] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 4 ms to minimize.
[2024-05-22 03:45:18] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 3 ms to minimize.
[2024-05-22 03:45:18] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 3 ms to minimize.
[2024-05-22 03:45:18] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 3 ms to minimize.
[2024-05-22 03:45:19] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2024-05-22 03:45:19] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 3 ms to minimize.
[2024-05-22 03:45:19] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 3 ms to minimize.
[2024-05-22 03:45:19] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
[2024-05-22 03:45:20] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-05-22 03:45:20] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-22 03:45:20] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 3 ms to minimize.
[2024-05-22 03:45:21] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:45:21] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 4 ms to minimize.
[2024-05-22 03:45:22] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 4 ms to minimize.
[2024-05-22 03:45:22] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 3 ms to minimize.
[2024-05-22 03:45:22] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 3 ms to minimize.
[2024-05-22 03:45:22] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-05-22 03:45:23] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 4 ms to minimize.
[2024-05-22 03:45:23] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2024-05-22 03:45:23] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2024-05-22 03:45:23] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-22 03:45:23] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-22 03:45:23] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:45:24] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 2 ms to minimize.
[2024-05-22 03:45:24] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 3 ms to minimize.
[2024-05-22 03:45:24] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-22 03:45:24] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-05-22 03:45:25] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
[2024-05-22 03:45:25] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2024-05-22 03:45:25] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-22 03:45:25] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-22 03:45:25] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:45:29] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 2 ms to minimize.
[2024-05-22 03:45:29] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 2 ms to minimize.
[2024-05-22 03:45:30] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 2 ms to minimize.
[2024-05-22 03:45:30] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 2 ms to minimize.
[2024-05-22 03:45:30] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-05-22 03:45:31] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
[2024-05-22 03:45:31] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2024-05-22 03:45:31] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-05-22 03:45:31] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 3 ms to minimize.
[2024-05-22 03:45:32] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 2 ms to minimize.
[2024-05-22 03:45:32] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 3 ms to minimize.
[2024-05-22 03:45:32] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-05-22 03:45:32] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-22 03:45:32] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2024-05-22 03:45:33] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-22 03:45:33] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-22 03:45:33] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-22 03:45:33] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:45:36] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 2 ms to minimize.
[2024-05-22 03:45:37] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-22 03:45:37] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-22 03:45:38] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-22 03:45:38] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-22 03:45:38] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 2 ms to minimize.
SMT process timed out in 31102ms, After SMT, problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 31111ms
Finished structural reductions in LTL mode , in 1 iterations and 31741 ms. Remains : 234/234 places, 444/444 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (181 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 23050 steps (42 resets) in 28 ms. (794 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6 reset in 155 ms.
Entered a terminal (fully accepting) state of product in 4929 steps with 51 reset in 14 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-06 finished in 96205 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(G(p0)))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 234 transition count 444
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 234 transition count 444
Applied a total of 8 rules in 8 ms. Remains 234 /238 variables (removed 4) and now considering 444/448 (removed 4) transitions.
[2024-05-22 03:45:39] [INFO ] Invariant cache hit.
[2024-05-22 03:45:40] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-22 03:45:40] [INFO ] Invariant cache hit.
[2024-05-22 03:45:40] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2024-05-22 03:45:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:45:49] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 4 ms to minimize.
[2024-05-22 03:45:49] [INFO ] Deduced a trap composed of 55 places in 342 ms of which 4 ms to minimize.
[2024-05-22 03:45:50] [INFO ] Deduced a trap composed of 14 places in 293 ms of which 4 ms to minimize.
[2024-05-22 03:45:50] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-22 03:45:50] [INFO ] Deduced a trap composed of 38 places in 343 ms of which 4 ms to minimize.
[2024-05-22 03:45:51] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 3 ms to minimize.
[2024-05-22 03:45:51] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 4 ms to minimize.
[2024-05-22 03:45:51] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 3 ms to minimize.
[2024-05-22 03:45:52] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 3 ms to minimize.
[2024-05-22 03:45:52] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 3 ms to minimize.
[2024-05-22 03:45:52] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 3 ms to minimize.
[2024-05-22 03:45:53] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 4 ms to minimize.
[2024-05-22 03:45:53] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2024-05-22 03:45:53] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 3 ms to minimize.
[2024-05-22 03:45:54] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 3 ms to minimize.
[2024-05-22 03:45:54] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2024-05-22 03:45:54] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 2 ms to minimize.
[2024-05-22 03:45:54] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 2 ms to minimize.
[2024-05-22 03:45:55] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 3 ms to minimize.
[2024-05-22 03:45:55] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:45:56] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 4 ms to minimize.
[2024-05-22 03:45:56] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 4 ms to minimize.
[2024-05-22 03:45:57] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 3 ms to minimize.
[2024-05-22 03:45:57] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 3 ms to minimize.
[2024-05-22 03:45:57] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 4 ms to minimize.
[2024-05-22 03:45:57] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 4 ms to minimize.
[2024-05-22 03:45:58] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-05-22 03:45:58] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-22 03:45:58] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-05-22 03:45:58] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:45:58] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:45:59] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-05-22 03:45:59] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 2 ms to minimize.
[2024-05-22 03:45:59] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-22 03:45:59] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-05-22 03:46:00] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 3 ms to minimize.
[2024-05-22 03:46:00] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 3 ms to minimize.
[2024-05-22 03:46:00] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2024-05-22 03:46:00] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:46:01] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:46:05] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 3 ms to minimize.
[2024-05-22 03:46:05] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 4 ms to minimize.
[2024-05-22 03:46:06] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-22 03:46:06] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-22 03:46:07] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-05-22 03:46:07] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 2 ms to minimize.
[2024-05-22 03:46:07] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
[2024-05-22 03:46:07] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-05-22 03:46:08] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 2 ms to minimize.
[2024-05-22 03:46:08] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
[2024-05-22 03:46:08] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-22 03:46:08] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-22 03:46:09] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-05-22 03:46:09] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2024-05-22 03:46:09] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-22 03:46:09] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-05-22 03:46:10] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 3 ms to minimize.
[2024-05-22 03:46:10] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 3 ms to minimize.
(s172 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/678 variables, and 69 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:46:16] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 3 ms to minimize.
[2024-05-22 03:46:17] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
[2024-05-22 03:46:17] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2024-05-22 03:46:18] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:46:23] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (OVERLAPS) 444/678 variables, 234/308 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 443/751 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:46:41] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2024-05-22 03:46:41] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/678 variables, and 753 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 65/65 constraints]
After SMT, in 61241ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 61250ms
Starting structural reductions in LTL mode, iteration 1 : 234/238 places, 444/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61930 ms. Remains : 234/238 places, 444/448 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-08 finished in 62060 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((F(p1)||p0))||G(p2))))'
Support contains 13 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Graph (trivial) has 207 edges and 238 vertex of which 4 / 238 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 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 235 transition count 357
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 124 rules applied. Total rules applied 213 place count 147 transition count 321
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 234 place count 126 transition count 321
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 234 place count 126 transition count 315
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 246 place count 120 transition count 315
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 250 place count 116 transition count 311
Iterating global reduction 3 with 4 rules applied. Total rules applied 254 place count 116 transition count 311
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 340 place count 73 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 341 place count 73 transition count 266
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 348 place count 66 transition count 228
Iterating global reduction 4 with 7 rules applied. Total rules applied 355 place count 66 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 360 place count 66 transition count 223
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 364 place count 64 transition count 221
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 365 place count 64 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 366 place count 63 transition count 220
Applied a total of 366 rules in 77 ms. Remains 63 /238 variables (removed 175) and now considering 220/448 (removed 228) transitions.
// Phase 1: matrix 220 rows 63 cols
[2024-05-22 03:46:42] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 03:46:42] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 03:46:42] [INFO ] Invariant cache hit.
[2024-05-22 03:46:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:46:42] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [59, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 226 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/238 places, 220/448 transitions.
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 4 place count 59 transition count 218
Applied a total of 4 rules in 11 ms. Remains 59 /61 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 59 cols
[2024-05-22 03:46:42] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 03:46:42] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 03:46:42] [INFO ] Invariant cache hit.
[2024-05-22 03:46:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:46:42] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/238 places, 218/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 584 ms. Remains : 59/238 places, 218/448 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-09
Product exploration explored 100000 steps with 123 reset in 430 ms.
Product exploration explored 100000 steps with 117 reset in 436 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 134 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1731 resets) in 846 ms. (47 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (228 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (224 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (214 resets) in 551 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (248 resets) in 350 ms. (113 steps per ms) remains 4/4 properties
[2024-05-22 03:46:44] [INFO ] Invariant cache hit.
[2024-05-22 03:46:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 217/273 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/276 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/277 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 68 constraints, problems are : Problem set: 0 solved, 4 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 56/277 variables, and 8 constraints, problems are : Problem set: 4 solved, 0 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/59 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 416ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR (NOT p2) p0 p1)), (G (OR p2 (NOT p0) p1)), (G (OR p0 p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 28 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-09 finished in 3073 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))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Graph (trivial) has 224 edges and 238 vertex of which 4 / 238 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 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 235 transition count 356
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 125 rules applied. Total rules applied 215 place count 146 transition count 320
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 236 place count 125 transition count 320
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 236 place count 125 transition count 314
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 248 place count 119 transition count 314
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 115 transition count 310
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 115 transition count 310
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 358 place count 64 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 359 place count 64 transition count 257
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 371 place count 52 transition count 185
Iterating global reduction 4 with 12 rules applied. Total rules applied 383 place count 52 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 389 place count 52 transition count 179
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 393 place count 50 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 395 place count 48 transition count 175
Applied a total of 395 rules in 63 ms. Remains 48 /238 variables (removed 190) and now considering 175/448 (removed 273) transitions.
// Phase 1: matrix 175 rows 48 cols
[2024-05-22 03:46:45] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 03:46:45] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 03:46:45] [INFO ] Invariant cache hit.
[2024-05-22 03:46:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:46:45] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [44, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 326 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/238 places, 175/448 transitions.
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 4 place count 44 transition count 173
Applied a total of 4 rules in 11 ms. Remains 44 /46 variables (removed 2) and now considering 173/175 (removed 2) transitions.
// Phase 1: matrix 173 rows 44 cols
[2024-05-22 03:46:45] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 03:46:45] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 03:46:45] [INFO ] Invariant cache hit.
[2024-05-22 03:46:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:46:45] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/238 places, 173/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 720 ms. Remains : 44/238 places, 173/448 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-10 finished in 791 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((p0||F(p1))))'
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 235 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 235 transition count 445
Applied a total of 6 rules in 9 ms. Remains 235 /238 variables (removed 3) and now considering 445/448 (removed 3) transitions.
// Phase 1: matrix 445 rows 235 cols
[2024-05-22 03:46:45] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 03:46:46] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 03:46:46] [INFO ] Invariant cache hit.
[2024-05-22 03:46:46] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2024-05-22 03:46:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:46:54] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 4 ms to minimize.
[2024-05-22 03:46:55] [INFO ] Deduced a trap composed of 55 places in 336 ms of which 4 ms to minimize.
[2024-05-22 03:46:55] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 3 ms to minimize.
[2024-05-22 03:46:55] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-05-22 03:46:56] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 3 ms to minimize.
[2024-05-22 03:46:56] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 2 ms to minimize.
[2024-05-22 03:46:56] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2024-05-22 03:46:56] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-22 03:46:57] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2024-05-22 03:46:57] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 2 ms to minimize.
[2024-05-22 03:46:57] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 3 ms to minimize.
[2024-05-22 03:46:57] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 4 ms to minimize.
[2024-05-22 03:46:58] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 3 ms to minimize.
[2024-05-22 03:46:58] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 4 ms to minimize.
[2024-05-22 03:46:58] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 4 ms to minimize.
[2024-05-22 03:46:59] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 3 ms to minimize.
[2024-05-22 03:46:59] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 3 ms to minimize.
[2024-05-22 03:46:59] [INFO ] Deduced a trap composed of 41 places in 255 ms of which 4 ms to minimize.
[2024-05-22 03:46:59] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 3 ms to minimize.
[2024-05-22 03:47:00] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:47:00] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:47:01] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 3 ms to minimize.
[2024-05-22 03:47:01] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 4 ms to minimize.
[2024-05-22 03:47:01] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 4 ms to minimize.
[2024-05-22 03:47:02] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 4 ms to minimize.
[2024-05-22 03:47:02] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 3 ms to minimize.
[2024-05-22 03:47:02] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 3 ms to minimize.
[2024-05-22 03:47:03] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 4 ms to minimize.
[2024-05-22 03:47:03] [INFO ] Deduced a trap composed of 41 places in 263 ms of which 3 ms to minimize.
[2024-05-22 03:47:04] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 3 ms to minimize.
[2024-05-22 03:47:04] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 3 ms to minimize.
[2024-05-22 03:47:05] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 3 ms to minimize.
[2024-05-22 03:47:05] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-22 03:47:05] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 3 ms to minimize.
[2024-05-22 03:47:05] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 2 ms to minimize.
[2024-05-22 03:47:05] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2024-05-22 03:47:06] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
[2024-05-22 03:47:06] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-22 03:47:06] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 3 ms to minimize.
[2024-05-22 03:47:07] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:47:11] [INFO ] Deduced a trap composed of 39 places in 259 ms of which 4 ms to minimize.
[2024-05-22 03:47:12] [INFO ] Deduced a trap composed of 58 places in 311 ms of which 4 ms to minimize.
[2024-05-22 03:47:13] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-05-22 03:47:13] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 3 ms to minimize.
[2024-05-22 03:47:13] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-22 03:47:13] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 3 ms to minimize.
[2024-05-22 03:47:13] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 3 ms to minimize.
[2024-05-22 03:47:14] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 4 ms to minimize.
[2024-05-22 03:47:14] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 3 ms to minimize.
[2024-05-22 03:47:14] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 2 ms to minimize.
[2024-05-22 03:47:14] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-05-22 03:47:15] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2024-05-22 03:47:15] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 2 ms to minimize.
[2024-05-22 03:47:15] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-22 03:47:16] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-05-22 03:47:16] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-22 03:47:16] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/680 variables, and 68 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:47:22] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 4 ms to minimize.
[2024-05-22 03:47:22] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 3 ms to minimize.
[2024-05-22 03:47:23] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 3 ms to minimize.
[2024-05-22 03:47:24] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 2 ms to minimize.
[2024-05-22 03:47:24] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2024-05-22 03:47:24] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:47:29] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 3 ms to minimize.
[2024-05-22 03:47:29] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:47:36] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 2 ms to minimize.
[2024-05-22 03:47:37] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:47:41] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/680 variables, and 79 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/444 constraints, Known Traps: 68/68 constraints]
After SMT, in 61244ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 61257ms
Starting structural reductions in LTL mode, iteration 1 : 235/238 places, 445/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61889 ms. Remains : 235/238 places, 445/448 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-11 finished in 63000 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(G((p0&&F(((X(!p1)&&F(p2))||G(!p1)))))))'
Support contains 6 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 235 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 235 transition count 445
Applied a total of 6 rules in 8 ms. Remains 235 /238 variables (removed 3) and now considering 445/448 (removed 3) transitions.
// Phase 1: matrix 445 rows 235 cols
[2024-05-22 03:47:48] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 03:47:49] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 03:47:49] [INFO ] Invariant cache hit.
[2024-05-22 03:47:49] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2024-05-22 03:47:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:47:57] [INFO ] Deduced a trap composed of 58 places in 346 ms of which 4 ms to minimize.
[2024-05-22 03:47:58] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 4 ms to minimize.
[2024-05-22 03:47:58] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 3 ms to minimize.
[2024-05-22 03:47:58] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-22 03:47:58] [INFO ] Deduced a trap composed of 14 places in 307 ms of which 4 ms to minimize.
[2024-05-22 03:47:59] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 2 ms to minimize.
[2024-05-22 03:47:59] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2024-05-22 03:47:59] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 3 ms to minimize.
[2024-05-22 03:47:59] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 3 ms to minimize.
[2024-05-22 03:48:00] [INFO ] Deduced a trap composed of 24 places in 330 ms of which 4 ms to minimize.
[2024-05-22 03:48:00] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 8 ms to minimize.
[2024-05-22 03:48:00] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 4 ms to minimize.
[2024-05-22 03:48:01] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 3 ms to minimize.
[2024-05-22 03:48:01] [INFO ] Deduced a trap composed of 54 places in 264 ms of which 4 ms to minimize.
[2024-05-22 03:48:01] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 3 ms to minimize.
[2024-05-22 03:48:02] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 4 ms to minimize.
[2024-05-22 03:48:02] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 4 ms to minimize.
[2024-05-22 03:48:02] [INFO ] Deduced a trap composed of 34 places in 289 ms of which 4 ms to minimize.
[2024-05-22 03:48:02] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 3 ms to minimize.
[2024-05-22 03:48:03] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:48:03] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 3 ms to minimize.
[2024-05-22 03:48:04] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2024-05-22 03:48:04] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 4 ms to minimize.
[2024-05-22 03:48:05] [INFO ] Deduced a trap composed of 31 places in 275 ms of which 3 ms to minimize.
[2024-05-22 03:48:05] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 3 ms to minimize.
[2024-05-22 03:48:05] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2024-05-22 03:48:05] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2024-05-22 03:48:06] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 4 ms to minimize.
[2024-05-22 03:48:06] [INFO ] Deduced a trap composed of 38 places in 287 ms of which 3 ms to minimize.
[2024-05-22 03:48:06] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 3 ms to minimize.
[2024-05-22 03:48:07] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 3 ms to minimize.
[2024-05-22 03:48:07] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 4 ms to minimize.
[2024-05-22 03:48:07] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 4 ms to minimize.
[2024-05-22 03:48:07] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 3 ms to minimize.
[2024-05-22 03:48:08] [INFO ] Deduced a trap composed of 38 places in 252 ms of which 3 ms to minimize.
[2024-05-22 03:48:08] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 4 ms to minimize.
[2024-05-22 03:48:08] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-05-22 03:48:09] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 2 ms to minimize.
[2024-05-22 03:48:09] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 2 ms to minimize.
[2024-05-22 03:48:09] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:48:13] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 4 ms to minimize.
[2024-05-22 03:48:13] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-05-22 03:48:14] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 4 ms to minimize.
[2024-05-22 03:48:14] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 3 ms to minimize.
[2024-05-22 03:48:14] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2024-05-22 03:48:14] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 3 ms to minimize.
[2024-05-22 03:48:15] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 3 ms to minimize.
[2024-05-22 03:48:15] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2024-05-22 03:48:15] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2024-05-22 03:48:16] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-05-22 03:48:16] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 4 ms to minimize.
[2024-05-22 03:48:16] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 4 ms to minimize.
[2024-05-22 03:48:17] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 3 ms to minimize.
[2024-05-22 03:48:17] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-05-22 03:48:17] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 2 ms to minimize.
[2024-05-22 03:48:18] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 2 ms to minimize.
[2024-05-22 03:48:18] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 3 ms to minimize.
[2024-05-22 03:48:18] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-05-22 03:48:18] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-22 03:48:18] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 03:48:19] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 3 ms to minimize.
[2024-05-22 03:48:20] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 3 ms to minimize.
[2024-05-22 03:48:20] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-05-22 03:48:20] [INFO ] Deduced a trap composed of 36 places in 238 ms of which 3 ms to minimize.
SMT process timed out in 31186ms, After SMT, problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 31193ms
Starting structural reductions in LTL mode, iteration 1 : 235/238 places, 445/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31667 ms. Remains : 235/238 places, 445/448 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (AND p1 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-12 finished in 31955 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)))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Graph (trivial) has 225 edges and 238 vertex of which 4 / 238 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 235 transition count 358
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 123 rules applied. Total rules applied 211 place count 148 transition count 322
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 233 place count 127 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 126 transition count 321
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 234 place count 126 transition count 313
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 250 place count 118 transition count 313
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 254 place count 114 transition count 309
Iterating global reduction 4 with 4 rules applied. Total rules applied 258 place count 114 transition count 309
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 356 place count 65 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 65 transition count 258
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 370 place count 52 transition count 179
Iterating global reduction 5 with 13 rules applied. Total rules applied 383 place count 52 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 389 place count 52 transition count 173
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 6 with 4 rules applied. Total rules applied 393 place count 50 transition count 171
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 395 place count 48 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 396 place count 47 transition count 169
Applied a total of 396 rules in 51 ms. Remains 47 /238 variables (removed 191) and now considering 169/448 (removed 279) transitions.
// Phase 1: matrix 169 rows 47 cols
[2024-05-22 03:48:20] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 03:48:21] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 03:48:21] [INFO ] Invariant cache hit.
[2024-05-22 03:48:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:48:21] [INFO ] Implicit Places using invariants and state equation in 295 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 438 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/238 places, 169/448 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 45 transition count 168
Applied a total of 2 rules in 9 ms. Remains 45 /46 variables (removed 1) and now considering 168/169 (removed 1) transitions.
// Phase 1: matrix 168 rows 45 cols
[2024-05-22 03:48:21] [INFO ] Computed 8 invariants in 4 ms
[2024-05-22 03:48:21] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-22 03:48:21] [INFO ] Invariant cache hit.
[2024-05-22 03:48:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 03:48:21] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/238 places, 168/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 766 ms. Remains : 45/238 places, 168/448 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 42 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-13 finished in 864 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(G(p0)))))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 234 transition count 444
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 234 transition count 444
Applied a total of 8 rules in 9 ms. Remains 234 /238 variables (removed 4) and now considering 444/448 (removed 4) transitions.
// Phase 1: matrix 444 rows 234 cols
[2024-05-22 03:48:21] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 03:48:21] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 03:48:21] [INFO ] Invariant cache hit.
[2024-05-22 03:48:22] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2024-05-22 03:48:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:48:30] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 4 ms to minimize.
[2024-05-22 03:48:31] [INFO ] Deduced a trap composed of 55 places in 345 ms of which 4 ms to minimize.
[2024-05-22 03:48:31] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 4 ms to minimize.
[2024-05-22 03:48:31] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-22 03:48:32] [INFO ] Deduced a trap composed of 38 places in 333 ms of which 4 ms to minimize.
[2024-05-22 03:48:32] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 3 ms to minimize.
[2024-05-22 03:48:32] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 3 ms to minimize.
[2024-05-22 03:48:33] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 4 ms to minimize.
[2024-05-22 03:48:33] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 3 ms to minimize.
[2024-05-22 03:48:33] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 4 ms to minimize.
[2024-05-22 03:48:34] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 4 ms to minimize.
[2024-05-22 03:48:34] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 5 ms to minimize.
[2024-05-22 03:48:34] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-05-22 03:48:35] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 3 ms to minimize.
[2024-05-22 03:48:35] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
[2024-05-22 03:48:35] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-05-22 03:48:35] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-22 03:48:35] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-05-22 03:48:36] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 3 ms to minimize.
[2024-05-22 03:48:36] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:48:37] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 3 ms to minimize.
[2024-05-22 03:48:37] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 3 ms to minimize.
[2024-05-22 03:48:38] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 4 ms to minimize.
[2024-05-22 03:48:38] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 3 ms to minimize.
[2024-05-22 03:48:38] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 3 ms to minimize.
[2024-05-22 03:48:39] [INFO ] Deduced a trap composed of 41 places in 252 ms of which 4 ms to minimize.
[2024-05-22 03:48:39] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 2 ms to minimize.
[2024-05-22 03:48:39] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 3 ms to minimize.
[2024-05-22 03:48:39] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 4 ms to minimize.
[2024-05-22 03:48:39] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 3 ms to minimize.
[2024-05-22 03:48:40] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:48:40] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 3 ms to minimize.
[2024-05-22 03:48:41] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 4 ms to minimize.
[2024-05-22 03:48:41] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 1 ms to minimize.
[2024-05-22 03:48:41] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 3 ms to minimize.
[2024-05-22 03:48:41] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2024-05-22 03:48:42] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 3 ms to minimize.
[2024-05-22 03:48:42] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2024-05-22 03:48:42] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
[2024-05-22 03:48:42] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:48:46] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 4 ms to minimize.
[2024-05-22 03:48:46] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 3 ms to minimize.
[2024-05-22 03:48:47] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-05-22 03:48:48] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2024-05-22 03:48:48] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-22 03:48:48] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-22 03:48:48] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2024-05-22 03:48:48] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 3 ms to minimize.
[2024-05-22 03:48:49] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 3 ms to minimize.
[2024-05-22 03:48:49] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-05-22 03:48:49] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-22 03:48:49] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 2 ms to minimize.
[2024-05-22 03:48:49] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2024-05-22 03:48:50] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
[2024-05-22 03:48:50] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
[2024-05-22 03:48:50] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-22 03:48:51] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 2 ms to minimize.
[2024-05-22 03:48:51] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/678 variables, and 69 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:48:57] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 3 ms to minimize.
[2024-05-22 03:48:58] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 2 ms to minimize.
[2024-05-22 03:48:58] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-22 03:48:59] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:49:04] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (OVERLAPS) 444/678 variables, 234/308 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 443/751 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 03:49:20] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 4 ms to minimize.
[2024-05-22 03:49:20] [INFO ] Deduced a trap composed of 58 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/678 variables, and 753 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 65/65 constraints]
After SMT, in 61032ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 61041ms
Starting structural reductions in LTL mode, iteration 1 : 234/238 places, 444/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61551 ms. Remains : 234/238 places, 444/448 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-14 finished in 61786 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)||(p1&&G(F(p1))))))'
Support contains 5 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 448/448 transitions.
Graph (trivial) has 219 edges and 238 vertex of which 4 / 238 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 235 transition count 358
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 123 rules applied. Total rules applied 211 place count 148 transition count 322
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 232 place count 127 transition count 322
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 232 place count 127 transition count 315
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 246 place count 120 transition count 315
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 249 place count 117 transition count 312
Iterating global reduction 3 with 3 rules applied. Total rules applied 252 place count 117 transition count 312
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 350 place count 68 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 351 place count 68 transition count 261
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 362 place count 57 transition count 196
Iterating global reduction 4 with 11 rules applied. Total rules applied 373 place count 57 transition count 196
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 379 place count 57 transition count 190
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 383 place count 55 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 54 transition count 187
Applied a total of 384 rules in 63 ms. Remains 54 /238 variables (removed 184) and now considering 187/448 (removed 261) transitions.
// Phase 1: matrix 187 rows 54 cols
[2024-05-22 03:49:23] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 03:49:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 03:49:23] [INFO ] Invariant cache hit.
[2024-05-22 03:49:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:49:23] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [50, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 359 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/238 places, 187/448 transitions.
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 4 place count 50 transition count 185
Applied a total of 4 rules in 12 ms. Remains 50 /52 variables (removed 2) and now considering 185/187 (removed 2) transitions.
// Phase 1: matrix 185 rows 50 cols
[2024-05-22 03:49:23] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 03:49:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 03:49:24] [INFO ] Invariant cache hit.
[2024-05-22 03:49:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:49:24] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/238 places, 185/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 759 ms. Remains : 50/238 places, 185/448 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-15
Product exploration explored 100000 steps with 26 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 105 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X 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 9 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4310 steps (229 resets) in 17 ms. (239 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X 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 : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 185/185 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-22 03:49:25] [INFO ] Invariant cache hit.
[2024-05-22 03:49:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-22 03:49:25] [INFO ] Invariant cache hit.
[2024-05-22 03:49:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:49:25] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-22 03:49:25] [INFO ] Redundant transitions in 26 ms returned []
Running 183 sub problems to find dead transitions.
[2024-05-22 03:49:25] [INFO ] Invariant cache hit.
[2024-05-22 03:49:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/234 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 03:49:28] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 60 constraints, problems are : Problem set: 0 solved, 183 unsolved in 8948 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/234 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 183/242 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/235 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/235 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 243 constraints, problems are : Problem set: 0 solved, 183 unsolved in 16213 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 1/1 constraints]
After SMT, in 25732ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 25734ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26061 ms. Remains : 50/50 places, 185/185 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 : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X 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 9 factoid took 160 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3240 steps (165 resets) in 30 ms. (104 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X 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 : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 329 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 61 reset in 72 ms.
Product exploration explored 100000 steps with 27 reset in 62 ms.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-22 03:49:52] [INFO ] Invariant cache hit.
[2024-05-22 03:49:52] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 03:49:52] [INFO ] Invariant cache hit.
[2024-05-22 03:49:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:49:52] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-22 03:49:52] [INFO ] Redundant transitions in 34 ms returned []
Running 183 sub problems to find dead transitions.
[2024-05-22 03:49:52] [INFO ] Invariant cache hit.
[2024-05-22 03:49:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/234 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 03:49:56] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 60 constraints, problems are : Problem set: 0 solved, 183 unsolved in 9497 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/234 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 183/242 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/235 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/235 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 243 constraints, problems are : Problem set: 0 solved, 183 unsolved in 15350 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 1/1 constraints]
After SMT, in 25659ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 25661ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25995 ms. Remains : 50/50 places, 185/185 transitions.
Treatment of property AutonomousCar-PT-06b-LTLFireability-15 finished in 55079 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)||(p1&&G(F(p1))))))'
[2024-05-22 03:50:19] [INFO ] Flatten gal took : 68 ms
[2024-05-22 03:50:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 03:50:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 238 places, 448 transitions and 2554 arcs took 12 ms.
Total runtime 615636 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running AutonomousCar-PT-06b
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: 238
TRANSITIONS: 448
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.021s, Sys 0.009s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.004s]
----------------------------------------------------------------------
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: 3313
MODEL NAME: /home/mcc/execution/414/model
238 places, 448 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-06b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06b-LTLFireability-02 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716350425544
--------------------
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
MEDDLY ERROR: Insufficient memory
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-06b"
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-06b, 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-171620166300308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b 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 ;