Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813400171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CANConstruction-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813400171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 173K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748629027032

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 18:17:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 18:17:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 18:17:09] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2025-05-30 18:17:09] [INFO ] Transformed 322 places.
[2025-05-30 18:17:09] [INFO ] Transformed 480 transitions.
[2025-05-30 18:17:09] [INFO ] Parsed PT model containing 322 places and 480 transitions and 1400 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Support contains 60 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 256 transition count 348
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 256 transition count 348
Applied a total of 132 rules in 77 ms. Remains 256 /322 variables (removed 66) and now considering 348/480 (removed 132) transitions.
// Phase 1: matrix 348 rows 256 cols
[2025-05-30 18:17:10] [INFO ] Computed 21 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:17:11] [INFO ] Implicit Places using invariants in 699 ms returned [12, 26, 40, 68, 82, 96, 110, 124, 138]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 757 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/322 places, 348/480 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 241 transition count 342
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 241 transition count 342
Applied a total of 12 rules in 29 ms. Remains 241 /247 variables (removed 6) and now considering 342/348 (removed 6) transitions.
// Phase 1: matrix 342 rows 241 cols
[2025-05-30 18:17:11] [INFO ] Computed 12 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:17:11] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-05-30 18:17:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:17:11] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:17:12] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 241/322 places, 342/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1897 ms. Remains : 241/322 places, 342/480 transitions.
Support contains 60 out of 241 places after structural reductions.
[2025-05-30 18:17:12] [INFO ] Flatten gal took : 109 ms
[2025-05-30 18:17:12] [INFO ] Flatten gal took : 53 ms
[2025-05-30 18:17:12] [INFO ] Input system was already deterministic with 342 transitions.
Support contains 58 out of 241 places (down from 60) after GAL structural reductions.
RANDOM walk for 40000 steps (239 resets) in 2599 ms. (15 steps per ms) remains 6/35 properties
BEST_FIRST walk for 40004 steps (29 resets) in 343 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (30 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (28 resets) in 209 ms. (190 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
[2025-05-30 18:17:13] [INFO ] Invariant cache hit.
[2025-05-30 18:17:13] [INFO ] State equation strengthened by 190 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 234/583 variables, and 6 constraints, problems are : Problem set: 5 solved, 0 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 6/11 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/241 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CANConstruction-PT-010-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA CANConstruction-PT-010-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 44 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 226 transition count 315
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 226 transition count 315
Applied a total of 30 rules in 12 ms. Remains 226 /241 variables (removed 15) and now considering 315/342 (removed 27) transitions.
// Phase 1: matrix 315 rows 226 cols
[2025-05-30 18:17:14] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:17:14] [INFO ] Implicit Places using invariants in 194 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/241 places, 315/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 224 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 314
Applied a total of 2 rules in 13 ms. Remains 224 /225 variables (removed 1) and now considering 314/315 (removed 1) transitions.
// Phase 1: matrix 314 rows 224 cols
[2025-05-30 18:17:14] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:17:14] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-30 18:17:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:17:15] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:17:15] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 224/241 places, 314/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1118 ms. Remains : 224/241 places, 314/342 transitions.
Stuttering acceptance computed with spot in 391 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-01
Product exploration explored 100000 steps with 603 reset in 470 ms.
Product exploration explored 100000 steps with 610 reset in 283 ms.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 7325 steps (44 resets) in 50 ms. (143 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 222 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 314/314 transitions.
Applied a total of 0 rules in 10 ms. Remains 224 /224 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2025-05-30 18:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:17:18] [INFO ] Implicit Places using invariants in 536 ms returned []
[2025-05-30 18:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:17:18] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:17:19] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-05-30 18:17:19] [INFO ] Invariant cache hit.
[2025-05-30 18:17:19] [INFO ] State equation strengthened by 190 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:23] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:23] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:23] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:23] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:23] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:24] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:24] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:24] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:24] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:24] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:24] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:24] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:24] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:24] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:25] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:25] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:25] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:25] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:25] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:25] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:26] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:26] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:26] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:27] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:27] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:27] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:27] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:27] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:27] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:27] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:27] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:28] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:28] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:28] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:28] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:28] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:28] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:28] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:28] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:29] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:30] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:30] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:30] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:30] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:30] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:30] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:30] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:31] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:31] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:31] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:31] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:31] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:31] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:32] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:32] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:32] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:32] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:32] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:32] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:32] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:35] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:36] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:36] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:36] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:36] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:36] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:36] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:36] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:37] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:37] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:37] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:37] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:37] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:37] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:38] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:38] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:38] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:38] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:38] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:38] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:38] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:39] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:39] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:39] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:40] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:40] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:40] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:40] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:40] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:40] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:40] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:40] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:41] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:41] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:41] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:41] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:41] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:41] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:41] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:41] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:43] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:43] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:43] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:43] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:43] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:43] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:43] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:44] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:44] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:44] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:44] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:44] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:44] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:44] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:45] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:45] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:45] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:45] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:45] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:45] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:49] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:49] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:49] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:49] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:49] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:49] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 9 ms to minimize.
SMT process timed out in 30161ms, After SMT, problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 30169ms
Finished structural reductions in LTL mode , in 1 iterations and 31629 ms. Remains : 224/224 places, 314/314 transitions.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3610 steps (21 resets) in 21 ms. (164 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 601 reset in 272 ms.
Product exploration explored 100000 steps with 600 reset in 316 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 314/314 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 224 transition count 314
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 40 place count 224 transition count 314
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 224 transition count 314
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 70 place count 204 transition count 294
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 90 place count 204 transition count 294
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 1 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 129 place count 204 transition count 294
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 178 place count 155 transition count 245
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 227 place count 155 transition count 245
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 237 place count 155 transition count 333
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 237 rules in 127 ms. Remains 155 /224 variables (removed 69) and now considering 333/314 (removed -19) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:17:52] [INFO ] Redundant transitions in 55 ms returned []
Running 323 sub problems to find dead transitions.
// Phase 1: matrix 333 rows 155 cols
[2025-05-30 18:17:52] [INFO ] Computed 11 invariants in 4 ms
[2025-05-30 18:17:52] [INFO ] State equation strengthened by 278 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:54] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:54] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:54] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:54] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:54] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:54] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:54] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:54] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:55] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:56] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:56] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:56] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:56] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:56] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:56] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:57] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:58] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:58] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:58] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 5 ms to minimize.
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:17:59] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:00] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:00] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:00] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:00] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:00] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:00] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:00] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:00] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 15 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 20/71 constraints. Problems are: Problem set: 4 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:02] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:02] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:02] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:03] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:04] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:04] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:04] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:04] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:04] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:04] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 20/91 constraints. Problems are: Problem set: 4 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:04] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:05] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:05] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:05] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:05] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Problem TDEAD102 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:05] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:05] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:05] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:05] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:05] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 6 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:06] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 20/111 constraints. Problems are: Problem set: 8 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:07] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:07] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:07] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:07] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:08] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:08] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:08] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 11/122 constraints. Problems are: Problem set: 8 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:12] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:12] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:12] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:12] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:12] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:12] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:12] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:12] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:13] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:13] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:13] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 12/134 constraints. Problems are: Problem set: 8 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:14] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/135 constraints. Problems are: Problem set: 8 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:17] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 1/136 constraints. Problems are: Problem set: 8 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:20] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 1/137 constraints. Problems are: Problem set: 8 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:22] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
SMT process timed out in 30247ms, After SMT, problems are : Problem set: 8 solved, 315 unsolved
Search for dead transitions found 8 dead transitions in 30255ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/224 places, 325/314 transitions.
Graph (complete) has 932 edges and 155 vertex of which 149 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 1 rules in 38 ms. Remains 149 /155 variables (removed 6) and now considering 325/325 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/224 places, 325/314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30505 ms. Remains : 149/224 places, 325/314 transitions.
Built C files in :
/tmp/ltsmin7484927335491753510
[2025-05-30 18:18:22] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7484927335491753510
Running compilation step : cd /tmp/ltsmin7484927335491753510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 950 ms.
Running link step : cd /tmp/ltsmin7484927335491753510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin7484927335491753510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8215066559040138222.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 314/314 transitions.
Applied a total of 0 rules in 4 ms. Remains 224 /224 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 224 cols
[2025-05-30 18:18:37] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:18:38] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-30 18:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:18:38] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:18:38] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-05-30 18:18:38] [INFO ] Invariant cache hit.
[2025-05-30 18:18:38] [INFO ] State equation strengthened by 190 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:41] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:42] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:42] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:42] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:42] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:42] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:42] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:42] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:42] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:42] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:43] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:43] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:43] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:43] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:43] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:43] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:43] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:44] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:44] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:44] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:45] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:45] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:45] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:45] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:45] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:45] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:46] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:46] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:46] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:46] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:46] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:46] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:46] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:46] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:47] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:47] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:47] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:47] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:47] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:47] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:48] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:48] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:48] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:48] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:48] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:49] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:49] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:49] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:49] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:49] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:50] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:50] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:50] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:50] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:50] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:50] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:50] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:50] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:51] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:51] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:53] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:54] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:54] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:54] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:54] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:54] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:54] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:54] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:55] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:55] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:55] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:55] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:55] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:55] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:56] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:56] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:56] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:56] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:56] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:56] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:57] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:57] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:58] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:58] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:59] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:59] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:59] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:59] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:59] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:18:59] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:00] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:00] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:00] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:00] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:00] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:00] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:00] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:01] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:01] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:01] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:03] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:03] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:03] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:03] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:03] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:03] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:04] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:04] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:04] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:04] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:04] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:04] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:05] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:05] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:05] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:05] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:05] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:05] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:06] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:06] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 20 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 223/538 variables, and 131 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/224 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 120/120 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:10] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:10] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:11] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:12] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:12] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:12] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:12] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:12] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:12] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:12] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:13] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:14] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:14] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:14] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:14] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:14] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:14] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:14] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:15] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:15] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:15] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:15] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:15] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:15] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:15] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:15] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:15] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:16] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:16] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:16] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:17] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:17] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:17] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:17] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:18] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:18] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:18] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:18] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:18] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:18] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:18] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:18] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:19] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:19] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:19] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:19] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:19] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:19] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:20] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:20] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:21] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:21] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:21] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:21] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:22] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:23] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:23] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:23] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:23] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:23] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:25] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:25] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:25] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:25] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:25] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:26] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:26] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:26] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:26] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:26] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:26] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:26] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:26] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:27] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:27] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:27] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:27] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:27] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:27] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:27] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:29] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:29] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:30] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:30] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:30] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:30] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:30] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:30] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:30] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:31] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:31] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:31] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:31] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:31] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:31] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:32] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:32] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:32] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:32] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:32] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:34] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:34] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:34] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:34] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:34] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:34] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:35] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:35] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:35] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:35] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:35] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:35] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:35] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:35] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:36] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:36] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:36] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:36] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:36] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:36] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:38] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:19:38] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 5 ms to minimize.
SMT process timed out in 60168ms, After SMT, problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in LTL mode , in 1 iterations and 61029 ms. Remains : 224/224 places, 314/314 transitions.
Built C files in :
/tmp/ltsmin14065663918294256975
[2025-05-30 18:19:38] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14065663918294256975
Running compilation step : cd /tmp/ltsmin14065663918294256975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 974 ms.
Running link step : cd /tmp/ltsmin14065663918294256975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14065663918294256975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16318635211835899839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 18:19:54] [INFO ] Flatten gal took : 33 ms
[2025-05-30 18:19:54] [INFO ] Flatten gal took : 23 ms
[2025-05-30 18:19:54] [INFO ] Time to serialize gal into /tmp/LTL17533184584591442644.gal : 9 ms
[2025-05-30 18:19:54] [INFO ] Time to serialize properties into /tmp/LTL9021865731116120483.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17533184584591442644.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7507006441723811788.hoa' '-atoms' '/tmp/LTL9021865731116120483.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9021865731116120483.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7507006441723811788.hoa
Detected timeout of ITS tools.
[2025-05-30 18:20:09] [INFO ] Flatten gal took : 19 ms
[2025-05-30 18:20:09] [INFO ] Flatten gal took : 20 ms
[2025-05-30 18:20:09] [INFO ] Time to serialize gal into /tmp/LTL9049738807256109628.gal : 5 ms
[2025-05-30 18:20:09] [INFO ] Time to serialize properties into /tmp/LTL8964015004363746844.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9049738807256109628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8964015004363746844.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("((Node3GiveAnswer5>=3)||(Node0DHTinfo<=Node9GiveAnswer2))"))))))))
Formula 0 simplified : XXXXXF!"((Node3GiveAnswer5>=3)||(Node0DHTinfo<=Node9GiveAnswer2))"
Detected timeout of ITS tools.
[2025-05-30 18:20:24] [INFO ] Flatten gal took : 18 ms
[2025-05-30 18:20:24] [INFO ] Applying decomposition
[2025-05-30 18:20:24] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1407084448613575381.txt' '-o' '/tmp/graph1407084448613575381.bin' '-w' '/tmp/graph1407084448613575381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1407084448613575381.bin' '-l' '-1' '-v' '-w' '/tmp/graph1407084448613575381.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:20:24] [INFO ] Decomposing Gal with order
[2025-05-30 18:20:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:20:24] [INFO ] Removed a total of 143 redundant transitions.
[2025-05-30 18:20:24] [INFO ] Flatten gal took : 145 ms
[2025-05-30 18:20:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 24 ms.
[2025-05-30 18:20:24] [INFO ] Time to serialize gal into /tmp/LTL349928659040240508.gal : 8 ms
[2025-05-30 18:20:24] [INFO ] Time to serialize properties into /tmp/LTL17454939937972355177.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL349928659040240508.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17454939937972355177.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("((gi0.gi0.gu23.Node3GiveAnswer5>=3)||(gu41.Node0DHTinfo<=gu41.Node9GiveAnswer2))"))))))))
Formula 0 simplified : XXXXXF!"((gi0.gi0.gu23.Node3GiveAnswer5>=3)||(gu41.Node0DHTinfo<=gu41.Node9GiveAnswer2))"
Detected timeout of ITS tools.
Treatment of property CANConstruction-PT-010-LTLCardinality-01 finished in 205563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 224 transition count 311
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 224 transition count 311
Applied a total of 34 rules in 7 ms. Remains 224 /241 variables (removed 17) and now considering 311/342 (removed 31) transitions.
// Phase 1: matrix 311 rows 224 cols
[2025-05-30 18:20:39] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:40] [INFO ] Implicit Places using invariants in 259 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 269 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/241 places, 311/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 15 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2025-05-30 18:20:40] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:40] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-30 18:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:40] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:20:41] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/241 places, 310/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1145 ms. Remains : 222/241 places, 310/342 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-02
Stuttering criterion allowed to conclude after 205 steps with 7 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-02 finished in 1267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 241 transition count 276
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 175 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 132 place count 175 transition count 267
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 150 place count 166 transition count 267
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 163 place count 153 transition count 241
Iterating global reduction 2 with 13 rules applied. Total rules applied 176 place count 153 transition count 241
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 183 place count 153 transition count 234
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 190 place count 146 transition count 234
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 206 place count 138 transition count 226
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 226 place count 128 transition count 295
Applied a total of 226 rules in 53 ms. Remains 128 /241 variables (removed 113) and now considering 295/342 (removed 47) transitions.
// Phase 1: matrix 295 rows 128 cols
[2025-05-30 18:20:41] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:41] [INFO ] Implicit Places using invariants in 171 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/241 places, 295/342 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 293
Applied a total of 4 rules in 16 ms. Remains 125 /127 variables (removed 2) and now considering 293/295 (removed 2) transitions.
// Phase 1: matrix 293 rows 125 cols
[2025-05-30 18:20:41] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-05-30 18:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:41] [INFO ] State equation strengthened by 279 read => feed constraints.
[2025-05-30 18:20:42] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/241 places, 293/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1020 ms. Remains : 125/241 places, 293/342 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-03
Stuttering criterion allowed to conclude after 137 steps with 5 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-03 finished in 1114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1&&X(X(X(p0)))))))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 224 transition count 311
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 224 transition count 311
Applied a total of 34 rules in 7 ms. Remains 224 /241 variables (removed 17) and now considering 311/342 (removed 31) transitions.
// Phase 1: matrix 311 rows 224 cols
[2025-05-30 18:20:42] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:42] [INFO ] Implicit Places using invariants in 246 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 249 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/241 places, 311/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 6 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2025-05-30 18:20:42] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:42] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-30 18:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:43] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:20:43] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/241 places, 310/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1107 ms. Remains : 222/241 places, 310/342 transitions.
Stuttering acceptance computed with spot in 565 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 32 ms. Reduced automaton from 11 states, 23 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-010-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-010-LTLCardinality-04 finished in 2338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&(G(p1)||F(G(!p1)))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 225 transition count 313
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 225 transition count 313
Applied a total of 32 rules in 11 ms. Remains 225 /241 variables (removed 16) and now considering 313/342 (removed 29) transitions.
// Phase 1: matrix 313 rows 225 cols
[2025-05-30 18:20:44] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:44] [INFO ] Implicit Places using invariants in 237 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/241 places, 313/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 312
Applied a total of 2 rules in 11 ms. Remains 223 /224 variables (removed 1) and now considering 312/313 (removed 1) transitions.
// Phase 1: matrix 312 rows 223 cols
[2025-05-30 18:20:44] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:45] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-05-30 18:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:45] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:20:46] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/241 places, 312/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1406 ms. Remains : 223/241 places, 312/342 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), p1, false, (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 309 steps with 2 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-05 finished in 1675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0&&G(p1))||(p1&&X(G(p0)))) U X(X(p2))))'
Support contains 5 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 224 transition count 311
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 224 transition count 311
Applied a total of 34 rules in 8 ms. Remains 224 /241 variables (removed 17) and now considering 311/342 (removed 31) transitions.
// Phase 1: matrix 311 rows 224 cols
[2025-05-30 18:20:46] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:46] [INFO ] Implicit Places using invariants in 217 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 220 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/241 places, 311/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 14 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2025-05-30 18:20:46] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:46] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-05-30 18:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:47] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:20:47] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/241 places, 310/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1402 ms. Remains : 222/241 places, 310/342 transitions.
Stuttering acceptance computed with spot in 861 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 161 ms.
Product exploration explored 100000 steps with 33333 reset in 172 ms.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 35 ms. Reduced automaton from 17 states, 44 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-010-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-010-LTLCardinality-07 finished in 2664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0&&X(!p0))||X((p0&&(G(p1)||(p1&&F(p2))))))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 228 transition count 318
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 228 transition count 318
Applied a total of 26 rules in 6 ms. Remains 228 /241 variables (removed 13) and now considering 318/342 (removed 24) transitions.
// Phase 1: matrix 318 rows 228 cols
[2025-05-30 18:20:49] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:49] [INFO ] Implicit Places using invariants in 275 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 277 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/241 places, 318/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 226 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 317
Applied a total of 2 rules in 9 ms. Remains 226 /227 variables (removed 1) and now considering 317/318 (removed 1) transitions.
// Phase 1: matrix 317 rows 226 cols
[2025-05-30 18:20:49] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:49] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-05-30 18:20:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:49] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:20:50] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 226/241 places, 317/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1523 ms. Remains : 226/241 places, 317/342 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-08 finished in 1735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 226 transition count 314
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 226 transition count 314
Applied a total of 30 rules in 5 ms. Remains 226 /241 variables (removed 15) and now considering 314/342 (removed 28) transitions.
// Phase 1: matrix 314 rows 226 cols
[2025-05-30 18:20:50] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:51] [INFO ] Implicit Places using invariants in 271 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 281 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/241 places, 314/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 224 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 313
Applied a total of 2 rules in 6 ms. Remains 224 /225 variables (removed 1) and now considering 313/314 (removed 1) transitions.
// Phase 1: matrix 313 rows 224 cols
[2025-05-30 18:20:51] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:51] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-05-30 18:20:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:51] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:20:52] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 224/241 places, 313/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1385 ms. Remains : 224/241 places, 313/342 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 13 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-010-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-010-LTLCardinality-10 finished in 1903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 224 transition count 311
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 224 transition count 311
Applied a total of 34 rules in 6 ms. Remains 224 /241 variables (removed 17) and now considering 311/342 (removed 31) transitions.
// Phase 1: matrix 311 rows 224 cols
[2025-05-30 18:20:52] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:52] [INFO ] Implicit Places using invariants in 205 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 207 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/241 places, 311/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 7 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2025-05-30 18:20:52] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:53] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-05-30 18:20:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:53] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:20:53] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/241 places, 310/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1123 ms. Remains : 222/241 places, 310/342 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-010-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-010-LTLCardinality-12 finished in 1545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 225 transition count 313
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 225 transition count 313
Applied a total of 32 rules in 5 ms. Remains 225 /241 variables (removed 16) and now considering 313/342 (removed 29) transitions.
// Phase 1: matrix 313 rows 225 cols
[2025-05-30 18:20:54] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:54] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-05-30 18:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:20:54] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:20:55] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2025-05-30 18:20:55] [INFO ] Invariant cache hit.
[2025-05-30 18:20:55] [INFO ] State equation strengthened by 190 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:57] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:57] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:57] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:57] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:57] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:57] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:58] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:59] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:59] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:59] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:20:59] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:01] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:01] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:01] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:01] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:01] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:01] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:01] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:02] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:03] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:03] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:03] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:06] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:06] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:06] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:06] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:06] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:06] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:07] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:07] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:07] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:07] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:07] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:07] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:07] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:08] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:08] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:08] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:08] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:08] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:08] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:08] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:09] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:09] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:10] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:10] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:10] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:10] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:10] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:10] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:10] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:11] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:11] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:11] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:11] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:11] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:11] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:11] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:11] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:12] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:12] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:12] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:13] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:13] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:14] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:14] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:14] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:14] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:14] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:14] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:14] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:15] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:15] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:15] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:15] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:15] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:15] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:15] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:16] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:16] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:16] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:16] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:19] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:20] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:20] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:20] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:20] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:20] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:21] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:21] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:21] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:21] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:21] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:21] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:21] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:22] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:22] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:22] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:22] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:22] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:22] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:23] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:24] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:24] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:24] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:24] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:24] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:25] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 5 ms to minimize.
SMT process timed out in 30062ms, After SMT, problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 30064ms
Starting structural reductions in LTL mode, iteration 1 : 225/241 places, 313/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30881 ms. Remains : 225/241 places, 313/342 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1031 steps with 6 reset in 2 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-13 finished in 31132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 241 transition count 277
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 176 transition count 277
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 130 place count 176 transition count 267
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 150 place count 166 transition count 267
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 164 place count 152 transition count 239
Iterating global reduction 2 with 14 rules applied. Total rules applied 178 place count 152 transition count 239
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 186 place count 152 transition count 231
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 194 place count 144 transition count 231
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 206 place count 138 transition count 225
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 226 place count 128 transition count 295
Applied a total of 226 rules in 48 ms. Remains 128 /241 variables (removed 113) and now considering 295/342 (removed 47) transitions.
// Phase 1: matrix 295 rows 128 cols
[2025-05-30 18:21:25] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:25] [INFO ] Implicit Places using invariants in 199 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 213 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/241 places, 295/342 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 293
Applied a total of 4 rules in 18 ms. Remains 125 /127 variables (removed 2) and now considering 293/295 (removed 2) transitions.
// Phase 1: matrix 293 rows 125 cols
[2025-05-30 18:21:25] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:25] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-05-30 18:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:26] [INFO ] State equation strengthened by 280 read => feed constraints.
[2025-05-30 18:21:26] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/241 places, 293/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1336 ms. Remains : 125/241 places, 293/342 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-14
Product exploration explored 100000 steps with 2026 reset in 672 ms.
Stack based approach found an accepted trace after 649 steps with 14 reset with depth 47 and stack size 45 in 6 ms.
FORMULA CANConstruction-PT-010-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-010-LTLCardinality-14 finished in 2136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(!p0)))||X(F(p1))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 224 transition count 311
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 224 transition count 311
Applied a total of 34 rules in 8 ms. Remains 224 /241 variables (removed 17) and now considering 311/342 (removed 31) transitions.
// Phase 1: matrix 311 rows 224 cols
[2025-05-30 18:21:27] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:27] [INFO ] Implicit Places using invariants in 232 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 233 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/241 places, 311/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 5 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2025-05-30 18:21:27] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:27] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-05-30 18:21:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:28] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-05-30 18:21:28] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/241 places, 310/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1072 ms. Remains : 222/241 places, 310/342 transitions.
Stuttering acceptance computed with spot in 181 ms :[false, false, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Computed a total of 31 stabilizing places and 40 stable transitions
Computed a total of 31 stabilizing places and 40 stable transitions
Detected a total of 31/222 stabilizing places and 40/310 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 22 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-010-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-010-LTLCardinality-15 finished in 1866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Found a Lengthening insensitive property : CANConstruction-PT-010-LTLCardinality-01
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 241/241 places, 342/342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 241 transition count 276
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 175 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 174 transition count 275
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 134 place count 174 transition count 266
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 152 place count 165 transition count 266
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 164 place count 153 transition count 242
Iterating global reduction 3 with 12 rules applied. Total rules applied 176 place count 153 transition count 242
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 181 place count 153 transition count 237
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 186 place count 148 transition count 237
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 206 place count 138 transition count 227
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 226 place count 128 transition count 295
Applied a total of 226 rules in 41 ms. Remains 128 /241 variables (removed 113) and now considering 295/342 (removed 47) transitions.
// Phase 1: matrix 295 rows 128 cols
[2025-05-30 18:21:29] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:30] [INFO ] Implicit Places using invariants in 209 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 223 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 127/241 places, 295/342 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 125 transition count 293
Applied a total of 4 rules in 14 ms. Remains 125 /127 variables (removed 2) and now considering 293/295 (removed 2) transitions.
// Phase 1: matrix 293 rows 125 cols
[2025-05-30 18:21:30] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:30] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-30 18:21:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:30] [INFO ] State equation strengthened by 278 read => feed constraints.
[2025-05-30 18:21:30] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 125/241 places, 293/342 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1114 ms. Remains : 125/241 places, 293/342 transitions.
Running random walk in product with property : CANConstruction-PT-010-LTLCardinality-01
Product exploration explored 100000 steps with 2092 reset in 442 ms.
Product exploration explored 100000 steps with 2102 reset in 472 ms.
Computed a total of 12 stabilizing places and 21 stable transitions
Computed a total of 12 stabilizing places and 21 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 975 steps (21 resets) in 10 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 293/293 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2025-05-30 18:21:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:33] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-30 18:21:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:21:33] [INFO ] State equation strengthened by 278 read => feed constraints.
[2025-05-30 18:21:33] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2025-05-30 18:21:33] [INFO ] Invariant cache hit.
[2025-05-30 18:21:33] [INFO ] State equation strengthened by 278 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:35] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:35] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:35] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:35] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:35] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:35] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:36] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:37] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:37] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:38] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:21:38] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 293/417 variables, 124/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 278/434 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/418 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/418 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 435 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 125/125 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:05] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:05] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 293/417 variables, 124/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 278/436 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 283/719 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 720 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 125/125 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 60919 ms. Remains : 125/125 places, 293/293 transitions.
Computed a total of 12 stabilizing places and 21 stable transitions
Computed a total of 12 stabilizing places and 21 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 940 steps (20 resets) in 8 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2110 reset in 399 ms.
Product exploration explored 100000 steps with 2107 reset in 357 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:22:36] [INFO ] Redundant transitions in 8 ms returned []
Running 283 sub problems to find dead transitions.
[2025-05-30 18:22:36] [INFO ] Invariant cache hit.
[2025-05-30 18:22:36] [INFO ] State equation strengthened by 278 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:37] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:37] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:37] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:37] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:38] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:38] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:38] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:38] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:38] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:38] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:38] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:38] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:39] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:39] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:39] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:39] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:39] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:39] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:39] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:40] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:41] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 293/417 variables, 124/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 278/434 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/418 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/418 variables, and 435 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 125/125 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:07] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:07] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 293/417 variables, 124/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 278/436 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 283/719 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 720 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 125/125 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60149 ms. Remains : 125/125 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin1320041735837934873
[2025-05-30 18:23:36] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1320041735837934873
Running compilation step : cd /tmp/ltsmin1320041735837934873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1016 ms.
Running link step : cd /tmp/ltsmin1320041735837934873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1320041735837934873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10466050739409987271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 293/293 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2025-05-30 18:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:23:51] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-05-30 18:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:23:51] [INFO ] State equation strengthened by 278 read => feed constraints.
[2025-05-30 18:23:52] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2025-05-30 18:23:52] [INFO ] Invariant cache hit.
[2025-05-30 18:23:52] [INFO ] State equation strengthened by 278 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:53] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:53] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:53] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:53] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:54] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:54] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:54] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:54] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:54] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:54] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:54] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:55] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:55] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:55] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:55] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:55] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:55] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:56] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:56] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 293/417 variables, 124/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 278/434 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/418 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/418 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 435 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 125/125 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:24:23] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:24:23] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 293/417 variables, 124/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 278/436 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 283/719 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 720 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 125/125 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in LTL mode , in 1 iterations and 60910 ms. Remains : 125/125 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin7492449023446008165
[2025-05-30 18:24:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7492449023446008165
Running compilation step : cd /tmp/ltsmin7492449023446008165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 981 ms.
Running link step : cd /tmp/ltsmin7492449023446008165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7492449023446008165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16047217468080022753.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 18:25:07] [INFO ] Flatten gal took : 27 ms
[2025-05-30 18:25:07] [INFO ] Flatten gal took : 17 ms
[2025-05-30 18:25:07] [INFO ] Time to serialize gal into /tmp/LTL10538983245773754684.gal : 3 ms
[2025-05-30 18:25:07] [INFO ] Time to serialize properties into /tmp/LTL4962481594479662629.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10538983245773754684.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13158833600798246035.hoa' '-atoms' '/tmp/LTL4962481594479662629.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4962481594479662629.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13158833600798246035.hoa
Detected timeout of ITS tools.
[2025-05-30 18:25:22] [INFO ] Flatten gal took : 13 ms
[2025-05-30 18:25:22] [INFO ] Flatten gal took : 13 ms
[2025-05-30 18:25:22] [INFO ] Time to serialize gal into /tmp/LTL18127550014693013.gal : 3 ms
[2025-05-30 18:25:22] [INFO ] Time to serialize properties into /tmp/LTL10564482304895624325.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18127550014693013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10564482304895624325.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("((Node3GiveAnswer5>=3)||(Node0DHTinfo<=Node9GiveAnswer2))"))))))))
Formula 0 simplified : XXXXXF!"((Node3GiveAnswer5>=3)||(Node0DHTinfo<=Node9GiveAnswer2))"
Detected timeout of ITS tools.
[2025-05-30 18:25:37] [INFO ] Flatten gal took : 12 ms
[2025-05-30 18:25:37] [INFO ] Applying decomposition
[2025-05-30 18:25:37] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph864931268855911647.txt' '-o' '/tmp/graph864931268855911647.bin' '-w' '/tmp/graph864931268855911647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph864931268855911647.bin' '-l' '-1' '-v' '-w' '/tmp/graph864931268855911647.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:25:37] [INFO ] Decomposing Gal with order
[2025-05-30 18:25:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:25:37] [INFO ] Removed a total of 180 redundant transitions.
[2025-05-30 18:25:37] [INFO ] Flatten gal took : 64 ms
[2025-05-30 18:25:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 10 ms.
[2025-05-30 18:25:37] [INFO ] Time to serialize gal into /tmp/LTL12670380140969021264.gal : 5 ms
[2025-05-30 18:25:37] [INFO ] Time to serialize properties into /tmp/LTL5111077953955576984.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12670380140969021264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5111077953955576984.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("((gi0.gu5.Node3GiveAnswer5>=3)||(gu11.Node0DHTinfo<=gu11.Node9GiveAnswer2))"))))))))
Formula 0 simplified : XXXXXF!"((gi0.gu5.Node3GiveAnswer5>=3)||(gu11.Node0DHTinfo<=gu11.Node9GiveAnswer2))"
Detected timeout of ITS tools.
Treatment of property CANConstruction-PT-010-LTLCardinality-01 finished in 263619 ms.
[2025-05-30 18:25:52] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7101535347182059382
[2025-05-30 18:25:52] [INFO ] Computing symmetric may disable matrix : 342 transitions.
[2025-05-30 18:25:52] [INFO ] Applying decomposition
[2025-05-30 18:25:52] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:25:52] [INFO ] Flatten gal took : 14 ms
[2025-05-30 18:25:52] [INFO ] Computing symmetric may enable matrix : 342 transitions.
[2025-05-30 18:25:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3118176295564794863.txt' '-o' '/tmp/graph3118176295564794863.bin' '-w' '/tmp/graph3118176295564794863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3118176295564794863.bin' '-l' '-1' '-v' '-w' '/tmp/graph3118176295564794863.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:25:53] [INFO ] Decomposing Gal with order
[2025-05-30 18:25:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:25:53] [INFO ] Removed a total of 193 redundant transitions.
[2025-05-30 18:25:53] [INFO ] Flatten gal took : 32 ms
[2025-05-30 18:25:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 8 ms.
[2025-05-30 18:25:53] [INFO ] Computing Do-Not-Accords matrix : 342 transitions.
[2025-05-30 18:25:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality4489872714551902943.gal : 5 ms
[2025-05-30 18:25:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality6676109153427281440.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4489872714551902943.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6676109153427281440.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
[2025-05-30 18:25:53] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:25:53] [INFO ] Built C files in 236ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7101535347182059382
Running compilation step : cd /tmp/ltsmin7101535347182059382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((X(X(X(X(X(G("((gi0.gu21.Node3GiveAnswer5>=3)||(gu47.Node0DHTinfo<=gu47.Node9GiveAnswer2))"))))))))
Formula 0 simplified : XXXXXF!"((gi0.gu21.Node3GiveAnswer5>=3)||(gu47.Node0DHTinfo<=gu47.Node9GiveAnswer2))"
Compilation finished in 1311 ms.
Running link step : cd /tmp/ltsmin7101535347182059382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7101535347182059382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: LTL layer: formula: X(X(X(X(X([]((LTLAPp0==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.012: "X(X(X(X(X([]((LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.063: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.063: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.105: buchi has 7 states
pins2lts-mc-linux64( 0/ 8), 0.137: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.271: DFS-FIFO for weak LTL, using special progress label 344
pins2lts-mc-linux64( 0/ 8), 0.271: There are 345 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.271: State length is 242, there are 350 groups
pins2lts-mc-linux64( 0/ 8), 0.271: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.271: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.271: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.271: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.629: ~1 levels ~960 states ~8584 transitions
pins2lts-mc-linux64( 1/ 8), 0.665: ~1 levels ~1920 states ~17224 transitions
pins2lts-mc-linux64( 1/ 8), 0.794: ~1 levels ~3840 states ~34504 transitions
pins2lts-mc-linux64( 1/ 8), 1.115: ~1 levels ~7680 states ~69064 transitions
pins2lts-mc-linux64( 1/ 8), 1.821: ~1 levels ~15360 states ~138184 transitions
pins2lts-mc-linux64( 1/ 8), 5.553: ~1 levels ~30720 states ~276424 transitions
pins2lts-mc-linux64( 3/ 8), 7.861: ~1 levels ~61440 states ~553000 transitions
pins2lts-mc-linux64( 3/ 8), 13.155: ~1 levels ~122880 states ~1106256 transitions
pins2lts-mc-linux64( 0/ 8), 16.679: ~1 levels ~245760 states ~2213272 transitions
pins2lts-mc-linux64( 3/ 8), 20.884: ~1 levels ~491520 states ~4430528 transitions
pins2lts-mc-linux64( 1/ 8), 27.950: ~1 levels ~983040 states ~8868440 transitions
pins2lts-mc-linux64( 4/ 8), 42.491: ~1 levels ~1966080 states ~17771024 transitions
pins2lts-mc-linux64( 4/ 8), 70.166: ~1 levels ~3932160 states ~35592896 transitions
pins2lts-mc-linux64( 4/ 8), 126.412: ~1 levels ~7864320 states ~71278768 transitions
pins2lts-mc-linux64( 3/ 8), 239.063: ~1 levels ~15728640 states ~142823312 transitions
pins2lts-mc-linux64( 4/ 8), 466.206: ~1 levels ~31457280 states ~286076056 transitions
pins2lts-mc-linux64( 4/ 8), 926.259: ~1 levels ~62914560 states ~573334880 transitions
pins2lts-mc-linux64( 0/ 8), 986.735: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 986.782:
pins2lts-mc-linux64( 0/ 8), 986.782: mean standard work distribution: 1.4% (states) 1.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 986.782:
pins2lts-mc-linux64( 0/ 8), 986.782: Explored 65923620 states 601413404 transitions, fanout: 9.123
pins2lts-mc-linux64( 0/ 8), 986.782: Total exploration time 986.490 sec (986.450 sec minimum, 986.468 sec on average)
pins2lts-mc-linux64( 0/ 8), 986.782: States per second: 66826, Transitions per second: 609650
pins2lts-mc-linux64( 0/ 8), 986.782:
pins2lts-mc-linux64( 0/ 8), 986.782: Progress states detected: 97513987
pins2lts-mc-linux64( 0/ 8), 986.782: Redundant explorations: -32.3958
pins2lts-mc-linux64( 0/ 8), 986.782:
pins2lts-mc-linux64( 0/ 8), 986.782: Queue width: 8B, total height: 57679701, memory: 440.06MB
pins2lts-mc-linux64( 0/ 8), 986.782: Tree memory: 1000.0MB, 10.8 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 986.782: Tree fill ratio (roots/leafs): 72.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 986.782: Stored 347 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 986.782: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 986.782: Est. total memory use: 1440.0MB (~1464.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7101535347182059382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7101535347182059382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Reverse transition relation is NOT exact ! Due to transitions gi0.gu0.t3, gi0.gu8.t116, gi0.gu8.t117, gi0.gu8.t302, gi0.gu8.t303, gi0.gu8.t324, gi0.gu8.t32...876
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2025-05-30 18:48:47] [INFO ] Flatten gal took : 23 ms
[2025-05-30 18:48:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality13535278706364879693.gal : 5 ms
[2025-05-30 18:48:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality5347551583800087657.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13535278706364879693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5347551583800087657.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("((Node3GiveAnswer5>=3)||(Node0DHTinfo<=Node9GiveAnswer2))"))))))))
Formula 0 simplified : XXXXXF!"((Node3GiveAnswer5>=3)||(Node0DHTinfo<=Node9GiveAnswer2))"
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t14, t15, t26, t31, t38, t43, t49, t50, t60, t61, t71, t72, t82, t83, t94, t99, t106,...526
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2025-05-30 19:11:42] [INFO ] Flatten gal took : 13 ms
[2025-05-30 19:11:42] [INFO ] Input system was already deterministic with 342 transitions.
[2025-05-30 19:11:42] [INFO ] Transformed 241 places.
[2025-05-30 19:11:42] [INFO ] Transformed 342 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 19:11:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality14004027627938156551.gal : 2 ms
[2025-05-30 19:11:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality11464641662878735664.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14004027627938156551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11464641662878735664.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(X(X(G("((Node3GiveAnswer5>=3)||(Node0DHTinfo<=Node9GiveAnswer2))"))))))))
Formula 0 simplified : XXXXXF!"((Node3GiveAnswer5>=3)||(Node0DHTinfo<=Node9GiveAnswer2))"

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-010, 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 r030-smll-174853813400171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-010.tgz
mv CANConstruction-PT-010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;