About the Execution of GreatSPN+red for AutonomousCar-PT-07b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6704.939 | 1875797.00 | 2669020.00 | 6232.50 | FFT?FFFTFFTFF?TF | 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-171620166400323.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-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400323
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 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 334K 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-07b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716351387540
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 04:16:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 04:16:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:16:29] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-22 04:16:29] [INFO ] Transformed 323 places.
[2024-05-22 04:16:29] [INFO ] Transformed 846 transitions.
[2024-05-22 04:16:29] [INFO ] Found NUPN structural information;
[2024-05-22 04:16:29] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 290 transition count 813
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 290 transition count 813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 285 transition count 808
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 285 transition count 808
Applied a total of 76 rules in 114 ms. Remains 285 /323 variables (removed 38) and now considering 808/846 (removed 38) transitions.
// Phase 1: matrix 808 rows 285 cols
[2024-05-22 04:16:30] [INFO ] Computed 12 invariants in 35 ms
[2024-05-22 04:16:30] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-22 04:16:30] [INFO ] Invariant cache hit.
[2024-05-22 04:16:31] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
Running 807 sub problems to find dead transitions.
[2024-05-22 04:16:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-22 04:16:47] [INFO ] Deduced a trap composed of 19 places in 428 ms of which 34 ms to minimize.
[2024-05-22 04:16:48] [INFO ] Deduced a trap composed of 21 places in 386 ms of which 4 ms to minimize.
[2024-05-22 04:16:48] [INFO ] Deduced a trap composed of 62 places in 327 ms of which 4 ms to minimize.
[2024-05-22 04:16:49] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 3 ms to minimize.
[2024-05-22 04:16:49] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 3 ms to minimize.
[2024-05-22 04:16:50] [INFO ] Deduced a trap composed of 54 places in 315 ms of which 3 ms to minimize.
[2024-05-22 04:16:50] [INFO ] Deduced a trap composed of 15 places in 338 ms of which 3 ms to minimize.
[2024-05-22 04:16:50] [INFO ] Deduced a trap composed of 37 places in 369 ms of which 20 ms to minimize.
[2024-05-22 04:16:51] [INFO ] Deduced a trap composed of 25 places in 607 ms of which 3 ms to minimize.
[2024-05-22 04:16:52] [INFO ] Deduced a trap composed of 36 places in 581 ms of which 3 ms to minimize.
[2024-05-22 04:16:52] [INFO ] Deduced a trap composed of 37 places in 569 ms of which 3 ms to minimize.
[2024-05-22 04:16:53] [INFO ] Deduced a trap composed of 44 places in 409 ms of which 3 ms to minimize.
[2024-05-22 04:16:53] [INFO ] Deduced a trap composed of 36 places in 346 ms of which 3 ms to minimize.
[2024-05-22 04:16:53] [INFO ] Deduced a trap composed of 40 places in 331 ms of which 3 ms to minimize.
[2024-05-22 04:16:54] [INFO ] Deduced a trap composed of 52 places in 348 ms of which 4 ms to minimize.
[2024-05-22 04:16:54] [INFO ] Deduced a trap composed of 42 places in 333 ms of which 3 ms to minimize.
[2024-05-22 04:16:55] [INFO ] Deduced a trap composed of 30 places in 321 ms of which 3 ms to minimize.
[2024-05-22 04:16:55] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 3 ms to minimize.
[2024-05-22 04:16:55] [INFO ] Deduced a trap composed of 41 places in 337 ms of which 3 ms to minimize.
[2024-05-22 04:16:56] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-22 04:16:57] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 3 ms to minimize.
[2024-05-22 04:16:57] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 3 ms to minimize.
[2024-05-22 04:16:57] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 3 ms to minimize.
[2024-05-22 04:16:58] [INFO ] Deduced a trap composed of 53 places in 361 ms of which 4 ms to minimize.
[2024-05-22 04:16:58] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 3 ms to minimize.
[2024-05-22 04:16:59] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 3 ms to minimize.
[2024-05-22 04:16:59] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 3 ms to minimize.
[2024-05-22 04:16:59] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 3 ms to minimize.
[2024-05-22 04:17:00] [INFO ] Deduced a trap composed of 22 places in 360 ms of which 3 ms to minimize.
[2024-05-22 04:17:00] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 2 ms to minimize.
[2024-05-22 04:17:00] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 3 ms to minimize.
[2024-05-22 04:17:01] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 2 ms to minimize.
[2024-05-22 04:17:01] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 2 ms to minimize.
[2024-05-22 04:17:01] [INFO ] Deduced a trap composed of 46 places in 319 ms of which 3 ms to minimize.
[2024-05-22 04:17:02] [INFO ] Deduced a trap composed of 40 places in 312 ms of which 3 ms to minimize.
[2024-05-22 04:17:02] [INFO ] Deduced a trap composed of 42 places in 301 ms of which 2 ms to minimize.
[2024-05-22 04:17:02] [INFO ] Deduced a trap composed of 41 places in 313 ms of which 3 ms to minimize.
[2024-05-22 04:17:03] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 2 ms to minimize.
[2024-05-22 04:17:03] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 2 ms to minimize.
[2024-05-22 04:17:04] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/1093 variables, and 52 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-22 04:17:13] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-22 04:17:13] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 3 ms to minimize.
[2024-05-22 04:17:14] [INFO ] Deduced a trap composed of 57 places in 311 ms of which 4 ms to minimize.
[2024-05-22 04:17:14] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 3 ms to minimize.
[2024-05-22 04:17:14] [INFO ] Deduced a trap composed of 41 places in 270 ms of which 3 ms to minimize.
[2024-05-22 04:17:15] [INFO ] Deduced a trap composed of 45 places in 305 ms of which 3 ms to minimize.
[2024-05-22 04:17:15] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 3 ms to minimize.
[2024-05-22 04:17:15] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 3 ms to minimize.
[2024-05-22 04:17:16] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 2 ms to minimize.
[2024-05-22 04:17:16] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 3 ms to minimize.
[2024-05-22 04:17:16] [INFO ] Deduced a trap composed of 39 places in 293 ms of which 4 ms to minimize.
[2024-05-22 04:17:17] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 3 ms to minimize.
[2024-05-22 04:17:17] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 2 ms to minimize.
[2024-05-22 04:17:17] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 2 ms to minimize.
[2024-05-22 04:17:17] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 2 ms to minimize.
[2024-05-22 04:17:17] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-05-22 04:17:18] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 3 ms to minimize.
[2024-05-22 04:17:18] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 2 ms to minimize.
[2024-05-22 04:17:18] [INFO ] Deduced a trap composed of 43 places in 306 ms of which 3 ms to minimize.
[2024-05-22 04:17:19] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-22 04:17:20] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 3 ms to minimize.
[2024-05-22 04:17:20] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 3 ms to minimize.
[2024-05-22 04:17:20] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 2 ms to minimize.
[2024-05-22 04:17:21] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 2 ms to minimize.
[2024-05-22 04:17:21] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 2 ms to minimize.
[2024-05-22 04:17:21] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 2 ms to minimize.
[2024-05-22 04:17:22] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 2 ms to minimize.
[2024-05-22 04:17:22] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 2 ms to minimize.
[2024-05-22 04:17:22] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 2 ms to minimize.
[2024-05-22 04:17:22] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 3 ms to minimize.
[2024-05-22 04:17:23] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 2 ms to minimize.
[2024-05-22 04:17:23] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-05-22 04:17:23] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 2 ms to minimize.
[2024-05-22 04:17:23] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 2 ms to minimize.
[2024-05-22 04:17:24] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 3 ms to minimize.
[2024-05-22 04:17:24] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 2 ms to minimize.
[2024-05-22 04:17:24] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 3 ms to minimize.
[2024-05-22 04:17:25] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 2 ms to minimize.
[2024-05-22 04:17:25] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
[2024-05-22 04:17:25] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-22 04:17:27] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
[2024-05-22 04:17:27] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-22 04:17:27] [INFO ] Deduced a trap composed of 41 places in 260 ms of which 3 ms to minimize.
[2024-05-22 04:17:28] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 2 ms to minimize.
[2024-05-22 04:17:28] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 3 ms to minimize.
[2024-05-22 04:17:28] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 3 ms to minimize.
[2024-05-22 04:17:29] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 3 ms to minimize.
[2024-05-22 04:17:29] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 2 ms to minimize.
[2024-05-22 04:17:29] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 1 ms to minimize.
[2024-05-22 04:17:29] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 1 ms to minimize.
[2024-05-22 04:17:29] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 3 ms to minimize.
[2024-05-22 04:17:30] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 2 ms to minimize.
[2024-05-22 04:17:30] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 1 ms to minimize.
[2024-05-22 04:17:30] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2024-05-22 04:17:30] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 3 ms to minimize.
[2024-05-22 04:17:31] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2024-05-22 04:17:31] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 3 ms to minimize.
[2024-05-22 04:17:32] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 2 ms to minimize.
[2024-05-22 04:17:32] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/1093 variables, and 111 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 0/807 constraints, Known Traps: 99/99 constraints]
After SMT, in 66147ms problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 66188ms
Starting structural reductions in LTL mode, iteration 1 : 285/323 places, 808/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67540 ms. Remains : 285/323 places, 808/846 transitions.
Support contains 47 out of 285 places after structural reductions.
[2024-05-22 04:17:37] [INFO ] Flatten gal took : 193 ms
[2024-05-22 04:17:38] [INFO ] Flatten gal took : 106 ms
[2024-05-22 04:17:38] [INFO ] Input system was already deterministic with 808 transitions.
RANDOM walk for 40000 steps (172 resets) in 2125 ms. (18 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40002 steps (64 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (63 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
[2024-05-22 04:17:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 214/285 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 04:17:39] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 3 ms to minimize.
[2024-05-22 04:17:39] [INFO ] Deduced a trap composed of 41 places in 335 ms of which 3 ms to minimize.
[2024-05-22 04:17:40] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 3 ms to minimize.
[2024-05-22 04:17:40] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 3 ms to minimize.
[2024-05-22 04:17:40] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 3 ms to minimize.
[2024-05-22 04:17:41] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 808/1093 variables, 285/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 04:17:42] [INFO ] Deduced a trap composed of 25 places in 605 ms of which 3 ms to minimize.
[2024-05-22 04:17:42] [INFO ] Deduced a trap composed of 21 places in 579 ms of which 34 ms to minimize.
[2024-05-22 04:17:43] [INFO ] Deduced a trap composed of 47 places in 313 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1093 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1093 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1093 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4080 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 214/285 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 808/1093 variables, 285/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1093 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1093 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1093 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1093/1093 variables, and 308 constraints, problems are : Problem set: 0 solved, 2 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 4906ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 821 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 269 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 5 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 1141 edges and 283 vertex of which 278 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 278 transition count 690
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 150 rules applied. Total rules applied 263 place count 169 transition count 649
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 287 place count 145 transition count 649
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 287 place count 145 transition count 642
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 301 place count 138 transition count 642
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 311 place count 128 transition count 632
Iterating global reduction 3 with 10 rules applied. Total rules applied 321 place count 128 transition count 632
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 517 place count 128 transition count 436
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 517 place count 128 transition count 435
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 519 place count 127 transition count 435
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 521 place count 125 transition count 427
Iterating global reduction 4 with 2 rules applied. Total rules applied 523 place count 125 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 525 place count 125 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 526 place count 124 transition count 425
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 634 place count 70 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 635 place count 70 transition count 370
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 647 place count 58 transition count 279
Iterating global reduction 7 with 12 rules applied. Total rules applied 659 place count 58 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 664 place count 58 transition count 274
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 8 with 2 rules applied. Total rules applied 666 place count 57 transition count 273
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 674 place count 57 transition count 265
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 682 place count 49 transition count 265
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 683 place count 49 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 684 place count 48 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 685 place count 47 transition count 264
Applied a total of 685 rules in 244 ms. Remains 47 /285 variables (removed 238) and now considering 264/808 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 47/285 places, 264/808 transitions.
RANDOM walk for 1296 steps (10 resets) in 20 ms. (61 steps per ms) remains 0/2 properties
Computed a total of 50 stabilizing places and 51 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 270 transition count 793
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 270 transition count 793
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 265 transition count 788
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 265 transition count 788
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 264 transition count 787
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 264 transition count 787
Applied a total of 42 rules in 37 ms. Remains 264 /285 variables (removed 21) and now considering 787/808 (removed 21) transitions.
// Phase 1: matrix 787 rows 264 cols
[2024-05-22 04:17:45] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 04:17:45] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-22 04:17:45] [INFO ] Invariant cache hit.
[2024-05-22 04:17:46] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Running 786 sub problems to find dead transitions.
[2024-05-22 04:17:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-22 04:18:05] [INFO ] Deduced a trap composed of 17 places in 435 ms of which 4 ms to minimize.
[2024-05-22 04:18:05] [INFO ] Deduced a trap composed of 18 places in 520 ms of which 5 ms to minimize.
[2024-05-22 04:18:06] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 2 ms to minimize.
[2024-05-22 04:18:06] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 3 ms to minimize.
[2024-05-22 04:18:06] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 3 ms to minimize.
[2024-05-22 04:18:07] [INFO ] Deduced a trap composed of 44 places in 367 ms of which 4 ms to minimize.
[2024-05-22 04:18:07] [INFO ] Deduced a trap composed of 36 places in 491 ms of which 4 ms to minimize.
[2024-05-22 04:18:08] [INFO ] Deduced a trap composed of 38 places in 494 ms of which 4 ms to minimize.
[2024-05-22 04:18:08] [INFO ] Deduced a trap composed of 45 places in 416 ms of which 4 ms to minimize.
[2024-05-22 04:18:09] [INFO ] Deduced a trap composed of 46 places in 497 ms of which 4 ms to minimize.
[2024-05-22 04:18:09] [INFO ] Deduced a trap composed of 38 places in 502 ms of which 4 ms to minimize.
[2024-05-22 04:18:10] [INFO ] Deduced a trap composed of 32 places in 476 ms of which 4 ms to minimize.
[2024-05-22 04:18:10] [INFO ] Deduced a trap composed of 24 places in 476 ms of which 4 ms to minimize.
[2024-05-22 04:18:11] [INFO ] Deduced a trap composed of 37 places in 469 ms of which 4 ms to minimize.
[2024-05-22 04:18:11] [INFO ] Deduced a trap composed of 43 places in 482 ms of which 4 ms to minimize.
[2024-05-22 04:18:12] [INFO ] Deduced a trap composed of 44 places in 464 ms of which 4 ms to minimize.
[2024-05-22 04:18:12] [INFO ] Deduced a trap composed of 46 places in 476 ms of which 5 ms to minimize.
[2024-05-22 04:18:13] [INFO ] Deduced a trap composed of 39 places in 469 ms of which 4 ms to minimize.
[2024-05-22 04:18:13] [INFO ] Deduced a trap composed of 42 places in 399 ms of which 2 ms to minimize.
[2024-05-22 04:18:14] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-22 04:18:14] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 4 ms to minimize.
[2024-05-22 04:18:15] [INFO ] Deduced a trap composed of 21 places in 403 ms of which 3 ms to minimize.
[2024-05-22 04:18:15] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 2 ms to minimize.
[2024-05-22 04:18:15] [INFO ] Deduced a trap composed of 49 places in 418 ms of which 4 ms to minimize.
[2024-05-22 04:18:16] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 3 ms to minimize.
[2024-05-22 04:18:16] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 2 ms to minimize.
[2024-05-22 04:18:17] [INFO ] Deduced a trap composed of 22 places in 391 ms of which 3 ms to minimize.
[2024-05-22 04:18:17] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 2 ms to minimize.
[2024-05-22 04:18:17] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 2 ms to minimize.
[2024-05-22 04:18:18] [INFO ] Deduced a trap composed of 42 places in 326 ms of which 3 ms to minimize.
[2024-05-22 04:18:18] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 2 ms to minimize.
[2024-05-22 04:18:18] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 2 ms to minimize.
[2024-05-22 04:18:19] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 2 ms to minimize.
[2024-05-22 04:18:19] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 2 ms to minimize.
[2024-05-22 04:18:19] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 3 ms to minimize.
[2024-05-22 04:18:19] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 3 ms to minimize.
[2024-05-22 04:18:20] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2024-05-22 04:18:20] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 2 ms to minimize.
[2024-05-22 04:18:20] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-05-22 04:18:20] [INFO ] Deduced a trap composed of 39 places in 356 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/1051 variables, and 52 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-22 04:18:26] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 2 ms to minimize.
[2024-05-22 04:18:27] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 3 ms to minimize.
[2024-05-22 04:18:27] [INFO ] Deduced a trap composed of 41 places in 393 ms of which 4 ms to minimize.
[2024-05-22 04:18:28] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 3 ms to minimize.
[2024-05-22 04:18:28] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 3 ms to minimize.
[2024-05-22 04:18:28] [INFO ] Deduced a trap composed of 45 places in 334 ms of which 3 ms to minimize.
[2024-05-22 04:18:29] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 3 ms to minimize.
[2024-05-22 04:18:29] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 3 ms to minimize.
[2024-05-22 04:18:29] [INFO ] Deduced a trap composed of 28 places in 356 ms of which 3 ms to minimize.
[2024-05-22 04:18:30] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2024-05-22 04:18:30] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 2 ms to minimize.
[2024-05-22 04:18:30] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 2 ms to minimize.
[2024-05-22 04:18:31] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 3 ms to minimize.
[2024-05-22 04:18:31] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 2 ms to minimize.
[2024-05-22 04:18:32] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 3 ms to minimize.
[2024-05-22 04:18:32] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 2 ms to minimize.
[2024-05-22 04:18:32] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-05-22 04:18:32] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-22 04:18:33] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 3 ms to minimize.
[2024-05-22 04:18:33] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-22 04:18:34] [INFO ] Deduced a trap composed of 14 places in 359 ms of which 3 ms to minimize.
[2024-05-22 04:18:35] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 2 ms to minimize.
[2024-05-22 04:18:35] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 2 ms to minimize.
[2024-05-22 04:18:35] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 2 ms to minimize.
[2024-05-22 04:18:36] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-22 04:18:36] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-05-22 04:18:36] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2024-05-22 04:18:37] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 1 ms to minimize.
[2024-05-22 04:18:37] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 2 ms to minimize.
[2024-05-22 04:18:37] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 2 ms to minimize.
[2024-05-22 04:18:37] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 3 ms to minimize.
[2024-05-22 04:18:38] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 2 ms to minimize.
[2024-05-22 04:18:38] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 2 ms to minimize.
[2024-05-22 04:18:38] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 2 ms to minimize.
[2024-05-22 04:18:38] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 2 ms to minimize.
[2024-05-22 04:18:39] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 3 ms to minimize.
[2024-05-22 04:18:39] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 3 ms to minimize.
[2024-05-22 04:18:39] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
[2024-05-22 04:18:40] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 3 ms to minimize.
[2024-05-22 04:18:40] [INFO ] Deduced a trap composed of 32 places in 425 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-22 04:18:42] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2024-05-22 04:18:42] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 3 ms to minimize.
[2024-05-22 04:18:43] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 1 ms to minimize.
[2024-05-22 04:18:44] [INFO ] Deduced a trap composed of 22 places in 442 ms of which 3 ms to minimize.
[2024-05-22 04:18:45] [INFO ] Deduced a trap composed of 6 places in 476 ms of which 4 ms to minimize.
[2024-05-22 04:18:45] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 786 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 264/1051 variables, and 98 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 86/86 constraints]
After SMT, in 65097ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 65110ms
Starting structural reductions in LTL mode, iteration 1 : 264/285 places, 787/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65966 ms. Remains : 264/285 places, 787/808 transitions.
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 203 steps with 1 reset in 18 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-00 finished in 66435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&X(F(p2))&&p0)))'
Support contains 7 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 272 transition count 795
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 272 transition count 795
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 222 place count 272 transition count 599
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 227 place count 267 transition count 594
Iterating global reduction 1 with 5 rules applied. Total rules applied 232 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 233 place count 266 transition count 593
Iterating global reduction 1 with 1 rules applied. Total rules applied 234 place count 266 transition count 593
Applied a total of 234 rules in 40 ms. Remains 266 /285 variables (removed 19) and now considering 593/808 (removed 215) transitions.
// Phase 1: matrix 593 rows 266 cols
[2024-05-22 04:18:52] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 04:18:52] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 04:18:52] [INFO ] Invariant cache hit.
[2024-05-22 04:18:52] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2024-05-22 04:18:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-22 04:19:02] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 3 ms to minimize.
[2024-05-22 04:19:03] [INFO ] Deduced a trap composed of 22 places in 375 ms of which 4 ms to minimize.
[2024-05-22 04:19:03] [INFO ] Deduced a trap composed of 51 places in 368 ms of which 4 ms to minimize.
[2024-05-22 04:19:03] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 3 ms to minimize.
[2024-05-22 04:19:04] [INFO ] Deduced a trap composed of 76 places in 239 ms of which 3 ms to minimize.
[2024-05-22 04:19:04] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-05-22 04:19:04] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 3 ms to minimize.
[2024-05-22 04:19:05] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 3 ms to minimize.
[2024-05-22 04:19:05] [INFO ] Deduced a trap composed of 36 places in 309 ms of which 3 ms to minimize.
[2024-05-22 04:19:05] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 3 ms to minimize.
[2024-05-22 04:19:06] [INFO ] Deduced a trap composed of 41 places in 364 ms of which 4 ms to minimize.
[2024-05-22 04:19:06] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 3 ms to minimize.
[2024-05-22 04:19:06] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 2 ms to minimize.
[2024-05-22 04:19:06] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 3 ms to minimize.
[2024-05-22 04:19:07] [INFO ] Deduced a trap composed of 52 places in 273 ms of which 3 ms to minimize.
[2024-05-22 04:19:07] [INFO ] Deduced a trap composed of 52 places in 250 ms of which 2 ms to minimize.
[2024-05-22 04:19:07] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 3 ms to minimize.
[2024-05-22 04:19:07] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 2 ms to minimize.
[2024-05-22 04:19:08] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 2 ms to minimize.
[2024-05-22 04:19:08] [INFO ] Deduced a trap composed of 52 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-22 04:19:09] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 3 ms to minimize.
[2024-05-22 04:19:09] [INFO ] Deduced a trap composed of 14 places in 301 ms of which 3 ms to minimize.
[2024-05-22 04:19:09] [INFO ] Deduced a trap composed of 35 places in 307 ms of which 4 ms to minimize.
[2024-05-22 04:19:10] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 4 ms to minimize.
[2024-05-22 04:19:10] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 2 ms to minimize.
[2024-05-22 04:19:10] [INFO ] Deduced a trap composed of 38 places in 541 ms of which 3 ms to minimize.
[2024-05-22 04:19:11] [INFO ] Deduced a trap composed of 36 places in 453 ms of which 4 ms to minimize.
[2024-05-22 04:19:11] [INFO ] Deduced a trap composed of 34 places in 305 ms of which 3 ms to minimize.
[2024-05-22 04:19:11] [INFO ] Deduced a trap composed of 36 places in 250 ms of which 2 ms to minimize.
[2024-05-22 04:19:12] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 4 ms to minimize.
[2024-05-22 04:19:12] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 3 ms to minimize.
[2024-05-22 04:19:12] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-22 04:19:13] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 2 ms to minimize.
[2024-05-22 04:19:13] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 3 ms to minimize.
[2024-05-22 04:19:13] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 3 ms to minimize.
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 42 places in 301 ms of which 3 ms to minimize.
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 46 places in 301 ms of which 3 ms to minimize.
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 5 ms to minimize.
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-05-22 04:19:15] [INFO ] Deduced a trap composed of 45 places in 324 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-22 04:19:19] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 3 ms to minimize.
[2024-05-22 04:19:20] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 3 ms to minimize.
[2024-05-22 04:19:20] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 3 ms to minimize.
[2024-05-22 04:19:20] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 2 ms to minimize.
[2024-05-22 04:19:20] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 3 ms to minimize.
[2024-05-22 04:19:21] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 3 ms to minimize.
[2024-05-22 04:19:21] [INFO ] Deduced a trap composed of 63 places in 317 ms of which 3 ms to minimize.
[2024-05-22 04:19:21] [INFO ] Deduced a trap composed of 60 places in 269 ms of which 3 ms to minimize.
[2024-05-22 04:19:22] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 2 ms to minimize.
[2024-05-22 04:19:22] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 3 ms to minimize.
[2024-05-22 04:19:22] [INFO ] Deduced a trap composed of 50 places in 348 ms of which 3 ms to minimize.
[2024-05-22 04:19:23] [INFO ] Deduced a trap composed of 31 places in 337 ms of which 4 ms to minimize.
[2024-05-22 04:19:23] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 3 ms to minimize.
[2024-05-22 04:19:24] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 2 ms to minimize.
[2024-05-22 04:19:24] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 2 ms to minimize.
[2024-05-22 04:19:24] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
SMT process timed out in 31923ms, After SMT, problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 31930ms
Starting structural reductions in LTL mode, iteration 1 : 266/285 places, 593/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32560 ms. Remains : 266/285 places, 593/808 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-01 finished in 32838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||((p1&&G(!p2)) U X(p1)))))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 24 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-22 04:19:24] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 04:19:24] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 04:19:24] [INFO ] Invariant cache hit.
[2024-05-22 04:19:25] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-22 04:19:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:19:39] [INFO ] Deduced a trap composed of 17 places in 342 ms of which 4 ms to minimize.
[2024-05-22 04:19:40] [INFO ] Deduced a trap composed of 35 places in 366 ms of which 4 ms to minimize.
[2024-05-22 04:19:40] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 3 ms to minimize.
[2024-05-22 04:19:40] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 2 ms to minimize.
[2024-05-22 04:19:41] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 3 ms to minimize.
[2024-05-22 04:19:41] [INFO ] Deduced a trap composed of 14 places in 368 ms of which 3 ms to minimize.
[2024-05-22 04:19:42] [INFO ] Deduced a trap composed of 36 places in 365 ms of which 4 ms to minimize.
[2024-05-22 04:19:42] [INFO ] Deduced a trap composed of 35 places in 374 ms of which 4 ms to minimize.
[2024-05-22 04:19:43] [INFO ] Deduced a trap composed of 36 places in 370 ms of which 3 ms to minimize.
[2024-05-22 04:19:43] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 3 ms to minimize.
[2024-05-22 04:19:43] [INFO ] Deduced a trap composed of 36 places in 354 ms of which 4 ms to minimize.
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 36 places in 320 ms of which 2 ms to minimize.
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 2 ms to minimize.
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 18 places in 321 ms of which 3 ms to minimize.
[2024-05-22 04:19:45] [INFO ] Deduced a trap composed of 24 places in 336 ms of which 3 ms to minimize.
[2024-05-22 04:19:45] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 3 ms to minimize.
[2024-05-22 04:19:46] [INFO ] Deduced a trap composed of 41 places in 324 ms of which 2 ms to minimize.
[2024-05-22 04:19:46] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 3 ms to minimize.
[2024-05-22 04:19:46] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 3 ms to minimize.
[2024-05-22 04:19:46] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:19:47] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-22 04:19:48] [INFO ] Deduced a trap composed of 24 places in 375 ms of which 3 ms to minimize.
[2024-05-22 04:19:48] [INFO ] Deduced a trap composed of 75 places in 269 ms of which 2 ms to minimize.
[2024-05-22 04:19:49] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 4 ms to minimize.
[2024-05-22 04:19:49] [INFO ] Deduced a trap composed of 59 places in 340 ms of which 3 ms to minimize.
[2024-05-22 04:19:49] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 3 ms to minimize.
[2024-05-22 04:19:50] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 3 ms to minimize.
[2024-05-22 04:19:50] [INFO ] Deduced a trap composed of 22 places in 340 ms of which 3 ms to minimize.
[2024-05-22 04:19:51] [INFO ] Deduced a trap composed of 42 places in 327 ms of which 3 ms to minimize.
[2024-05-22 04:19:51] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 3 ms to minimize.
[2024-05-22 04:19:51] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 2 ms to minimize.
[2024-05-22 04:19:51] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
[2024-05-22 04:19:52] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2024-05-22 04:19:52] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 3 ms to minimize.
[2024-05-22 04:19:52] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 3 ms to minimize.
[2024-05-22 04:19:53] [INFO ] Deduced a trap composed of 45 places in 364 ms of which 4 ms to minimize.
[2024-05-22 04:19:53] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 3 ms to minimize.
[2024-05-22 04:19:53] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 3 ms to minimize.
[2024-05-22 04:19:53] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 3 ms to minimize.
[2024-05-22 04:19:54] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:20:01] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 2 ms to minimize.
[2024-05-22 04:20:01] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 3 ms to minimize.
[2024-05-22 04:20:02] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 2 ms to minimize.
[2024-05-22 04:20:02] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-05-22 04:20:02] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 2 ms to minimize.
[2024-05-22 04:20:03] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 3 ms to minimize.
[2024-05-22 04:20:03] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 4 ms to minimize.
[2024-05-22 04:20:03] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 2 ms to minimize.
[2024-05-22 04:20:03] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 2 ms to minimize.
[2024-05-22 04:20:03] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-05-22 04:20:04] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 2 ms to minimize.
[2024-05-22 04:20:04] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 3 ms to minimize.
[2024-05-22 04:20:04] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2024-05-22 04:20:04] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2024-05-22 04:20:05] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 2 ms to minimize.
[2024-05-22 04:20:05] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 2 ms to minimize.
[2024-05-22 04:20:05] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-05-22 04:20:05] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 3 ms to minimize.
[2024-05-22 04:20:06] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 3 ms to minimize.
[2024-05-22 04:20:06] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:20:07] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2024-05-22 04:20:07] [INFO ] Deduced a trap composed of 41 places in 320 ms of which 4 ms to minimize.
[2024-05-22 04:20:08] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 4 ms to minimize.
[2024-05-22 04:20:08] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-05-22 04:20:09] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 2 ms to minimize.
[2024-05-22 04:20:09] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 2 ms to minimize.
[2024-05-22 04:20:10] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 2 ms to minimize.
[2024-05-22 04:20:10] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 2 ms to minimize.
[2024-05-22 04:20:10] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 2 ms to minimize.
[2024-05-22 04:20:10] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 1 ms to minimize.
[2024-05-22 04:20:11] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 3 ms to minimize.
[2024-05-22 04:20:11] [INFO ] Deduced a trap composed of 56 places in 230 ms of which 3 ms to minimize.
[2024-05-22 04:20:12] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 3 ms to minimize.
[2024-05-22 04:20:12] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 2 ms to minimize.
[2024-05-22 04:20:12] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 2 ms to minimize.
[2024-05-22 04:20:12] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 3 ms to minimize.
[2024-05-22 04:20:13] [INFO ] Deduced a trap composed of 28 places in 348 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:20:17] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2024-05-22 04:20:17] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 3 ms to minimize.
[2024-05-22 04:20:18] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 2 ms to minimize.
[2024-05-22 04:20:18] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-22 04:20:18] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 2 ms to minimize.
[2024-05-22 04:20:18] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
[2024-05-22 04:20:19] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 3 ms to minimize.
[2024-05-22 04:20:19] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-05-22 04:20:19] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-05-22 04:20:19] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 3 ms to minimize.
[2024-05-22 04:20:20] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 2 ms to minimize.
[2024-05-22 04:20:20] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 3 ms to minimize.
[2024-05-22 04:20:20] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
[2024-05-22 04:20:20] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-05-22 04:20:21] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:20:27] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 1 ms to minimize.
SMT process timed out in 61823ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 61831ms
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62417 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 373 ms.
Product exploration explored 100000 steps with 33333 reset in 252 ms.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 21 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLCardinality-02 finished in 63365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(G(p1)) U p2))||p0))))'
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 262 edges and 285 vertex of which 4 / 285 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 283 transition count 701
Reduce places removed 105 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 141 rules applied. Total rules applied 247 place count 178 transition count 665
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 269 place count 157 transition count 664
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 156 transition count 664
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 270 place count 156 transition count 655
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 288 place count 147 transition count 655
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 297 place count 138 transition count 646
Iterating global reduction 4 with 9 rules applied. Total rules applied 306 place count 138 transition count 646
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 4 with 196 rules applied. Total rules applied 502 place count 138 transition count 450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 502 place count 138 transition count 449
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 504 place count 137 transition count 449
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 506 place count 135 transition count 441
Iterating global reduction 5 with 2 rules applied. Total rules applied 508 place count 135 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 510 place count 135 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 511 place count 134 transition count 439
Performed 56 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 623 place count 78 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 624 place count 78 transition count 381
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 636 place count 66 transition count 291
Iterating global reduction 8 with 12 rules applied. Total rules applied 648 place count 66 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 654 place count 66 transition count 285
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 9 with 2 rules applied. Total rules applied 656 place count 65 transition count 284
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 657 place count 65 transition count 284
Applied a total of 657 rules in 184 ms. Remains 65 /285 variables (removed 220) and now considering 284/808 (removed 524) transitions.
// Phase 1: matrix 284 rows 65 cols
[2024-05-22 04:20:28] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 04:20:28] [INFO ] Implicit Places using invariants in 193 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/285 places, 284/808 transitions.
Applied a total of 0 rules in 20 ms. Remains 64 /64 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 402 ms. Remains : 64/285 places, 284/808 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-03
Product exploration explored 100000 steps with 306 reset in 263 ms.
Product exploration explored 100000 steps with 40 reset in 135 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Detected a total of 7/64 stabilizing places and 8/284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 279 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 36039 steps (1658 resets) in 1019 ms. (35 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 698 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 284/284 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 64 cols
[2024-05-22 04:20:30] [INFO ] Computed 10 invariants in 20 ms
[2024-05-22 04:20:31] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 04:20:31] [INFO ] Invariant cache hit.
[2024-05-22 04:20:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:20:31] [INFO ] Implicit Places using invariants and state equation in 454 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 623 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/64 places, 284/284 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 283
Applied a total of 2 rules in 15 ms. Remains 61 /62 variables (removed 1) and now considering 283/284 (removed 1) transitions.
// Phase 1: matrix 283 rows 61 cols
[2024-05-22 04:20:31] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 04:20:31] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 04:20:31] [INFO ] Invariant cache hit.
[2024-05-22 04:20:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:20:31] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/64 places, 283/284 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1121 ms. Remains : 61/64 places, 283/284 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Detected a total of 7/61 stabilizing places and 8/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 338 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1820 resets) in 208 ms. (191 steps per ms) remains 1/8 properties
BEST_FIRST walk for 14133 steps (77 resets) in 78 ms. (178 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 649 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 68 reset in 68 ms.
Product exploration explored 100000 steps with 106 reset in 213 ms.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 283/283 transitions.
Applied a total of 0 rules in 10 ms. Remains 61 /61 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2024-05-22 04:20:33] [INFO ] Invariant cache hit.
[2024-05-22 04:20:33] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 04:20:33] [INFO ] Invariant cache hit.
[2024-05-22 04:20:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:20:34] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-22 04:20:34] [INFO ] Redundant transitions in 30 ms returned [175]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 281 sub problems to find dead transitions.
// Phase 1: matrix 282 rows 61 cols
[2024-05-22 04:20:34] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 04:20:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-22 04:20:37] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2024-05-22 04:20:38] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-22 04:20:38] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 281/342 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-22 04:20:41] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-22 04:20:41] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 84 constraints, problems are : Problem set: 0 solved, 281 unsolved in 14105 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 281/342 variables, 61/83 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 281/364 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-22 04:20:57] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-22 04:20:58] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 367 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 16/16 constraints]
After SMT, in 45456ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 45460ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/61 places, 282/283 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 59 transition count 280
Applied a total of 4 rules in 18 ms. Remains 59 /61 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 59 cols
[2024-05-22 04:21:19] [INFO ] Computed 8 invariants in 7 ms
[2024-05-22 04:21:19] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 04:21:19] [INFO ] Invariant cache hit.
[2024-05-22 04:21:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:21:20] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/61 places, 280/283 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46275 ms. Remains : 59/61 places, 280/283 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-03 finished in 52206 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&&X(G(p1))))))'
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 30 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-22 04:21:20] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 04:21:20] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-22 04:21:20] [INFO ] Invariant cache hit.
[2024-05-22 04:21:21] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-22 04:21:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:21:34] [INFO ] Deduced a trap composed of 17 places in 507 ms of which 5 ms to minimize.
[2024-05-22 04:21:35] [INFO ] Deduced a trap composed of 35 places in 463 ms of which 4 ms to minimize.
[2024-05-22 04:21:35] [INFO ] Deduced a trap composed of 37 places in 443 ms of which 4 ms to minimize.
[2024-05-22 04:21:36] [INFO ] Deduced a trap composed of 34 places in 433 ms of which 4 ms to minimize.
[2024-05-22 04:21:37] [INFO ] Deduced a trap composed of 25 places in 481 ms of which 5 ms to minimize.
[2024-05-22 04:21:37] [INFO ] Deduced a trap composed of 14 places in 430 ms of which 4 ms to minimize.
[2024-05-22 04:21:37] [INFO ] Deduced a trap composed of 36 places in 394 ms of which 3 ms to minimize.
[2024-05-22 04:21:38] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 3 ms to minimize.
[2024-05-22 04:21:38] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 3 ms to minimize.
[2024-05-22 04:21:38] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 3 ms to minimize.
[2024-05-22 04:21:38] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 3 ms to minimize.
[2024-05-22 04:21:39] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 2 ms to minimize.
[2024-05-22 04:21:39] [INFO ] Deduced a trap composed of 49 places in 277 ms of which 3 ms to minimize.
[2024-05-22 04:21:39] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 3 ms to minimize.
[2024-05-22 04:21:40] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 3 ms to minimize.
[2024-05-22 04:21:40] [INFO ] Deduced a trap composed of 31 places in 303 ms of which 3 ms to minimize.
[2024-05-22 04:21:41] [INFO ] Deduced a trap composed of 41 places in 342 ms of which 4 ms to minimize.
[2024-05-22 04:21:41] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 4 ms to minimize.
[2024-05-22 04:21:41] [INFO ] Deduced a trap composed of 43 places in 276 ms of which 4 ms to minimize.
[2024-05-22 04:21:41] [INFO ] Deduced a trap composed of 41 places in 289 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:21:42] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-22 04:21:44] [INFO ] Deduced a trap composed of 24 places in 462 ms of which 4 ms to minimize.
[2024-05-22 04:21:44] [INFO ] Deduced a trap composed of 75 places in 441 ms of which 4 ms to minimize.
[2024-05-22 04:21:45] [INFO ] Deduced a trap composed of 43 places in 444 ms of which 4 ms to minimize.
[2024-05-22 04:21:45] [INFO ] Deduced a trap composed of 59 places in 456 ms of which 5 ms to minimize.
[2024-05-22 04:21:46] [INFO ] Deduced a trap composed of 39 places in 432 ms of which 4 ms to minimize.
[2024-05-22 04:21:46] [INFO ] Deduced a trap composed of 31 places in 426 ms of which 5 ms to minimize.
[2024-05-22 04:21:47] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 4 ms to minimize.
[2024-05-22 04:21:47] [INFO ] Deduced a trap composed of 42 places in 421 ms of which 4 ms to minimize.
[2024-05-22 04:21:47] [INFO ] Deduced a trap composed of 27 places in 420 ms of which 4 ms to minimize.
[2024-05-22 04:21:48] [INFO ] Deduced a trap composed of 38 places in 405 ms of which 4 ms to minimize.
[2024-05-22 04:21:48] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 4 ms to minimize.
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 3 ms to minimize.
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 44 places in 431 ms of which 4 ms to minimize.
[2024-05-22 04:21:50] [INFO ] Deduced a trap composed of 40 places in 433 ms of which 4 ms to minimize.
[2024-05-22 04:21:50] [INFO ] Deduced a trap composed of 45 places in 413 ms of which 4 ms to minimize.
[2024-05-22 04:21:50] [INFO ] Deduced a trap composed of 46 places in 419 ms of which 4 ms to minimize.
[2024-05-22 04:21:51] [INFO ] Deduced a trap composed of 47 places in 393 ms of which 4 ms to minimize.
[2024-05-22 04:21:51] [INFO ] Deduced a trap composed of 44 places in 366 ms of which 3 ms to minimize.
[2024-05-22 04:21:52] [INFO ] Deduced a trap composed of 40 places in 389 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:22:01] [INFO ] Deduced a trap composed of 31 places in 377 ms of which 4 ms to minimize.
[2024-05-22 04:22:01] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 4 ms to minimize.
[2024-05-22 04:22:01] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 4 ms to minimize.
[2024-05-22 04:22:02] [INFO ] Deduced a trap composed of 32 places in 343 ms of which 4 ms to minimize.
[2024-05-22 04:22:02] [INFO ] Deduced a trap composed of 38 places in 355 ms of which 4 ms to minimize.
[2024-05-22 04:22:03] [INFO ] Deduced a trap composed of 52 places in 440 ms of which 4 ms to minimize.
[2024-05-22 04:22:03] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 3 ms to minimize.
[2024-05-22 04:22:03] [INFO ] Deduced a trap composed of 41 places in 255 ms of which 4 ms to minimize.
[2024-05-22 04:22:04] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 3 ms to minimize.
[2024-05-22 04:22:04] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 3 ms to minimize.
[2024-05-22 04:22:04] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 3 ms to minimize.
[2024-05-22 04:22:04] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 2 ms to minimize.
[2024-05-22 04:22:05] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 3 ms to minimize.
[2024-05-22 04:22:05] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 3 ms to minimize.
[2024-05-22 04:22:06] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 3 ms to minimize.
[2024-05-22 04:22:06] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 2 ms to minimize.
[2024-05-22 04:22:06] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 2 ms to minimize.
[2024-05-22 04:22:07] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 3 ms to minimize.
[2024-05-22 04:22:07] [INFO ] Deduced a trap composed of 43 places in 285 ms of which 3 ms to minimize.
[2024-05-22 04:22:07] [INFO ] Deduced a trap composed of 38 places in 287 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:22:08] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-05-22 04:22:09] [INFO ] Deduced a trap composed of 41 places in 404 ms of which 4 ms to minimize.
[2024-05-22 04:22:10] [INFO ] Deduced a trap composed of 40 places in 385 ms of which 4 ms to minimize.
[2024-05-22 04:22:11] [INFO ] Deduced a trap composed of 41 places in 375 ms of which 4 ms to minimize.
[2024-05-22 04:22:11] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 2 ms to minimize.
[2024-05-22 04:22:11] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 3 ms to minimize.
[2024-05-22 04:22:12] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2024-05-22 04:22:12] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 2 ms to minimize.
[2024-05-22 04:22:12] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 3 ms to minimize.
[2024-05-22 04:22:13] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 3 ms to minimize.
[2024-05-22 04:22:13] [INFO ] Deduced a trap composed of 58 places in 336 ms of which 4 ms to minimize.
[2024-05-22 04:22:14] [INFO ] Deduced a trap composed of 56 places in 378 ms of which 4 ms to minimize.
[2024-05-22 04:22:15] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 4 ms to minimize.
[2024-05-22 04:22:15] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 3 ms to minimize.
[2024-05-22 04:22:15] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 4 ms to minimize.
[2024-05-22 04:22:16] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 3 ms to minimize.
[2024-05-22 04:22:16] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:22:23] [INFO ] Deduced a trap composed of 31 places in 337 ms of which 3 ms to minimize.
[2024-05-22 04:22:23] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/853 variables, and 91 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 79/79 constraints]
After SMT, in 62474ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 62484ms
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63271 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-04 finished in 63487 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||(p0 U X(G(p1))))) U p2))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 265 edges and 285 vertex of which 4 / 285 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 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 282 transition count 697
Reduce places removed 108 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 146 rules applied. Total rules applied 255 place count 174 transition count 659
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 279 place count 152 transition count 657
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 281 place count 150 transition count 657
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 281 place count 150 transition count 650
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 295 place count 143 transition count 650
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 305 place count 133 transition count 640
Iterating global reduction 4 with 10 rules applied. Total rules applied 315 place count 133 transition count 640
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 4 with 196 rules applied. Total rules applied 511 place count 133 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 511 place count 133 transition count 443
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 513 place count 132 transition count 443
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 514 place count 131 transition count 442
Iterating global reduction 5 with 1 rules applied. Total rules applied 515 place count 131 transition count 442
Performed 55 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 625 place count 76 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 626 place count 76 transition count 385
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 639 place count 63 transition count 287
Iterating global reduction 6 with 13 rules applied. Total rules applied 652 place count 63 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 657 place count 63 transition count 282
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 7 with 2 rules applied. Total rules applied 659 place count 62 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 660 place count 62 transition count 280
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 661 place count 62 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 663 place count 60 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 664 place count 59 transition count 278
Applied a total of 664 rules in 171 ms. Remains 59 /285 variables (removed 226) and now considering 278/808 (removed 530) transitions.
// Phase 1: matrix 278 rows 59 cols
[2024-05-22 04:22:24] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 04:22:24] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 04:22:24] [INFO ] Invariant cache hit.
[2024-05-22 04:22:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:22:24] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [54, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 492 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/285 places, 278/808 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 277
Applied a total of 2 rules in 17 ms. Remains 56 /57 variables (removed 1) and now considering 277/278 (removed 1) transitions.
// Phase 1: matrix 277 rows 56 cols
[2024-05-22 04:22:24] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 04:22:24] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 04:22:24] [INFO ] Invariant cache hit.
[2024-05-22 04:22:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:22:24] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/285 places, 277/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1146 ms. Remains : 56/285 places, 277/808 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-06
Stuttering criterion allowed to conclude after 27 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-06 finished in 1281 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 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 270 edges and 285 vertex of which 4 / 285 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 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 282 transition count 694
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 152 rules applied. Total rules applied 264 place count 171 transition count 653
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 288 place count 147 transition count 653
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 288 place count 147 transition count 646
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 302 place count 140 transition count 646
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 312 place count 130 transition count 636
Iterating global reduction 3 with 10 rules applied. Total rules applied 322 place count 130 transition count 636
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 518 place count 130 transition count 440
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 518 place count 130 transition count 439
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 520 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 521 place count 128 transition count 432
Iterating global reduction 4 with 1 rules applied. Total rules applied 522 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 524 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 525 place count 127 transition count 430
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 631 place count 74 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 632 place count 74 transition count 375
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 645 place count 61 transition count 277
Iterating global reduction 7 with 13 rules applied. Total rules applied 658 place count 61 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 664 place count 61 transition count 271
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 8 with 2 rules applied. Total rules applied 666 place count 60 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 668 place count 59 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 670 place count 57 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 671 place count 56 transition count 268
Applied a total of 671 rules in 106 ms. Remains 56 /285 variables (removed 229) and now considering 268/808 (removed 540) transitions.
// Phase 1: matrix 268 rows 56 cols
[2024-05-22 04:22:25] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 04:22:25] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 04:22:25] [INFO ] Invariant cache hit.
[2024-05-22 04:22:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:22:25] [INFO ] Implicit Places using invariants and state equation in 314 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 497 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/285 places, 268/808 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 267
Applied a total of 2 rules in 17 ms. Remains 54 /55 variables (removed 1) and now considering 267/268 (removed 1) transitions.
// Phase 1: matrix 267 rows 54 cols
[2024-05-22 04:22:25] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 04:22:25] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 04:22:25] [INFO ] Invariant cache hit.
[2024-05-22 04:22:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:22:26] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/285 places, 267/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1122 ms. Remains : 54/285 places, 267/808 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-07
Product exploration explored 100000 steps with 29 reset in 208 ms.
Product exploration explored 100000 steps with 204 reset in 234 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/54 stabilizing places and 7/267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 249 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)]
RANDOM walk for 7 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 293 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 267/267 transitions.
Applied a total of 0 rules in 14 ms. Remains 54 /54 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-22 04:22:27] [INFO ] Invariant cache hit.
[2024-05-22 04:22:27] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 04:22:27] [INFO ] Invariant cache hit.
[2024-05-22 04:22:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:22:27] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-22 04:22:27] [INFO ] Redundant transitions in 7 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-22 04:22:28] [INFO ] Invariant cache hit.
[2024-05-22 04:22:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 04:22:30] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2024-05-22 04:22:31] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 04:22:33] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2024-05-22 04:22:33] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Problem TDEAD164 is UNSAT
At refinement iteration 6 (OVERLAPS) 266/320 variables, 54/67 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 1/321 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 0/321 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 69 constraints, problems are : Problem set: 1 solved, 264 unsolved in 14747 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 266/320 variables, 54/67 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 264/332 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 1/321 variables, 1/333 constraints. Problems are: Problem set: 1 solved, 264 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 333 constraints, problems are : Problem set: 1 solved, 264 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 264/265 constraints, Known Traps: 4/4 constraints]
After SMT, in 46423ms problems are : Problem set: 1 solved, 264 unsolved
Search for dead transitions found 1 dead transitions in 46428ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 54/54 places, 266/267 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 8 ms. Remains 53 /54 variables (removed 1) and now considering 265/266 (removed 1) transitions.
[2024-05-22 04:23:14] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 46964 ms. Remains : 53/54 places, 265/267 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/53 stabilizing places and 5/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 140 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 29 reset in 96 ms.
Product exploration explored 100000 steps with 57 reset in 216 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 265/265 transitions.
Applied a total of 0 rules in 12 ms. Remains 53 /53 variables (removed 0) and now considering 265/265 (removed 0) transitions.
// Phase 1: matrix 265 rows 53 cols
[2024-05-22 04:23:15] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 04:23:15] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 04:23:15] [INFO ] Invariant cache hit.
[2024-05-22 04:23:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:23:15] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-22 04:23:15] [INFO ] Redundant transitions in 2 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-22 04:23:15] [INFO ] Invariant cache hit.
[2024-05-22 04:23:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 04:23:17] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 04:23:18] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 1/53 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 04:23:22] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 2 ms to minimize.
[2024-05-22 04:23:22] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 264/317 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 1/318 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 12 (OVERLAPS) 0/318 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 68 constraints, problems are : Problem set: 0 solved, 264 unsolved in 18029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 264/317 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 264/331 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 1/318 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 332 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 4/4 constraints]
After SMT, in 49280ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 49284ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49712 ms. Remains : 53/53 places, 265/265 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-07 finished in 99841 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||X(G(p0)))))'
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 18 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-22 04:24:04] [INFO ] Computed 12 invariants in 10 ms
[2024-05-22 04:24:05] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-22 04:24:05] [INFO ] Invariant cache hit.
[2024-05-22 04:24:05] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-22 04:24:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:24:19] [INFO ] Deduced a trap composed of 17 places in 484 ms of which 5 ms to minimize.
[2024-05-22 04:24:19] [INFO ] Deduced a trap composed of 35 places in 436 ms of which 5 ms to minimize.
[2024-05-22 04:24:20] [INFO ] Deduced a trap composed of 37 places in 430 ms of which 4 ms to minimize.
[2024-05-22 04:24:20] [INFO ] Deduced a trap composed of 34 places in 390 ms of which 4 ms to minimize.
[2024-05-22 04:24:21] [INFO ] Deduced a trap composed of 25 places in 475 ms of which 4 ms to minimize.
[2024-05-22 04:24:22] [INFO ] Deduced a trap composed of 14 places in 455 ms of which 4 ms to minimize.
[2024-05-22 04:24:22] [INFO ] Deduced a trap composed of 36 places in 457 ms of which 4 ms to minimize.
[2024-05-22 04:24:22] [INFO ] Deduced a trap composed of 35 places in 437 ms of which 4 ms to minimize.
[2024-05-22 04:24:23] [INFO ] Deduced a trap composed of 36 places in 431 ms of which 5 ms to minimize.
[2024-05-22 04:24:23] [INFO ] Deduced a trap composed of 42 places in 437 ms of which 4 ms to minimize.
[2024-05-22 04:24:24] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 4 ms to minimize.
[2024-05-22 04:24:24] [INFO ] Deduced a trap composed of 36 places in 505 ms of which 4 ms to minimize.
[2024-05-22 04:24:25] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 3 ms to minimize.
[2024-05-22 04:24:25] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 3 ms to minimize.
[2024-05-22 04:24:25] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 4 ms to minimize.
[2024-05-22 04:24:26] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 4 ms to minimize.
[2024-05-22 04:24:26] [INFO ] Deduced a trap composed of 41 places in 393 ms of which 4 ms to minimize.
[2024-05-22 04:24:27] [INFO ] Deduced a trap composed of 42 places in 310 ms of which 3 ms to minimize.
[2024-05-22 04:24:27] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 3 ms to minimize.
[2024-05-22 04:24:27] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:24:28] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-05-22 04:24:30] [INFO ] Deduced a trap composed of 24 places in 457 ms of which 4 ms to minimize.
[2024-05-22 04:24:30] [INFO ] Deduced a trap composed of 75 places in 443 ms of which 4 ms to minimize.
[2024-05-22 04:24:31] [INFO ] Deduced a trap composed of 43 places in 430 ms of which 4 ms to minimize.
[2024-05-22 04:24:31] [INFO ] Deduced a trap composed of 59 places in 426 ms of which 4 ms to minimize.
[2024-05-22 04:24:31] [INFO ] Deduced a trap composed of 39 places in 379 ms of which 3 ms to minimize.
[2024-05-22 04:24:32] [INFO ] Deduced a trap composed of 31 places in 376 ms of which 3 ms to minimize.
[2024-05-22 04:24:32] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 2 ms to minimize.
[2024-05-22 04:24:32] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 2 ms to minimize.
[2024-05-22 04:24:33] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 3 ms to minimize.
[2024-05-22 04:24:33] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 2 ms to minimize.
[2024-05-22 04:24:33] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 2 ms to minimize.
[2024-05-22 04:24:33] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 2 ms to minimize.
[2024-05-22 04:24:34] [INFO ] Deduced a trap composed of 44 places in 257 ms of which 3 ms to minimize.
[2024-05-22 04:24:34] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 2 ms to minimize.
[2024-05-22 04:24:34] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 3 ms to minimize.
[2024-05-22 04:24:34] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
[2024-05-22 04:24:35] [INFO ] Deduced a trap composed of 47 places in 392 ms of which 4 ms to minimize.
[2024-05-22 04:24:35] [INFO ] Deduced a trap composed of 44 places in 357 ms of which 3 ms to minimize.
[2024-05-22 04:24:36] [INFO ] Deduced a trap composed of 40 places in 340 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:24:45] [INFO ] Deduced a trap composed of 31 places in 379 ms of which 4 ms to minimize.
[2024-05-22 04:24:45] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 4 ms to minimize.
[2024-05-22 04:24:45] [INFO ] Deduced a trap composed of 31 places in 365 ms of which 4 ms to minimize.
[2024-05-22 04:24:46] [INFO ] Deduced a trap composed of 32 places in 343 ms of which 4 ms to minimize.
[2024-05-22 04:24:46] [INFO ] Deduced a trap composed of 38 places in 335 ms of which 3 ms to minimize.
[2024-05-22 04:24:47] [INFO ] Deduced a trap composed of 52 places in 437 ms of which 4 ms to minimize.
[2024-05-22 04:24:47] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 4 ms to minimize.
[2024-05-22 04:24:47] [INFO ] Deduced a trap composed of 41 places in 300 ms of which 4 ms to minimize.
[2024-05-22 04:24:48] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 3 ms to minimize.
[2024-05-22 04:24:48] [INFO ] Deduced a trap composed of 46 places in 266 ms of which 3 ms to minimize.
[2024-05-22 04:24:48] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 3 ms to minimize.
[2024-05-22 04:24:49] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 2 ms to minimize.
[2024-05-22 04:24:49] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 3 ms to minimize.
[2024-05-22 04:24:49] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 3 ms to minimize.
[2024-05-22 04:24:50] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 3 ms to minimize.
[2024-05-22 04:24:50] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 2 ms to minimize.
[2024-05-22 04:24:50] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
[2024-05-22 04:24:50] [INFO ] Deduced a trap composed of 52 places in 291 ms of which 3 ms to minimize.
[2024-05-22 04:24:51] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 3 ms to minimize.
[2024-05-22 04:24:51] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:24:52] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2024-05-22 04:24:53] [INFO ] Deduced a trap composed of 41 places in 405 ms of which 4 ms to minimize.
[2024-05-22 04:24:54] [INFO ] Deduced a trap composed of 40 places in 392 ms of which 4 ms to minimize.
[2024-05-22 04:24:55] [INFO ] Deduced a trap composed of 41 places in 380 ms of which 4 ms to minimize.
[2024-05-22 04:24:55] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 4 ms to minimize.
[2024-05-22 04:24:56] [INFO ] Deduced a trap composed of 52 places in 378 ms of which 5 ms to minimize.
[2024-05-22 04:24:56] [INFO ] Deduced a trap composed of 31 places in 323 ms of which 4 ms to minimize.
[2024-05-22 04:24:57] [INFO ] Deduced a trap composed of 42 places in 326 ms of which 3 ms to minimize.
[2024-05-22 04:24:57] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 3 ms to minimize.
[2024-05-22 04:24:58] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 3 ms to minimize.
[2024-05-22 04:24:58] [INFO ] Deduced a trap composed of 58 places in 363 ms of which 4 ms to minimize.
[2024-05-22 04:24:59] [INFO ] Deduced a trap composed of 56 places in 375 ms of which 4 ms to minimize.
[2024-05-22 04:24:59] [INFO ] Deduced a trap composed of 26 places in 386 ms of which 4 ms to minimize.
[2024-05-22 04:25:00] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 3 ms to minimize.
[2024-05-22 04:25:00] [INFO ] Deduced a trap composed of 10 places in 398 ms of which 4 ms to minimize.
[2024-05-22 04:25:00] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 4 ms to minimize.
[2024-05-22 04:25:01] [INFO ] Deduced a trap composed of 28 places in 431 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:25:07] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 4 ms to minimize.
[2024-05-22 04:25:08] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 4 ms to minimize.
SMT process timed out in 62363ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 62376ms
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63275 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-08 finished in 63469 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 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 27 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
[2024-05-22 04:25:08] [INFO ] Invariant cache hit.
[2024-05-22 04:25:08] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-22 04:25:08] [INFO ] Invariant cache hit.
[2024-05-22 04:25:09] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-22 04:25:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:25:23] [INFO ] Deduced a trap composed of 17 places in 461 ms of which 4 ms to minimize.
[2024-05-22 04:25:23] [INFO ] Deduced a trap composed of 35 places in 352 ms of which 2 ms to minimize.
[2024-05-22 04:25:23] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 3 ms to minimize.
[2024-05-22 04:25:24] [INFO ] Deduced a trap composed of 34 places in 356 ms of which 4 ms to minimize.
[2024-05-22 04:25:24] [INFO ] Deduced a trap composed of 25 places in 476 ms of which 5 ms to minimize.
[2024-05-22 04:25:25] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 3 ms to minimize.
[2024-05-22 04:25:25] [INFO ] Deduced a trap composed of 36 places in 260 ms of which 2 ms to minimize.
[2024-05-22 04:25:25] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-05-22 04:25:26] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 2 ms to minimize.
[2024-05-22 04:25:26] [INFO ] Deduced a trap composed of 42 places in 258 ms of which 2 ms to minimize.
[2024-05-22 04:25:26] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 3 ms to minimize.
[2024-05-22 04:25:26] [INFO ] Deduced a trap composed of 36 places in 238 ms of which 3 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 49 places in 435 ms of which 4 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 18 places in 397 ms of which 4 ms to minimize.
[2024-05-22 04:25:28] [INFO ] Deduced a trap composed of 24 places in 430 ms of which 5 ms to minimize.
[2024-05-22 04:25:28] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 3 ms to minimize.
[2024-05-22 04:25:29] [INFO ] Deduced a trap composed of 41 places in 331 ms of which 2 ms to minimize.
[2024-05-22 04:25:29] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 2 ms to minimize.
[2024-05-22 04:25:29] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 2 ms to minimize.
[2024-05-22 04:25:29] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:25:30] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-22 04:25:31] [INFO ] Deduced a trap composed of 24 places in 414 ms of which 5 ms to minimize.
[2024-05-22 04:25:32] [INFO ] Deduced a trap composed of 75 places in 449 ms of which 4 ms to minimize.
[2024-05-22 04:25:32] [INFO ] Deduced a trap composed of 43 places in 425 ms of which 4 ms to minimize.
[2024-05-22 04:25:33] [INFO ] Deduced a trap composed of 59 places in 442 ms of which 5 ms to minimize.
[2024-05-22 04:25:33] [INFO ] Deduced a trap composed of 39 places in 438 ms of which 5 ms to minimize.
[2024-05-22 04:25:34] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 4 ms to minimize.
[2024-05-22 04:25:34] [INFO ] Deduced a trap composed of 22 places in 435 ms of which 4 ms to minimize.
[2024-05-22 04:25:35] [INFO ] Deduced a trap composed of 42 places in 478 ms of which 4 ms to minimize.
[2024-05-22 04:25:35] [INFO ] Deduced a trap composed of 27 places in 423 ms of which 4 ms to minimize.
[2024-05-22 04:25:35] [INFO ] Deduced a trap composed of 38 places in 347 ms of which 3 ms to minimize.
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 2 ms to minimize.
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 2 ms to minimize.
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 3 ms to minimize.
[2024-05-22 04:25:37] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 2 ms to minimize.
[2024-05-22 04:25:37] [INFO ] Deduced a trap composed of 45 places in 254 ms of which 3 ms to minimize.
[2024-05-22 04:25:37] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 3 ms to minimize.
[2024-05-22 04:25:37] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 3 ms to minimize.
[2024-05-22 04:25:38] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 2 ms to minimize.
[2024-05-22 04:25:38] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:25:48] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 4 ms to minimize.
[2024-05-22 04:25:49] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 4 ms to minimize.
[2024-05-22 04:25:49] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 4 ms to minimize.
[2024-05-22 04:25:50] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 4 ms to minimize.
[2024-05-22 04:25:50] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 4 ms to minimize.
[2024-05-22 04:25:51] [INFO ] Deduced a trap composed of 52 places in 456 ms of which 4 ms to minimize.
[2024-05-22 04:25:51] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 3 ms to minimize.
[2024-05-22 04:25:51] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 3 ms to minimize.
[2024-05-22 04:25:52] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 3 ms to minimize.
[2024-05-22 04:25:52] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 3 ms to minimize.
[2024-05-22 04:25:52] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 3 ms to minimize.
[2024-05-22 04:25:52] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 3 ms to minimize.
[2024-05-22 04:25:53] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 3 ms to minimize.
[2024-05-22 04:25:53] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 3 ms to minimize.
[2024-05-22 04:25:53] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2024-05-22 04:25:54] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 3 ms to minimize.
[2024-05-22 04:25:54] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 3 ms to minimize.
[2024-05-22 04:25:54] [INFO ] Deduced a trap composed of 52 places in 277 ms of which 3 ms to minimize.
[2024-05-22 04:25:55] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 3 ms to minimize.
[2024-05-22 04:25:55] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:25:56] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2024-05-22 04:25:57] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 4 ms to minimize.
[2024-05-22 04:25:58] [INFO ] Deduced a trap composed of 40 places in 388 ms of which 4 ms to minimize.
[2024-05-22 04:25:58] [INFO ] Deduced a trap composed of 41 places in 323 ms of which 3 ms to minimize.
[2024-05-22 04:25:59] [INFO ] Deduced a trap composed of 42 places in 306 ms of which 3 ms to minimize.
[2024-05-22 04:25:59] [INFO ] Deduced a trap composed of 52 places in 364 ms of which 4 ms to minimize.
[2024-05-22 04:26:00] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 4 ms to minimize.
[2024-05-22 04:26:00] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 4 ms to minimize.
[2024-05-22 04:26:01] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 3 ms to minimize.
[2024-05-22 04:26:01] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 2 ms to minimize.
[2024-05-22 04:26:02] [INFO ] Deduced a trap composed of 58 places in 370 ms of which 3 ms to minimize.
[2024-05-22 04:26:03] [INFO ] Deduced a trap composed of 56 places in 369 ms of which 4 ms to minimize.
[2024-05-22 04:26:03] [INFO ] Deduced a trap composed of 26 places in 377 ms of which 4 ms to minimize.
[2024-05-22 04:26:04] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 3 ms to minimize.
[2024-05-22 04:26:04] [INFO ] Deduced a trap composed of 10 places in 411 ms of which 4 ms to minimize.
[2024-05-22 04:26:04] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 3 ms to minimize.
[2024-05-22 04:26:05] [INFO ] Deduced a trap composed of 28 places in 411 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/853 variables, and 89 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 77/77 constraints]
After SMT, in 62247ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 62265ms
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63187 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-09 finished in 63331 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((F(p0)&&X(p1))))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 270 transition count 793
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 270 transition count 793
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 226 place count 270 transition count 597
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 231 place count 265 transition count 592
Iterating global reduction 1 with 5 rules applied. Total rules applied 236 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 237 place count 264 transition count 591
Iterating global reduction 1 with 1 rules applied. Total rules applied 238 place count 264 transition count 591
Applied a total of 238 rules in 56 ms. Remains 264 /285 variables (removed 21) and now considering 591/808 (removed 217) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-22 04:26:11] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 04:26:12] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 04:26:12] [INFO ] Invariant cache hit.
[2024-05-22 04:26:12] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-22 04:26:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:26:24] [INFO ] Deduced a trap composed of 24 places in 362 ms of which 5 ms to minimize.
[2024-05-22 04:26:25] [INFO ] Deduced a trap composed of 20 places in 452 ms of which 4 ms to minimize.
[2024-05-22 04:26:25] [INFO ] Deduced a trap composed of 14 places in 349 ms of which 3 ms to minimize.
[2024-05-22 04:26:25] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 3 ms to minimize.
[2024-05-22 04:26:26] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
[2024-05-22 04:26:26] [INFO ] Deduced a trap composed of 19 places in 447 ms of which 4 ms to minimize.
[2024-05-22 04:26:26] [INFO ] Deduced a trap composed of 23 places in 434 ms of which 4 ms to minimize.
[2024-05-22 04:26:27] [INFO ] Deduced a trap composed of 63 places in 419 ms of which 4 ms to minimize.
[2024-05-22 04:26:27] [INFO ] Deduced a trap composed of 22 places in 378 ms of which 4 ms to minimize.
[2024-05-22 04:26:28] [INFO ] Deduced a trap composed of 25 places in 464 ms of which 4 ms to minimize.
[2024-05-22 04:26:29] [INFO ] Deduced a trap composed of 40 places in 419 ms of which 4 ms to minimize.
[2024-05-22 04:26:29] [INFO ] Deduced a trap composed of 41 places in 435 ms of which 4 ms to minimize.
[2024-05-22 04:26:29] [INFO ] Deduced a trap composed of 43 places in 442 ms of which 4 ms to minimize.
[2024-05-22 04:26:30] [INFO ] Deduced a trap composed of 43 places in 418 ms of which 4 ms to minimize.
[2024-05-22 04:26:30] [INFO ] Deduced a trap composed of 45 places in 439 ms of which 4 ms to minimize.
[2024-05-22 04:26:31] [INFO ] Deduced a trap composed of 42 places in 440 ms of which 4 ms to minimize.
[2024-05-22 04:26:31] [INFO ] Deduced a trap composed of 46 places in 456 ms of which 4 ms to minimize.
[2024-05-22 04:26:32] [INFO ] Deduced a trap composed of 31 places in 444 ms of which 4 ms to minimize.
[2024-05-22 04:26:32] [INFO ] Deduced a trap composed of 27 places in 445 ms of which 4 ms to minimize.
[2024-05-22 04:26:33] [INFO ] Deduced a trap composed of 45 places in 430 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:26:33] [INFO ] Deduced a trap composed of 38 places in 408 ms of which 4 ms to minimize.
[2024-05-22 04:26:34] [INFO ] Deduced a trap composed of 48 places in 419 ms of which 4 ms to minimize.
[2024-05-22 04:26:34] [INFO ] Deduced a trap composed of 55 places in 410 ms of which 4 ms to minimize.
[2024-05-22 04:26:35] [INFO ] Deduced a trap composed of 35 places in 412 ms of which 4 ms to minimize.
[2024-05-22 04:26:35] [INFO ] Deduced a trap composed of 39 places in 379 ms of which 4 ms to minimize.
[2024-05-22 04:26:35] [INFO ] Deduced a trap composed of 46 places in 404 ms of which 4 ms to minimize.
[2024-05-22 04:26:36] [INFO ] Deduced a trap composed of 40 places in 417 ms of which 4 ms to minimize.
[2024-05-22 04:26:36] [INFO ] Deduced a trap composed of 41 places in 404 ms of which 4 ms to minimize.
[2024-05-22 04:26:37] [INFO ] Deduced a trap composed of 37 places in 397 ms of which 3 ms to minimize.
[2024-05-22 04:26:38] [INFO ] Deduced a trap composed of 50 places in 433 ms of which 4 ms to minimize.
[2024-05-22 04:26:39] [INFO ] Deduced a trap composed of 60 places in 408 ms of which 4 ms to minimize.
[2024-05-22 04:26:39] [INFO ] Deduced a trap composed of 32 places in 396 ms of which 4 ms to minimize.
[2024-05-22 04:26:39] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 4 ms to minimize.
[2024-05-22 04:26:40] [INFO ] Deduced a trap composed of 48 places in 501 ms of which 3 ms to minimize.
[2024-05-22 04:26:40] [INFO ] Deduced a trap composed of 45 places in 373 ms of which 4 ms to minimize.
[2024-05-22 04:26:41] [INFO ] Deduced a trap composed of 43 places in 418 ms of which 4 ms to minimize.
[2024-05-22 04:26:41] [INFO ] Deduced a trap composed of 53 places in 441 ms of which 4 ms to minimize.
[2024-05-22 04:26:42] [INFO ] Deduced a trap composed of 52 places in 415 ms of which 4 ms to minimize.
[2024-05-22 04:26:42] [INFO ] Deduced a trap composed of 44 places in 293 ms of which 3 ms to minimize.
[2024-05-22 04:26:42] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 3 ms to minimize.
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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:26:51] [INFO ] Deduced a trap composed of 46 places in 400 ms of which 4 ms to minimize.
[2024-05-22 04:26:52] [INFO ] Deduced a trap composed of 32 places in 376 ms of which 3 ms to minimize.
[2024-05-22 04:26:53] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 4 ms to minimize.
[2024-05-22 04:26:53] [INFO ] Deduced a trap composed of 41 places in 380 ms of which 4 ms to minimize.
[2024-05-22 04:26:53] [INFO ] Deduced a trap composed of 32 places in 388 ms of which 4 ms to minimize.
[2024-05-22 04:26:54] [INFO ] Deduced a trap composed of 41 places in 376 ms of which 4 ms to minimize.
[2024-05-22 04:26:54] [INFO ] Deduced a trap composed of 60 places in 372 ms of which 4 ms to minimize.
[2024-05-22 04:26:55] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 3 ms to minimize.
[2024-05-22 04:26:55] [INFO ] Deduced a trap composed of 46 places in 297 ms of which 3 ms to minimize.
[2024-05-22 04:26:55] [INFO ] Deduced a trap composed of 41 places in 286 ms of which 3 ms to minimize.
[2024-05-22 04:26:56] [INFO ] Deduced a trap composed of 48 places in 369 ms of which 4 ms to minimize.
[2024-05-22 04:26:56] [INFO ] Deduced a trap composed of 43 places in 314 ms of which 3 ms to minimize.
[2024-05-22 04:26:57] [INFO ] Deduced a trap composed of 41 places in 281 ms of which 3 ms to minimize.
[2024-05-22 04:26:57] [INFO ] Deduced a trap composed of 45 places in 398 ms of which 4 ms to minimize.
[2024-05-22 04:26:57] [INFO ] Deduced a trap composed of 45 places in 399 ms of which 4 ms to minimize.
[2024-05-22 04:26:58] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 3 ms to minimize.
[2024-05-22 04:26:58] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 4 ms to minimize.
[2024-05-22 04:26:59] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 3 ms to minimize.
[2024-05-22 04:26:59] [INFO ] Deduced a trap composed of 38 places in 382 ms of which 4 ms to minimize.
[2024-05-22 04:27:00] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:27:01] [INFO ] Deduced a trap composed of 42 places in 338 ms of which 4 ms to minimize.
[2024-05-22 04:27:02] [INFO ] Deduced a trap composed of 32 places in 396 ms of which 3 ms to minimize.
[2024-05-22 04:27:04] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 2 ms to minimize.
[2024-05-22 04:27:04] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2024-05-22 04:27:06] [INFO ] Deduced a trap composed of 23 places in 405 ms of which 4 ms to minimize.
[2024-05-22 04:27:06] [INFO ] Deduced a trap composed of 25 places in 368 ms of which 4 ms to minimize.
[2024-05-22 04:27:06] [INFO ] Deduced a trap composed of 22 places in 392 ms of which 4 ms to minimize.
[2024-05-22 04:27:07] [INFO ] Deduced a trap composed of 25 places in 366 ms of which 3 ms to minimize.
[2024-05-22 04:27:07] [INFO ] Deduced a trap composed of 24 places in 370 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:27:13] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 2 ms to minimize.
[2024-05-22 04:27:14] [INFO ] Deduced a trap composed of 28 places in 367 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/855 variables, and 83 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 71/71 constraints]
After SMT, in 62224ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62231ms
Starting structural reductions in LTL mode, iteration 1 : 264/285 places, 591/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62866 ms. Remains : 264/285 places, 591/808 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 437 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLCardinality-10 finished in 63856 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 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 268 edges and 285 vertex of which 4 / 285 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 282 transition count 695
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 150 rules applied. Total rules applied 261 place count 172 transition count 655
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 285 place count 148 transition count 655
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 285 place count 148 transition count 650
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 295 place count 143 transition count 650
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 306 place count 132 transition count 639
Iterating global reduction 3 with 11 rules applied. Total rules applied 317 place count 132 transition count 639
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 513 place count 132 transition count 443
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 513 place count 132 transition count 442
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 515 place count 131 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 517 place count 129 transition count 434
Iterating global reduction 4 with 2 rules applied. Total rules applied 519 place count 129 transition count 434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 521 place count 129 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 522 place count 128 transition count 432
Performed 55 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 632 place count 73 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 633 place count 73 transition count 375
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 646 place count 60 transition count 277
Iterating global reduction 7 with 13 rules applied. Total rules applied 659 place count 60 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 665 place count 60 transition count 271
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 8 with 2 rules applied. Total rules applied 667 place count 59 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 669 place count 57 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 670 place count 56 transition count 268
Applied a total of 670 rules in 75 ms. Remains 56 /285 variables (removed 229) and now considering 268/808 (removed 540) transitions.
// Phase 1: matrix 268 rows 56 cols
[2024-05-22 04:27:15] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 04:27:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-22 04:27:15] [INFO ] Invariant cache hit.
[2024-05-22 04:27:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:27:16] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [51, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 395 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/285 places, 268/808 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 267
Applied a total of 2 rules in 16 ms. Remains 53 /54 variables (removed 1) and now considering 267/268 (removed 1) transitions.
// Phase 1: matrix 267 rows 53 cols
[2024-05-22 04:27:16] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 04:27:16] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 04:27:16] [INFO ] Invariant cache hit.
[2024-05-22 04:27:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:27:16] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/285 places, 267/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 869 ms. Remains : 53/285 places, 267/808 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-11
Product exploration explored 100000 steps with 88 reset in 60 ms.
Product exploration explored 100000 steps with 219 reset in 78 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 101 steps (3 resets) in 6 ms. (14 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 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 267/267 transitions.
Applied a total of 0 rules in 11 ms. Remains 53 /53 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-22 04:27:17] [INFO ] Invariant cache hit.
[2024-05-22 04:27:17] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 04:27:17] [INFO ] Invariant cache hit.
[2024-05-22 04:27:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:27:17] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-05-22 04:27:17] [INFO ] Redundant transitions in 22 ms returned [263]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 264 sub problems to find dead transitions.
// Phase 1: matrix 266 rows 53 cols
[2024-05-22 04:27:17] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 04:27:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 265/317 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 04:27:21] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2024-05-22 04:27:23] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 1/318 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/319 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/319 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 64 constraints, problems are : Problem set: 0 solved, 264 unsolved in 17640 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/317 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 264/326 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/318 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 328 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
After SMT, in 49231ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 49236ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 266/267 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 264
Applied a total of 2 rules in 17 ms. Remains 51 /53 variables (removed 2) and now considering 264/266 (removed 2) transitions.
// Phase 1: matrix 264 rows 51 cols
[2024-05-22 04:28:07] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 04:28:07] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 04:28:07] [INFO ] Invariant cache hit.
[2024-05-22 04:28:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:28:07] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/53 places, 264/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50286 ms. Remains : 51/53 places, 264/267 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 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 119 steps (6 resets) in 7 ms. (14 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 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 591 reset in 135 ms.
Product exploration explored 100000 steps with 63 reset in 122 ms.
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 264/264 transitions.
Applied a total of 0 rules in 11 ms. Remains 51 /51 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 04:28:08] [INFO ] Invariant cache hit.
[2024-05-22 04:28:08] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 04:28:08] [INFO ] Invariant cache hit.
[2024-05-22 04:28:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:28:09] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-22 04:28:09] [INFO ] Redundant transitions in 23 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 04:28:09] [INFO ] Invariant cache hit.
[2024-05-22 04:28:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 263/314 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 04:28:13] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 1/315 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 04:28:19] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 62 constraints, problems are : Problem set: 0 solved, 263 unsolved in 16095 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 263/314 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 263/324 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/315 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 325 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
After SMT, in 47713ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 47719ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48235 ms. Remains : 51/51 places, 264/264 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-11 finished in 101267 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(p1)||p0)))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 270 transition count 793
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 270 transition count 793
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 226 place count 270 transition count 597
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 230 place count 266 transition count 593
Iterating global reduction 1 with 4 rules applied. Total rules applied 234 place count 266 transition count 593
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 235 place count 265 transition count 592
Iterating global reduction 1 with 1 rules applied. Total rules applied 236 place count 265 transition count 592
Applied a total of 236 rules in 16 ms. Remains 265 /285 variables (removed 20) and now considering 592/808 (removed 216) transitions.
// Phase 1: matrix 592 rows 265 cols
[2024-05-22 04:28:56] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 04:28:57] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-22 04:28:57] [INFO ] Invariant cache hit.
[2024-05-22 04:28:57] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-22 04:28:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-22 04:29:09] [INFO ] Deduced a trap composed of 17 places in 484 ms of which 5 ms to minimize.
[2024-05-22 04:29:10] [INFO ] Deduced a trap composed of 40 places in 424 ms of which 4 ms to minimize.
[2024-05-22 04:29:10] [INFO ] Deduced a trap composed of 18 places in 407 ms of which 3 ms to minimize.
[2024-05-22 04:29:11] [INFO ] Deduced a trap composed of 37 places in 440 ms of which 4 ms to minimize.
[2024-05-22 04:29:12] [INFO ] Deduced a trap composed of 38 places in 385 ms of which 3 ms to minimize.
[2024-05-22 04:29:12] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 3 ms to minimize.
[2024-05-22 04:29:12] [INFO ] Deduced a trap composed of 14 places in 307 ms of which 3 ms to minimize.
[2024-05-22 04:29:13] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 4 ms to minimize.
[2024-05-22 04:29:13] [INFO ] Deduced a trap composed of 36 places in 350 ms of which 4 ms to minimize.
[2024-05-22 04:29:13] [INFO ] Deduced a trap composed of 45 places in 334 ms of which 4 ms to minimize.
[2024-05-22 04:29:14] [INFO ] Deduced a trap composed of 40 places in 340 ms of which 4 ms to minimize.
[2024-05-22 04:29:14] [INFO ] Deduced a trap composed of 44 places in 392 ms of which 4 ms to minimize.
[2024-05-22 04:29:14] [INFO ] Deduced a trap composed of 46 places in 434 ms of which 4 ms to minimize.
[2024-05-22 04:29:15] [INFO ] Deduced a trap composed of 42 places in 422 ms of which 4 ms to minimize.
[2024-05-22 04:29:15] [INFO ] Deduced a trap composed of 41 places in 425 ms of which 4 ms to minimize.
[2024-05-22 04:29:16] [INFO ] Deduced a trap composed of 49 places in 435 ms of which 4 ms to minimize.
[2024-05-22 04:29:16] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 4 ms to minimize.
[2024-05-22 04:29:17] [INFO ] Deduced a trap composed of 41 places in 385 ms of which 3 ms to minimize.
[2024-05-22 04:29:17] [INFO ] Deduced a trap composed of 58 places in 287 ms of which 3 ms to minimize.
[2024-05-22 04:29:18] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-22 04:29:18] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 2 ms to minimize.
[2024-05-22 04:29:19] [INFO ] Deduced a trap composed of 54 places in 398 ms of which 4 ms to minimize.
[2024-05-22 04:29:19] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 3 ms to minimize.
[2024-05-22 04:29:19] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 3 ms to minimize.
[2024-05-22 04:29:20] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 4 ms to minimize.
[2024-05-22 04:29:20] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 3 ms to minimize.
[2024-05-22 04:29:20] [INFO ] Deduced a trap composed of 39 places in 373 ms of which 4 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 51 places in 323 ms of which 4 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 4 ms to minimize.
[2024-05-22 04:29:22] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 3 ms to minimize.
[2024-05-22 04:29:22] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 3 ms to minimize.
[2024-05-22 04:29:22] [INFO ] Deduced a trap composed of 45 places in 326 ms of which 4 ms to minimize.
[2024-05-22 04:29:23] [INFO ] Deduced a trap composed of 62 places in 329 ms of which 4 ms to minimize.
[2024-05-22 04:29:23] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 4 ms to minimize.
[2024-05-22 04:29:23] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 3 ms to minimize.
[2024-05-22 04:29:24] [INFO ] Deduced a trap composed of 41 places in 317 ms of which 3 ms to minimize.
[2024-05-22 04:29:24] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 4 ms to minimize.
[2024-05-22 04:29:24] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 2 ms to minimize.
[2024-05-22 04:29:25] [INFO ] Deduced a trap composed of 42 places in 363 ms of which 4 ms to minimize.
[2024-05-22 04:29:25] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/857 variables, and 52 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-22 04:29:36] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 4 ms to minimize.
[2024-05-22 04:29:37] [INFO ] Deduced a trap composed of 63 places in 465 ms of which 4 ms to minimize.
[2024-05-22 04:29:37] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 5 ms to minimize.
[2024-05-22 04:29:38] [INFO ] Deduced a trap composed of 26 places in 374 ms of which 4 ms to minimize.
[2024-05-22 04:29:38] [INFO ] Deduced a trap composed of 49 places in 286 ms of which 2 ms to minimize.
[2024-05-22 04:29:38] [INFO ] Deduced a trap composed of 44 places in 340 ms of which 4 ms to minimize.
[2024-05-22 04:29:39] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 4 ms to minimize.
[2024-05-22 04:29:39] [INFO ] Deduced a trap composed of 28 places in 335 ms of which 4 ms to minimize.
[2024-05-22 04:29:39] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 2 ms to minimize.
[2024-05-22 04:29:40] [INFO ] Deduced a trap composed of 58 places in 276 ms of which 3 ms to minimize.
[2024-05-22 04:29:40] [INFO ] Deduced a trap composed of 41 places in 334 ms of which 4 ms to minimize.
[2024-05-22 04:29:41] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 4 ms to minimize.
[2024-05-22 04:29:41] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 3 ms to minimize.
[2024-05-22 04:29:41] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 4 ms to minimize.
[2024-05-22 04:29:41] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-05-22 04:29:42] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 3 ms to minimize.
[2024-05-22 04:29:42] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 3 ms to minimize.
[2024-05-22 04:29:42] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 2 ms to minimize.
[2024-05-22 04:29:43] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 3 ms to minimize.
[2024-05-22 04:29:44] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-22 04:29:46] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 2 ms to minimize.
[2024-05-22 04:29:46] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 2 ms to minimize.
[2024-05-22 04:29:46] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 2 ms to minimize.
[2024-05-22 04:29:47] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 2 ms to minimize.
[2024-05-22 04:29:47] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 2 ms to minimize.
[2024-05-22 04:29:47] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 3 ms to minimize.
[2024-05-22 04:29:48] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 2 ms to minimize.
[2024-05-22 04:29:48] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 3 ms to minimize.
[2024-05-22 04:29:49] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 2 ms to minimize.
[2024-05-22 04:29:49] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 3 ms to minimize.
[2024-05-22 04:29:49] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-05-22 04:29:50] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 2 ms to minimize.
[2024-05-22 04:29:50] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 3 ms to minimize.
[2024-05-22 04:29:50] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 2 ms to minimize.
[2024-05-22 04:29:51] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 3 ms to minimize.
[2024-05-22 04:29:51] [INFO ] Deduced a trap composed of 15 places in 348 ms of which 3 ms to minimize.
[2024-05-22 04:29:52] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-22 04:29:57] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/857 variables, and 90 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 78/78 constraints]
After SMT, in 62379ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 62387ms
Starting structural reductions in LTL mode, iteration 1 : 265/285 places, 592/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63017 ms. Remains : 265/285 places, 592/808 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 4969 steps with 46 reset in 10 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-12 finished in 63169 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 U p1))||!(G(p0) U G(p2))||X(p3))))'
Support contains 7 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 272 transition count 795
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 272 transition count 795
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 222 place count 272 transition count 599
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 226 place count 268 transition count 595
Iterating global reduction 1 with 4 rules applied. Total rules applied 230 place count 268 transition count 595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 231 place count 267 transition count 594
Iterating global reduction 1 with 1 rules applied. Total rules applied 232 place count 267 transition count 594
Applied a total of 232 rules in 15 ms. Remains 267 /285 variables (removed 18) and now considering 594/808 (removed 214) transitions.
// Phase 1: matrix 594 rows 267 cols
[2024-05-22 04:30:00] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 04:30:00] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-22 04:30:00] [INFO ] Invariant cache hit.
[2024-05-22 04:30:00] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 593 sub problems to find dead transitions.
[2024-05-22 04:30:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:30:13] [INFO ] Deduced a trap composed of 17 places in 406 ms of which 5 ms to minimize.
[2024-05-22 04:30:13] [INFO ] Deduced a trap composed of 28 places in 358 ms of which 4 ms to minimize.
[2024-05-22 04:30:13] [INFO ] Deduced a trap composed of 36 places in 355 ms of which 3 ms to minimize.
[2024-05-22 04:30:14] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 4 ms to minimize.
[2024-05-22 04:30:14] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 4 ms to minimize.
[2024-05-22 04:30:14] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 4 ms to minimize.
[2024-05-22 04:30:15] [INFO ] Deduced a trap composed of 39 places in 391 ms of which 4 ms to minimize.
[2024-05-22 04:30:15] [INFO ] Deduced a trap composed of 37 places in 395 ms of which 4 ms to minimize.
[2024-05-22 04:30:16] [INFO ] Deduced a trap composed of 46 places in 389 ms of which 4 ms to minimize.
[2024-05-22 04:30:16] [INFO ] Deduced a trap composed of 46 places in 401 ms of which 4 ms to minimize.
[2024-05-22 04:30:16] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 2 ms to minimize.
[2024-05-22 04:30:17] [INFO ] Deduced a trap composed of 21 places in 366 ms of which 5 ms to minimize.
[2024-05-22 04:30:17] [INFO ] Deduced a trap composed of 41 places in 348 ms of which 3 ms to minimize.
[2024-05-22 04:30:17] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 3 ms to minimize.
[2024-05-22 04:30:18] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 3 ms to minimize.
[2024-05-22 04:30:18] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 3 ms to minimize.
[2024-05-22 04:30:19] [INFO ] Deduced a trap composed of 25 places in 389 ms of which 4 ms to minimize.
[2024-05-22 04:30:19] [INFO ] Deduced a trap composed of 60 places in 414 ms of which 4 ms to minimize.
[2024-05-22 04:30:20] [INFO ] Deduced a trap composed of 31 places in 384 ms of which 4 ms to minimize.
[2024-05-22 04:30:20] [INFO ] Deduced a trap composed of 42 places in 387 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:30:21] [INFO ] Deduced a trap composed of 14 places in 403 ms of which 4 ms to minimize.
[2024-05-22 04:30:22] [INFO ] Deduced a trap composed of 41 places in 428 ms of which 4 ms to minimize.
[2024-05-22 04:30:22] [INFO ] Deduced a trap composed of 32 places in 533 ms of which 4 ms to minimize.
[2024-05-22 04:30:23] [INFO ] Deduced a trap composed of 32 places in 401 ms of which 4 ms to minimize.
[2024-05-22 04:30:23] [INFO ] Deduced a trap composed of 18 places in 382 ms of which 3 ms to minimize.
[2024-05-22 04:30:23] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 4 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 52 places in 370 ms of which 4 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 40 places in 385 ms of which 3 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 42 places in 360 ms of which 3 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 43 places in 353 ms of which 3 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 3 ms to minimize.
[2024-05-22 04:30:26] [INFO ] Deduced a trap composed of 46 places in 327 ms of which 4 ms to minimize.
[2024-05-22 04:30:26] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 3 ms to minimize.
[2024-05-22 04:30:26] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 2 ms to minimize.
[2024-05-22 04:30:27] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 3 ms to minimize.
[2024-05-22 04:30:27] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 3 ms to minimize.
[2024-05-22 04:30:27] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 3 ms to minimize.
[2024-05-22 04:30:28] [INFO ] Deduced a trap composed of 41 places in 381 ms of which 4 ms to minimize.
[2024-05-22 04:30:28] [INFO ] Deduced a trap composed of 32 places in 383 ms of which 4 ms to minimize.
[2024-05-22 04:30:29] [INFO ] Deduced a trap composed of 45 places in 303 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 593 unsolved
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 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/861 variables, and 52 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:30:38] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 2 ms to minimize.
[2024-05-22 04:30:39] [INFO ] Deduced a trap composed of 32 places in 313 ms of which 4 ms to minimize.
[2024-05-22 04:30:39] [INFO ] Deduced a trap composed of 35 places in 364 ms of which 2 ms to minimize.
[2024-05-22 04:30:40] [INFO ] Deduced a trap composed of 36 places in 369 ms of which 4 ms to minimize.
[2024-05-22 04:30:41] [INFO ] Deduced a trap composed of 47 places in 352 ms of which 4 ms to minimize.
[2024-05-22 04:30:41] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 9 ms to minimize.
[2024-05-22 04:30:41] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 2 ms to minimize.
[2024-05-22 04:30:41] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 2 ms to minimize.
[2024-05-22 04:30:42] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 2 ms to minimize.
[2024-05-22 04:30:42] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 3 ms to minimize.
[2024-05-22 04:30:42] [INFO ] Deduced a trap composed of 32 places in 319 ms of which 3 ms to minimize.
[2024-05-22 04:30:43] [INFO ] Deduced a trap composed of 32 places in 329 ms of which 4 ms to minimize.
[2024-05-22 04:30:43] [INFO ] Deduced a trap composed of 43 places in 361 ms of which 3 ms to minimize.
[2024-05-22 04:30:44] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 4 ms to minimize.
[2024-05-22 04:30:44] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 4 ms to minimize.
[2024-05-22 04:30:44] [INFO ] Deduced a trap composed of 43 places in 311 ms of which 4 ms to minimize.
[2024-05-22 04:30:45] [INFO ] Deduced a trap composed of 46 places in 341 ms of which 3 ms to minimize.
[2024-05-22 04:30:45] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 4 ms to minimize.
[2024-05-22 04:30:46] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 3 ms to minimize.
[2024-05-22 04:30:46] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:30:47] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 3 ms to minimize.
[2024-05-22 04:30:47] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 3 ms to minimize.
[2024-05-22 04:30:48] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 3 ms to minimize.
[2024-05-22 04:30:49] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 3 ms to minimize.
[2024-05-22 04:30:49] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 3 ms to minimize.
[2024-05-22 04:30:49] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 2 ms to minimize.
[2024-05-22 04:30:50] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 3 ms to minimize.
[2024-05-22 04:30:51] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 2 ms to minimize.
[2024-05-22 04:30:51] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 2 ms to minimize.
[2024-05-22 04:30:52] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 4 ms to minimize.
[2024-05-22 04:30:52] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:30:57] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:30:59] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 3 ms to minimize.
[2024-05-22 04:30:59] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 3 ms to minimize.
[2024-05-22 04:30:59] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 2 ms to minimize.
[2024-05-22 04:31:00] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 3 ms to minimize.
[2024-05-22 04:31:00] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 3 ms to minimize.
[2024-05-22 04:31:00] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 3 ms to minimize.
[2024-05-22 04:31:00] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-05-22 04:31:01] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 1 ms to minimize.
[2024-05-22 04:31:01] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2024-05-22 04:31:01] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 3 ms to minimize.
[2024-05-22 04:31:01] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
[2024-05-22 04:31:02] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-05-22 04:31:02] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 1 ms to minimize.
[2024-05-22 04:31:02] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 2 ms to minimize.
[2024-05-22 04:31:02] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 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 267/861 variables, and 99 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 0/593 constraints, Known Traps: 87/87 constraints]
After SMT, in 62498ms problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 62509ms
Starting structural reductions in LTL mode, iteration 1 : 267/285 places, 594/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63367 ms. Remains : 267/285 places, 594/808 transitions.
Stuttering acceptance computed with spot in 337 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-13
Product exploration explored 100000 steps with 11533 reset in 158 ms.
Product exploration explored 100000 steps with 11612 reset in 264 ms.
Computed a total of 44 stabilizing places and 45 stable transitions
Computed a total of 44 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 181 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 27024 steps (108 resets) in 223 ms. (120 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3 (NOT p1)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p3), (F (NOT p0)), (F (NOT (OR (AND p0 p2) (AND p2 p1))))]
Knowledge based reduction with 17 factoid took 752 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 349 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Applied a total of 0 rules in 3 ms. Remains 267 /267 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-05-22 04:31:06] [INFO ] Invariant cache hit.
[2024-05-22 04:31:06] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-22 04:31:06] [INFO ] Invariant cache hit.
[2024-05-22 04:31:07] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Running 593 sub problems to find dead transitions.
[2024-05-22 04:31:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:31:18] [INFO ] Deduced a trap composed of 17 places in 476 ms of which 4 ms to minimize.
[2024-05-22 04:31:18] [INFO ] Deduced a trap composed of 28 places in 408 ms of which 4 ms to minimize.
[2024-05-22 04:31:19] [INFO ] Deduced a trap composed of 36 places in 432 ms of which 4 ms to minimize.
[2024-05-22 04:31:19] [INFO ] Deduced a trap composed of 33 places in 434 ms of which 4 ms to minimize.
[2024-05-22 04:31:19] [INFO ] Deduced a trap composed of 37 places in 367 ms of which 6 ms to minimize.
[2024-05-22 04:31:20] [INFO ] Deduced a trap composed of 38 places in 429 ms of which 4 ms to minimize.
[2024-05-22 04:31:20] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 3 ms to minimize.
[2024-05-22 04:31:21] [INFO ] Deduced a trap composed of 37 places in 354 ms of which 4 ms to minimize.
[2024-05-22 04:31:21] [INFO ] Deduced a trap composed of 46 places in 399 ms of which 4 ms to minimize.
[2024-05-22 04:31:21] [INFO ] Deduced a trap composed of 46 places in 396 ms of which 4 ms to minimize.
[2024-05-22 04:31:22] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 4 ms to minimize.
[2024-05-22 04:31:22] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 4 ms to minimize.
[2024-05-22 04:31:23] [INFO ] Deduced a trap composed of 41 places in 370 ms of which 3 ms to minimize.
[2024-05-22 04:31:23] [INFO ] Deduced a trap composed of 40 places in 351 ms of which 4 ms to minimize.
[2024-05-22 04:31:23] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 3 ms to minimize.
[2024-05-22 04:31:24] [INFO ] Deduced a trap composed of 41 places in 354 ms of which 4 ms to minimize.
[2024-05-22 04:31:24] [INFO ] Deduced a trap composed of 25 places in 367 ms of which 4 ms to minimize.
[2024-05-22 04:31:25] [INFO ] Deduced a trap composed of 60 places in 433 ms of which 5 ms to minimize.
[2024-05-22 04:31:25] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 3 ms to minimize.
[2024-05-22 04:31:26] [INFO ] Deduced a trap composed of 42 places in 327 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:31:26] [INFO ] Deduced a trap composed of 14 places in 289 ms of which 4 ms to minimize.
[2024-05-22 04:31:27] [INFO ] Deduced a trap composed of 41 places in 361 ms of which 4 ms to minimize.
[2024-05-22 04:31:28] [INFO ] Deduced a trap composed of 32 places in 354 ms of which 4 ms to minimize.
[2024-05-22 04:31:28] [INFO ] Deduced a trap composed of 32 places in 400 ms of which 4 ms to minimize.
[2024-05-22 04:31:28] [INFO ] Deduced a trap composed of 18 places in 355 ms of which 2 ms to minimize.
[2024-05-22 04:31:29] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 3 ms to minimize.
[2024-05-22 04:31:29] [INFO ] Deduced a trap composed of 52 places in 326 ms of which 4 ms to minimize.
[2024-05-22 04:31:29] [INFO ] Deduced a trap composed of 40 places in 351 ms of which 2 ms to minimize.
[2024-05-22 04:31:30] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 3 ms to minimize.
[2024-05-22 04:31:30] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 4 ms to minimize.
[2024-05-22 04:31:31] [INFO ] Deduced a trap composed of 46 places in 316 ms of which 4 ms to minimize.
[2024-05-22 04:31:31] [INFO ] Deduced a trap composed of 46 places in 334 ms of which 4 ms to minimize.
[2024-05-22 04:31:31] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 2 ms to minimize.
[2024-05-22 04:31:31] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 2 ms to minimize.
[2024-05-22 04:31:32] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 3 ms to minimize.
[2024-05-22 04:31:32] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 2 ms to minimize.
[2024-05-22 04:31:32] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 2 ms to minimize.
[2024-05-22 04:31:33] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 3 ms to minimize.
[2024-05-22 04:31:33] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 2 ms to minimize.
[2024-05-22 04:31:33] [INFO ] Deduced a trap composed of 45 places in 262 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:31:39] [INFO ] Deduced a trap composed of 26 places in 411 ms of which 4 ms to minimize.
SMT process timed out in 32709ms, After SMT, problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 32716ms
Finished structural reductions in LTL mode , in 1 iterations and 33512 ms. Remains : 267/267 places, 594/594 transitions.
Computed a total of 44 stabilizing places and 45 stable transitions
Computed a total of 44 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 177 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 31672 steps (259 resets) in 298 ms. (105 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3 (NOT p1)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p3), (F (NOT p0)), (F (NOT (OR (AND p0 p2) (AND p2 p1))))]
Knowledge based reduction with 17 factoid took 848 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 357 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 352 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 11491 reset in 261 ms.
Product exploration explored 100000 steps with 11477 reset in 270 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 363 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 241 edges and 267 vertex of which 4 / 267 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.
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 265 transition count 592
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 109 place count 265 transition count 575
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 109 place count 265 transition count 575
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 128 place count 265 transition count 575
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 200 place count 193 transition count 503
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 272 place count 193 transition count 503
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 342 place count 193 transition count 513
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 344 place count 193 transition count 511
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 403 place count 134 transition count 375
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 3 with 59 rules applied. Total rules applied 462 place count 134 transition count 375
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 472 place count 134 transition count 365
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 478 place count 128 transition count 359
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 484 place count 128 transition count 359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 485 place count 128 transition count 359
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 487 place count 126 transition count 357
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 489 place count 126 transition count 357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 490 place count 126 transition count 359
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 490 rules in 119 ms. Remains 126 /267 variables (removed 141) and now considering 359/594 (removed 235) transitions.
[2024-05-22 04:31:44] [INFO ] Redundant transitions in 10 ms returned []
Running 358 sub problems to find dead transitions.
// Phase 1: matrix 359 rows 126 cols
[2024-05-22 04:31:44] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 04:31:44] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 04:31:48] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 2 ms to minimize.
[2024-05-22 04:31:48] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-22 04:31:49] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 2 ms to minimize.
[2024-05-22 04:31:49] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 2 ms to minimize.
[2024-05-22 04:31:49] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 04:31:49] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-22 04:31:49] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-22 04:31:50] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 2 ms to minimize.
[2024-05-22 04:31:50] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 2 ms to minimize.
[2024-05-22 04:31:50] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 2 ms to minimize.
[2024-05-22 04:31:50] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-22 04:31:50] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-05-22 04:31:51] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-22 04:31:51] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-22 04:31:51] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 2 ms to minimize.
[2024-05-22 04:31:51] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 2 ms to minimize.
[2024-05-22 04:31:51] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-05-22 04:31:51] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-22 04:31:51] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-22 04:31:52] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/31 constraints. Problems are: Problem set: 40 solved, 318 unsolved
[2024-05-22 04:31:52] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-05-22 04:31:52] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2024-05-22 04:31:52] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 2 ms to minimize.
[2024-05-22 04:31:53] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-22 04:31:53] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 2 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-22 04:31:54] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-22 04:31:54] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 3 ms to minimize.
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
[2024-05-22 04:31:54] [INFO ] Deduced a trap composed of 2 places in 214 ms of which 2 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 8/39 constraints. Problems are: Problem set: 51 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/39 constraints. Problems are: Problem set: 51 solved, 307 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 5 (OVERLAPS) 358/484 variables, 126/165 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 117/282 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/282 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 1/485 variables, 1/283 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/283 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/283 constraints. Problems are: Problem set: 65 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 283 constraints, problems are : Problem set: 65 solved, 293 unsolved in 29271 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 126/126 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 65 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 58/126 variables, 11/11 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 28/39 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/39 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 358/484 variables, 126/165 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 117/282 constraints. Problems are: Problem set: 65 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 293/575 constraints. Problems are: Problem set: 65 solved, 293 unsolved
[2024-05-22 04:32:32] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 1/576 constraints. Problems are: Problem set: 65 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/485 variables, and 576 constraints, problems are : Problem set: 65 solved, 293 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 126/126 constraints, ReadFeed: 117/118 constraints, PredecessorRefiner: 293/358 constraints, Known Traps: 29/29 constraints]
After SMT, in 61113ms problems are : Problem set: 65 solved, 293 unsolved
Search for dead transitions found 65 dead transitions in 61120ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 126/267 places, 294/594 transitions.
Graph (complete) has 636 edges and 126 vertex of which 69 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.1 ms
Discarding 57 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 22 ms. Remains 69 /126 variables (removed 57) and now considering 294/294 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/267 places, 294/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61281 ms. Remains : 69/267 places, 294/594 transitions.
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Applied a total of 0 rules in 4 ms. Remains 267 /267 variables (removed 0) and now considering 594/594 (removed 0) transitions.
// Phase 1: matrix 594 rows 267 cols
[2024-05-22 04:32:45] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 04:32:45] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 04:32:45] [INFO ] Invariant cache hit.
[2024-05-22 04:32:45] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 593 sub problems to find dead transitions.
[2024-05-22 04:32:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:32:58] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 3 ms to minimize.
[2024-05-22 04:32:58] [INFO ] Deduced a trap composed of 28 places in 458 ms of which 5 ms to minimize.
[2024-05-22 04:32:59] [INFO ] Deduced a trap composed of 36 places in 437 ms of which 4 ms to minimize.
[2024-05-22 04:32:59] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 4 ms to minimize.
[2024-05-22 04:33:00] [INFO ] Deduced a trap composed of 37 places in 354 ms of which 4 ms to minimize.
[2024-05-22 04:33:00] [INFO ] Deduced a trap composed of 38 places in 353 ms of which 4 ms to minimize.
[2024-05-22 04:33:00] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 4 ms to minimize.
[2024-05-22 04:33:01] [INFO ] Deduced a trap composed of 37 places in 299 ms of which 3 ms to minimize.
[2024-05-22 04:33:01] [INFO ] Deduced a trap composed of 46 places in 398 ms of which 4 ms to minimize.
[2024-05-22 04:33:01] [INFO ] Deduced a trap composed of 46 places in 304 ms of which 3 ms to minimize.
[2024-05-22 04:33:02] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 3 ms to minimize.
[2024-05-22 04:33:02] [INFO ] Deduced a trap composed of 21 places in 381 ms of which 4 ms to minimize.
[2024-05-22 04:33:03] [INFO ] Deduced a trap composed of 41 places in 373 ms of which 4 ms to minimize.
[2024-05-22 04:33:03] [INFO ] Deduced a trap composed of 40 places in 360 ms of which 4 ms to minimize.
[2024-05-22 04:33:03] [INFO ] Deduced a trap composed of 38 places in 345 ms of which 4 ms to minimize.
[2024-05-22 04:33:04] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 4 ms to minimize.
[2024-05-22 04:33:04] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 4 ms to minimize.
[2024-05-22 04:33:05] [INFO ] Deduced a trap composed of 60 places in 448 ms of which 4 ms to minimize.
[2024-05-22 04:33:05] [INFO ] Deduced a trap composed of 31 places in 384 ms of which 4 ms to minimize.
[2024-05-22 04:33:06] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:33:07] [INFO ] Deduced a trap composed of 14 places in 429 ms of which 5 ms to minimize.
[2024-05-22 04:33:07] [INFO ] Deduced a trap composed of 41 places in 427 ms of which 4 ms to minimize.
[2024-05-22 04:33:08] [INFO ] Deduced a trap composed of 32 places in 430 ms of which 4 ms to minimize.
[2024-05-22 04:33:08] [INFO ] Deduced a trap composed of 32 places in 371 ms of which 4 ms to minimize.
[2024-05-22 04:33:09] [INFO ] Deduced a trap composed of 18 places in 416 ms of which 4 ms to minimize.
[2024-05-22 04:33:09] [INFO ] Deduced a trap composed of 24 places in 359 ms of which 4 ms to minimize.
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 52 places in 427 ms of which 4 ms to minimize.
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 40 places in 412 ms of which 4 ms to minimize.
[2024-05-22 04:33:11] [INFO ] Deduced a trap composed of 42 places in 378 ms of which 4 ms to minimize.
[2024-05-22 04:33:11] [INFO ] Deduced a trap composed of 43 places in 375 ms of which 3 ms to minimize.
[2024-05-22 04:33:12] [INFO ] Deduced a trap composed of 46 places in 315 ms of which 3 ms to minimize.
[2024-05-22 04:33:12] [INFO ] Deduced a trap composed of 46 places in 316 ms of which 3 ms to minimize.
[2024-05-22 04:33:12] [INFO ] Deduced a trap composed of 49 places in 306 ms of which 3 ms to minimize.
[2024-05-22 04:33:12] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 3 ms to minimize.
[2024-05-22 04:33:13] [INFO ] Deduced a trap composed of 45 places in 289 ms of which 3 ms to minimize.
[2024-05-22 04:33:13] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 3 ms to minimize.
[2024-05-22 04:33:13] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 3 ms to minimize.
[2024-05-22 04:33:14] [INFO ] Deduced a trap composed of 41 places in 404 ms of which 4 ms to minimize.
[2024-05-22 04:33:15] [INFO ] Deduced a trap composed of 32 places in 411 ms of which 5 ms to minimize.
[2024-05-22 04:33:15] [INFO ] Deduced a trap composed of 45 places in 308 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/861 variables, and 52 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:33:24] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 3 ms to minimize.
[2024-05-22 04:33:25] [INFO ] Deduced a trap composed of 32 places in 324 ms of which 3 ms to minimize.
[2024-05-22 04:33:25] [INFO ] Deduced a trap composed of 35 places in 392 ms of which 4 ms to minimize.
[2024-05-22 04:33:26] [INFO ] Deduced a trap composed of 36 places in 374 ms of which 4 ms to minimize.
[2024-05-22 04:33:27] [INFO ] Deduced a trap composed of 47 places in 322 ms of which 4 ms to minimize.
[2024-05-22 04:33:27] [INFO ] Deduced a trap composed of 47 places in 318 ms of which 3 ms to minimize.
[2024-05-22 04:33:27] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 3 ms to minimize.
[2024-05-22 04:33:28] [INFO ] Deduced a trap composed of 59 places in 336 ms of which 4 ms to minimize.
[2024-05-22 04:33:28] [INFO ] Deduced a trap composed of 48 places in 342 ms of which 3 ms to minimize.
[2024-05-22 04:33:29] [INFO ] Deduced a trap composed of 48 places in 313 ms of which 4 ms to minimize.
[2024-05-22 04:33:29] [INFO ] Deduced a trap composed of 32 places in 298 ms of which 3 ms to minimize.
[2024-05-22 04:33:30] [INFO ] Deduced a trap composed of 32 places in 312 ms of which 4 ms to minimize.
[2024-05-22 04:33:30] [INFO ] Deduced a trap composed of 43 places in 372 ms of which 4 ms to minimize.
[2024-05-22 04:33:30] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 3 ms to minimize.
[2024-05-22 04:33:31] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 4 ms to minimize.
[2024-05-22 04:33:31] [INFO ] Deduced a trap composed of 43 places in 314 ms of which 4 ms to minimize.
[2024-05-22 04:33:32] [INFO ] Deduced a trap composed of 46 places in 341 ms of which 3 ms to minimize.
[2024-05-22 04:33:32] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 4 ms to minimize.
[2024-05-22 04:33:33] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 3 ms to minimize.
[2024-05-22 04:33:33] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:33:34] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 3 ms to minimize.
[2024-05-22 04:33:34] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 3 ms to minimize.
[2024-05-22 04:33:36] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 3 ms to minimize.
[2024-05-22 04:33:36] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 3 ms to minimize.
[2024-05-22 04:33:36] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 3 ms to minimize.
[2024-05-22 04:33:36] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
[2024-05-22 04:33:37] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 3 ms to minimize.
[2024-05-22 04:33:39] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-05-22 04:33:39] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 3 ms to minimize.
[2024-05-22 04:33:40] [INFO ] Deduced a trap composed of 15 places in 380 ms of which 4 ms to minimize.
[2024-05-22 04:33:40] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:33:46] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:33:48] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 2 ms to minimize.
SMT process timed out in 62116ms, After SMT, problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 62122ms
Finished structural reductions in LTL mode , in 1 iterations and 62813 ms. Remains : 267/267 places, 594/594 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-13 finished in 228048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 3 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 268 edges and 285 vertex of which 4 / 285 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 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 282 transition count 694
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 152 rules applied. Total rules applied 264 place count 171 transition count 653
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 288 place count 147 transition count 653
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 288 place count 147 transition count 647
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 300 place count 141 transition count 647
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 310 place count 131 transition count 637
Iterating global reduction 3 with 10 rules applied. Total rules applied 320 place count 131 transition count 637
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 516 place count 131 transition count 441
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 516 place count 131 transition count 440
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 130 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 520 place count 128 transition count 432
Iterating global reduction 4 with 2 rules applied. Total rules applied 522 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 524 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 525 place count 127 transition count 430
Performed 54 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 633 place count 73 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 634 place count 73 transition count 374
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 645 place count 62 transition count 291
Iterating global reduction 7 with 11 rules applied. Total rules applied 656 place count 62 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 661 place count 62 transition count 286
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 8 with 2 rules applied. Total rules applied 663 place count 61 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 665 place count 59 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 666 place count 58 transition count 283
Applied a total of 666 rules in 129 ms. Remains 58 /285 variables (removed 227) and now considering 283/808 (removed 525) transitions.
// Phase 1: matrix 283 rows 58 cols
[2024-05-22 04:33:48] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 04:33:48] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 04:33:48] [INFO ] Invariant cache hit.
[2024-05-22 04:33:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:33:48] [INFO ] Implicit Places using invariants and state equation in 316 ms returned [51, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 525 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/285 places, 283/808 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 282
Applied a total of 2 rules in 19 ms. Remains 55 /56 variables (removed 1) and now considering 282/283 (removed 1) transitions.
// Phase 1: matrix 282 rows 55 cols
[2024-05-22 04:33:48] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 04:33:48] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 04:33:48] [INFO ] Invariant cache hit.
[2024-05-22 04:33:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:33:49] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/285 places, 282/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1004 ms. Remains : 55/285 places, 282/808 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 24 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-15 finished in 1113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(G(p1)) U p2))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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' '!(G(F(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' '!(G((F(!(p0 U p1))||!(G(p0) U G(p2))||X(p3))))'
Found a Lengthening insensitive property : AutonomousCar-PT-07b-LTLCardinality-13
Stuttering acceptance computed with spot in 359 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 285 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 259 edges and 285 vertex of which 4 / 285 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 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 282 transition count 701
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 141 rules applied. Total rules applied 246 place count 178 transition count 664
Reduce places removed 21 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 24 rules applied. Total rules applied 270 place count 157 transition count 661
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 275 place count 154 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 153 transition count 659
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 276 place count 153 transition count 651
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 292 place count 145 transition count 651
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 300 place count 137 transition count 643
Iterating global reduction 5 with 8 rules applied. Total rules applied 308 place count 137 transition count 643
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 5 with 196 rules applied. Total rules applied 504 place count 137 transition count 447
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 504 place count 137 transition count 446
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 506 place count 136 transition count 446
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 508 place count 134 transition count 438
Iterating global reduction 6 with 2 rules applied. Total rules applied 510 place count 134 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 512 place count 134 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 513 place count 133 transition count 436
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 8 with 102 rules applied. Total rules applied 615 place count 82 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 616 place count 82 transition count 383
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 627 place count 71 transition count 301
Iterating global reduction 9 with 11 rules applied. Total rules applied 638 place count 71 transition count 301
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 642 place count 71 transition count 297
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 10 with 2 rules applied. Total rules applied 644 place count 70 transition count 296
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 646 place count 68 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 647 place count 67 transition count 294
Applied a total of 647 rules in 115 ms. Remains 67 /285 variables (removed 218) and now considering 294/808 (removed 514) transitions.
// Phase 1: matrix 294 rows 67 cols
[2024-05-22 04:33:50] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 04:33:50] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 04:33:50] [INFO ] Invariant cache hit.
[2024-05-22 04:33:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:33:51] [INFO ] Implicit Places using invariants and state equation in 338 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 527 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 65/285 places, 294/808 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 64 transition count 293
Applied a total of 2 rules in 13 ms. Remains 64 /65 variables (removed 1) and now considering 293/294 (removed 1) transitions.
// Phase 1: matrix 293 rows 64 cols
[2024-05-22 04:33:51] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 04:33:51] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 04:33:51] [INFO ] Invariant cache hit.
[2024-05-22 04:33:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:33:51] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 64/285 places, 293/808 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1174 ms. Remains : 64/285 places, 293/808 transitions.
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-13
Product exploration explored 100000 steps with 11969 reset in 275 ms.
Product exploration explored 100000 steps with 6096 reset in 225 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 584 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 4371 steps (199 resets) in 30 ms. (141 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F p3), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 1139 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 422 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 293/293 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 04:33:55] [INFO ] Invariant cache hit.
[2024-05-22 04:33:55] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 04:33:55] [INFO ] Invariant cache hit.
[2024-05-22 04:33:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:33:55] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-05-22 04:33:55] [INFO ] Invariant cache hit.
[2024-05-22 04:33:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 04:33:59] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2024-05-22 04:33:59] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2024-05-22 04:34:00] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 2 ms to minimize.
[2024-05-22 04:34:00] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 2 ms to minimize.
[2024-05-22 04:34:00] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2024-05-22 04:34:00] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2024-05-22 04:34:01] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Problem TDEAD179 is UNSAT
At refinement iteration 5 (OVERLAPS) 292/356 variables, 64/79 constraints. Problems are: Problem set: 1 solved, 290 unsolved
[2024-05-22 04:34:04] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2024-05-22 04:34:04] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2024-05-22 04:34:04] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 3/82 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/357 variables, 1/83 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/357 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 83 constraints, problems are : Problem set: 1 solved, 290 unsolved in 19089 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 1 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 292/355 variables, 63/81 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 290/371 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 1/356 variables, 1/372 constraints. Problems are: Problem set: 1 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/372 constraints. Problems are: Problem set: 1 solved, 290 unsolved
SMT process timed out in 50896ms, After SMT, problems are : Problem set: 1 solved, 290 unsolved
Search for dead transitions found 1 dead transitions in 50901ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 64/64 places, 292/293 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51407 ms. Remains : 64/64 places, 292/293 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 394 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 2660 steps (118 resets) in 19 ms. (133 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F p3), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 1128 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 354 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 353 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 1836 reset in 150 ms.
Product exploration explored 100000 steps with 931 reset in 155 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 352 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 292/292 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 294/292 (removed -2) transitions.
[2024-05-22 04:34:50] [INFO ] Redundant transitions in 34 ms returned []
Running 292 sub problems to find dead transitions.
// Phase 1: matrix 294 rows 64 cols
[2024-05-22 04:34:50] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 04:34:50] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:34:54] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 3 ms to minimize.
[2024-05-22 04:34:54] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2024-05-22 04:34:54] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 1 ms to minimize.
[2024-05-22 04:34:54] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-22 04:34:54] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2024-05-22 04:34:55] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2024-05-22 04:34:55] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 5 (OVERLAPS) 293/356 variables, 63/78 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/79 constraints. Problems are: Problem set: 3 solved, 289 unsolved
[2024-05-22 04:34:59] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 1/80 constraints. Problems are: Problem set: 3 solved, 289 unsolved
[2024-05-22 04:35:01] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 2 ms to minimize.
[2024-05-22 04:35:01] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 2/82 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 1/357 variables, 1/83 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 12 (OVERLAPS) 1/358 variables, 1/84 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 84 constraints, problems are : Problem set: 3 solved, 289 unsolved in 21589 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 3 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 7/12 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 6/18 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 292/354 variables, 62/80 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/81 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 289/370 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/370 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 3/357 variables, 2/372 constraints. Problems are: Problem set: 3 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/358 variables, and 372 constraints, problems are : Problem set: 3 solved, 289 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 289/292 constraints, Known Traps: 10/10 constraints]
After SMT, in 53422ms problems are : Problem set: 3 solved, 289 unsolved
Search for dead transitions found 3 dead transitions in 53429ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 64/64 places, 291/292 transitions.
Graph (complete) has 562 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 63 /64 variables (removed 1) and now considering 291/291 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/64 places, 291/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53510 ms. Remains : 63/64 places, 291/292 transitions.
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 292/292 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 292/292 (removed 0) transitions.
// Phase 1: matrix 292 rows 64 cols
[2024-05-22 04:35:43] [INFO ] Computed 8 invariants in 4 ms
[2024-05-22 04:35:43] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 04:35:43] [INFO ] Invariant cache hit.
[2024-05-22 04:35:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:35:44] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-05-22 04:35:44] [INFO ] Invariant cache hit.
[2024-05-22 04:35:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 04:35:48] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2024-05-22 04:35:48] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2024-05-22 04:35:48] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2024-05-22 04:35:48] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-22 04:35:48] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2024-05-22 04:35:48] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2024-05-22 04:35:49] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 291/354 variables, 63/78 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 04:35:52] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2024-05-22 04:35:52] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2024-05-22 04:35:53] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2024-05-22 04:35:53] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/355 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 1/356 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 12 (OVERLAPS) 0/356 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 84 constraints, problems are : Problem set: 0 solved, 290 unsolved in 24299 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 291/354 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 290/372 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 1/355 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/356 variables, and 373 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 11/11 constraints]
After SMT, in 56084ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 56090ms
Finished structural reductions in LTL mode , in 1 iterations and 56615 ms. Remains : 64/64 places, 292/292 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-13 finished in 170687 ms.
[2024-05-22 04:36:40] [INFO ] Flatten gal took : 128 ms
[2024-05-22 04:36:40] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-22 04:36:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 285 places, 808 transitions and 5789 arcs took 30 ms.
Total runtime 1211473 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running AutonomousCar-PT-07b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 285
TRANSITIONS: 808
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.061s, Sys 0.005s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 5317
MODEL NAME: /home/mcc/execution/413/model
285 places, 808 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-07b-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-LTLCardinality-03 CANNOT_COMPUTE
FORMULA AutonomousCar-PT-07b-LTLCardinality-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716353263337
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
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-07b"
export BK_EXAMINATION="LTLCardinality"
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-07b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166400323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07b.tgz
mv AutonomousCar-PT-07b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;