Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r444-smll-171701110700100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is UtilityControlRoom-COL-Z4T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110700100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 8.0K Apr 13 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 05:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 05:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 05:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 05:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717087597070

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T3N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-30 16:46:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 16:46:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:46:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 16:46:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 16:46:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1322 ms
[2024-05-30 16:46:41] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 376 PT places and 750.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 16:46:41] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 10 ms.
[2024-05-30 16:46:41] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 12 to 8
RANDOM walk for 8762 steps (1 resets) in 335 ms. (26 steps per ms) remains 0/8 properties
[2024-05-30 16:46:42] [INFO ] Flatten gal took : 36 ms
[2024-05-30 16:46:42] [INFO ] Flatten gal took : 9 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 16:46:42] [INFO ] Unfolded HLPN to a Petri net with 376 places and 750 transitions 2410 arcs in 72 ms.
[2024-05-30 16:46:42] [INFO ] Unfolded 14 HLPN properties in 3 ms.
[2024-05-30 16:46:42] [INFO ] Reduced 30 identical enabling conditions.
[2024-05-30 16:46:42] [INFO ] Reduced 30 identical enabling conditions.
[2024-05-30 16:46:42] [INFO ] Reduced 30 identical enabling conditions.
[2024-05-30 16:46:42] [INFO ] Reduced 30 identical enabling conditions.
[2024-05-30 16:46:42] [INFO ] Reduced 30 identical enabling conditions.
[2024-05-30 16:46:42] [INFO ] Reduced 30 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 335 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 29 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2024-05-30 16:46:42] [INFO ] Computed 23 invariants in 54 ms
[2024-05-30 16:46:43] [INFO ] Implicit Places using invariants in 674 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 746 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 590/590 transitions.
Applied a total of 0 rules in 12 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 811 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 335 out of 375 places after structural reductions.
[2024-05-30 16:46:43] [INFO ] Flatten gal took : 158 ms
[2024-05-30 16:46:43] [INFO ] Flatten gal took : 105 ms
[2024-05-30 16:46:44] [INFO ] Input system was already deterministic with 590 transitions.
Reduction of identical properties reduced properties to check from 15 to 12
RANDOM walk for 2061 steps (0 resets) in 187 ms. (10 steps per ms) remains 0/12 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(((G(p0) U !p1)||G(!p0)))))||F(p2)))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 41 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-30 16:46:45] [INFO ] Computed 22 invariants in 17 ms
[2024-05-30 16:46:45] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-30 16:46:45] [INFO ] Invariant cache hit.
[2024-05-30 16:46:45] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 16:46:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61513ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61545ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62171 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-00
Product exploration explored 100000 steps with 11098 reset in 1796 ms.
Product exploration explored 100000 steps with 11033 reset in 1435 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 59 steps (0 resets) in 26 ms. (2 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 4 factoid took 625 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 16 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-30 16:47:52] [INFO ] Invariant cache hit.
[2024-05-30 16:47:52] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-30 16:47:52] [INFO ] Invariant cache hit.
[2024-05-30 16:47:52] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 16:47:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61399ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61415ms
Finished structural reductions in LTL mode , in 1 iterations and 62106 ms. Remains : 255/255 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 333 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 47 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 3 factoid took 521 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 180 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 11021 reset in 1600 ms.
Product exploration explored 100000 steps with 10940 reset in 1322 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 169 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 38 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-30 16:48:59] [INFO ] Redundant transitions in 47 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-30 16:48:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61418ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61428ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61524 ms. Remains : 255/255 places, 470/470 transitions.
Built C files in :
/tmp/ltsmin5519193655854425295
[2024-05-30 16:50:00] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5519193655854425295
Running compilation step : cd /tmp/ltsmin5519193655854425295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1723 ms.
Running link step : cd /tmp/ltsmin5519193655854425295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin5519193655854425295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14669686879901904687.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-30 16:50:16] [INFO ] Invariant cache hit.
[2024-05-30 16:50:16] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-30 16:50:16] [INFO ] Invariant cache hit.
[2024-05-30 16:50:16] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 16:50:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61081ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61087ms
Finished structural reductions in LTL mode , in 1 iterations and 61568 ms. Remains : 255/255 places, 470/470 transitions.
Built C files in :
/tmp/ltsmin15555439704080036324
[2024-05-30 16:51:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15555439704080036324
Running compilation step : cd /tmp/ltsmin15555439704080036324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1599 ms.
Running link step : cd /tmp/ltsmin15555439704080036324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15555439704080036324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased123143170658161343.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 16:51:32] [INFO ] Flatten gal took : 45 ms
[2024-05-30 16:51:32] [INFO ] Flatten gal took : 42 ms
[2024-05-30 16:51:33] [INFO ] Time to serialize gal into /tmp/LTL14197961709994032945.gal : 11 ms
[2024-05-30 16:51:33] [INFO ] Time to serialize properties into /tmp/LTL12913695506692480068.prop : 4 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14197961709994032945.gal' '-t' 'CGAL' '-hoa' '/tmp/aut812110815548942443.hoa' '-atoms' '/tmp/LTL12913695506692480068.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12913695506692480068.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut812110815548942443.hoa
Detected timeout of ITS tools.
[2024-05-30 16:51:48] [INFO ] Flatten gal took : 33 ms
[2024-05-30 16:51:48] [INFO ] Flatten gal took : 32 ms
[2024-05-30 16:51:48] [INFO ] Time to serialize gal into /tmp/LTL11137115314852611170.gal : 8 ms
[2024-05-30 16:51:48] [INFO ] Time to serialize properties into /tmp/LTL11665455748597132700.ltl : 9 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11137115314852611170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11665455748597132700.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(((G("(((((((((((IdleTechs_2>=1)&&(OpenRequests_26>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_12>=1))&&(Idles>=1)))...19146
Formula 0 simplified : XXG((F!"(((((((((((IdleTechs_2>=1)&&(OpenRequests_26>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_12>=1))&&(Idles>=1)))||(((...19127
Detected timeout of ITS tools.
[2024-05-30 16:52:03] [INFO ] Flatten gal took : 31 ms
[2024-05-30 16:52:03] [INFO ] Applying decomposition
[2024-05-30 16:52:03] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1840064732094755048.txt' '-o' '/tmp/graph1840064732094755048.bin' '-w' '/tmp/graph1840064732094755048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1840064732094755048.bin' '-l' '-1' '-v' '-w' '/tmp/graph1840064732094755048.weights' '-q' '0' '-e' '0.001'
[2024-05-30 16:52:03] [INFO ] Decomposing Gal with order
[2024-05-30 16:52:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 16:52:03] [INFO ] Removed a total of 687 redundant transitions.
[2024-05-30 16:52:03] [INFO ] Flatten gal took : 122 ms
[2024-05-30 16:52:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 39 ms.
[2024-05-30 16:52:03] [INFO ] Time to serialize gal into /tmp/LTL12001966816621180241.gal : 15 ms
[2024-05-30 16:52:03] [INFO ] Time to serialize properties into /tmp/LTL5390894300025384624.ltl : 11 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12001966816621180241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5390894300025384624.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(((G("(((((((((((i1.i0.u31.IdleTechs_2>=1)&&(i4.u20.OpenRequests_26>=1))&&(i6.i0.u33.Idles>=1))||(((i6.i1.u12.IdleTechs_0>=1)...28432
Formula 0 simplified : XXG((F!"(((((((((((i1.i0.u31.IdleTechs_2>=1)&&(i4.u20.OpenRequests_26>=1))&&(i6.i0.u33.Idles>=1))||(((i6.i1.u12.IdleTechs_0>=1)&&(i6...28413
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1254 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.6724,309980,1,0,530068,1040,3880,422869,167,4930,784172
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-00 finished in 333352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 21 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-05-30 16:52:18] [INFO ] Invariant cache hit.
[2024-05-30 16:52:18] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-30 16:52:18] [INFO ] Invariant cache hit.
[2024-05-30 16:52:19] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 16:52:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61198ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61209ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62063 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-01 finished in 62273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1&&X(X(X(X(F(p0)))))))))'
Support contains 210 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 11 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-05-30 16:53:20] [INFO ] Computed 22 invariants in 16 ms
[2024-05-30 16:53:20] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-30 16:53:20] [INFO ] Invariant cache hit.
[2024-05-30 16:53:21] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-30 16:53:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61200ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61213ms
Finished structural reductions in LTL mode , in 1 iterations and 62187 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
Product exploration explored 100000 steps with 20000 reset in 696 ms.
Product exploration explored 100000 steps with 20000 reset in 487 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 82 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 50 out of 375 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 7 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-05-30 16:54:25] [INFO ] Invariant cache hit.
[2024-05-30 16:54:25] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-30 16:54:25] [INFO ] Invariant cache hit.
[2024-05-30 16:54:26] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-30 16:54:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61171ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61183ms
Finished structural reductions in LTL mode , in 1 iterations and 62097 ms. Remains : 375/375 places, 590/590 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 91 steps (0 resets) in 9 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 440 ms.
Product exploration explored 100000 steps with 20000 reset in 421 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 590
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 200 place count 375 transition count 550
Discarding 123 places :
Symmetric choice reduction at 2 with 123 rule applications. Total rules 323 place count 252 transition count 310
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 123 rules applied. Total rules applied 446 place count 252 transition count 310
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 222 transition count 280
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 222 transition count 280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 70 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 536 place count 222 transition count 310
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 536 rules in 83 ms. Remains 222 /375 variables (removed 153) and now considering 310/590 (removed 280) transitions.
[2024-05-30 16:55:29] [INFO ] Redundant transitions in 4 ms returned []
Running 270 sub problems to find dead transitions.
// Phase 1: matrix 310 rows 222 cols
[2024-05-30 16:55:29] [INFO ] Computed 22 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-30 16:55:31] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 31 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 10/222 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-30 16:55:35] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-30 16:55:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 16:55:35] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-30 16:55:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-30 16:55:35] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-30 16:55:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-30 16:55:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-30 16:55:35] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-30 16:55:35] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 9/32 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 90 solved, 180 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 6 (OVERLAPS) 310/532 variables, 222/254 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/254 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/254 constraints. Problems are: Problem set: 100 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 254 constraints, problems are : Problem set: 100 solved, 170 unsolved in 12419 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 100 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 80/222 variables, 22/23 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 9/32 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 310/532 variables, 222/254 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 170/424 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/424 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/424 constraints. Problems are: Problem set: 100 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 424 constraints, problems are : Problem set: 100 solved, 170 unsolved in 14264 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 170/270 constraints, Known Traps: 10/10 constraints]
After SMT, in 26836ms problems are : Problem set: 100 solved, 170 unsolved
Search for dead transitions found 100 dead transitions in 26841ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 222/375 places, 210/590 transitions.
Graph (complete) has 400 edges and 222 vertex of which 152 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.5 ms
Discarding 70 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 29 ms. Remains 151 /222 variables (removed 71) and now considering 210/210 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/375 places, 210/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26975 ms. Remains : 151/375 places, 210/590 transitions.
Built C files in :
/tmp/ltsmin531476047728334168
[2024-05-30 16:55:56] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin531476047728334168
Running compilation step : cd /tmp/ltsmin531476047728334168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2161 ms.
Running link step : cd /tmp/ltsmin531476047728334168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin531476047728334168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1540822593774886821.hoa' '--buchi-type=spotba'
LTSmin run took 798 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-02 finished in 159117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 72 transition count 70
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 3 with 20 rules applied. Total rules applied 696 place count 62 transition count 60
Applied a total of 696 rules in 62 ms. Remains 62 /375 variables (removed 313) and now considering 60/590 (removed 530) transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-05-30 16:55:59] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 16:55:59] [INFO ] Implicit Places using invariants in 87 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/375 places, 60/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 61/375 places, 60/590 transitions.
Stuttering acceptance computed with spot in 52 ms :[false]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 363 ms.
Stack based approach found an accepted trace after 1186 steps with 0 reset with depth 1187 and stack size 1186 in 8 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-04 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(G((X(p0) U !p1)))) U G(p2))))'
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-05-30 16:56:00] [INFO ] Computed 22 invariants in 10 ms
[2024-05-30 16:56:00] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-30 16:56:00] [INFO ] Invariant cache hit.
[2024-05-30 16:56:01] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-30 16:56:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61158ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61170ms
Finished structural reductions in LTL mode , in 1 iterations and 61988 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (NOT p2), p1, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-05
Product exploration explored 100000 steps with 1669 reset in 953 ms.
Product exploration explored 100000 steps with 1715 reset in 672 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 360 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 197 steps (0 resets) in 7 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 490 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-05-30 16:57:06] [INFO ] Invariant cache hit.
[2024-05-30 16:57:08] [INFO ] [Real]Absence check using 22 positive place invariants in 28 ms returned sat
[2024-05-30 16:57:09] [INFO ] [Real]Absence check using state equation in 1454 ms returned sat
[2024-05-30 16:57:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:57:12] [INFO ] [Nat]Absence check using 22 positive place invariants in 34 ms returned sat
[2024-05-30 16:57:13] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2024-05-30 16:57:13] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 71 ms.
[2024-05-30 16:57:18] [INFO ] Added : 356 causal constraints over 72 iterations in 4783 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-05-30 16:57:18] [INFO ] Invariant cache hit.
[2024-05-30 16:57:18] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-30 16:57:18] [INFO ] Invariant cache hit.
[2024-05-30 16:57:18] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-30 16:57:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61081ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61089ms
Finished structural reductions in LTL mode , in 1 iterations and 61611 ms. Remains : 375/375 places, 590/590 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 143 steps (0 resets) in 6 ms. (20 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 293 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-05-30 16:58:20] [INFO ] Invariant cache hit.
[2024-05-30 16:58:23] [INFO ] [Real]Absence check using 22 positive place invariants in 45 ms returned sat
[2024-05-30 16:58:24] [INFO ] [Real]Absence check using state equation in 1326 ms returned sat
[2024-05-30 16:58:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:58:27] [INFO ] [Nat]Absence check using 22 positive place invariants in 41 ms returned sat
[2024-05-30 16:58:28] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2024-05-30 16:58:28] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 73 ms.
[2024-05-30 16:58:33] [INFO ] Added : 356 causal constraints over 72 iterations in 4779 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), p1, p1]
Product exploration explored 100000 steps with 1671 reset in 658 ms.
Product exploration explored 100000 steps with 1686 reset in 1006 ms.
Built C files in :
/tmp/ltsmin14611165240918982487
[2024-05-30 16:58:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14611165240918982487
Running compilation step : cd /tmp/ltsmin14611165240918982487;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2565 ms.
Running link step : cd /tmp/ltsmin14611165240918982487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin14611165240918982487;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17063315486717463155.hoa' '--buchi-type=spotba'
LTSmin run took 360 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-05 finished in 158068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((G(!p1)||p0))) U p1)))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 9 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-30 16:58:38] [INFO ] Computed 22 invariants in 5 ms
[2024-05-30 16:58:38] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-30 16:58:38] [INFO ] Invariant cache hit.
[2024-05-30 16:58:39] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 16:58:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61186ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61197ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61864 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-06
Product exploration explored 100000 steps with 2340 reset in 550 ms.
Product exploration explored 100000 steps with 2372 reset in 591 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 266 steps (0 resets) in 17 ms. (14 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 369 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-05-30 16:59:43] [INFO ] Invariant cache hit.
[2024-05-30 16:59:45] [INFO ] [Real]Absence check using 22 positive place invariants in 27 ms returned sat
[2024-05-30 16:59:46] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-05-30 16:59:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:59:48] [INFO ] [Nat]Absence check using 22 positive place invariants in 21 ms returned sat
[2024-05-30 16:59:48] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2024-05-30 16:59:48] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-30 16:59:49] [INFO ] Added : 196 causal constraints over 40 iterations in 1292 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 16:59:49] [INFO ] Invariant cache hit.
[2024-05-30 16:59:50] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2024-05-30 16:59:50] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2024-05-30 16:59:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:59:50] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2024-05-30 16:59:51] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2024-05-30 16:59:51] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-30 16:59:53] [INFO ] Added : 284 causal constraints over 57 iterations in 1884 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 430
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 215 transition count 430
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 175 transition count 390
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 200 place count 175 transition count 350
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 1 with 20 rules applied. Total rules applied 220 place count 165 transition count 340
Applied a total of 220 rules in 22 ms. Remains 165 /255 variables (removed 90) and now considering 340/470 (removed 130) transitions.
// Phase 1: matrix 340 rows 165 cols
[2024-05-30 16:59:53] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 16:59:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-30 16:59:53] [INFO ] Invariant cache hit.
[2024-05-30 16:59:53] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-30 16:59:53] [INFO ] Redundant transitions in 2 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-30 16:59:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 187 constraints, problems are : Problem set: 0 solved, 290 unsolved in 14801 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 290/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 26019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 41408ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 41412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/255 places, 340/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41763 ms. Remains : 165/255 places, 340/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 485 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 135 steps (0 resets) in 15 ms. (8 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 692 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-05-30 17:00:37] [INFO ] Invariant cache hit.
[2024-05-30 17:00:39] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-05-30 17:00:39] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-05-30 17:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:00:41] [INFO ] [Nat]Absence check using 22 positive place invariants in 22 ms returned sat
[2024-05-30 17:00:41] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-05-30 17:00:41] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-30 17:00:43] [INFO ] Added : 181 causal constraints over 37 iterations in 1175 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 17:00:43] [INFO ] Invariant cache hit.
[2024-05-30 17:00:43] [INFO ] [Real]Absence check using 22 positive place invariants in 21 ms returned sat
[2024-05-30 17:00:43] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-05-30 17:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:00:43] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-05-30 17:00:44] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2024-05-30 17:00:44] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-30 17:00:44] [INFO ] Added : 109 causal constraints over 22 iterations in 659 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 3584 reset in 1503 ms.
Product exploration explored 100000 steps with 3602 reset in 1261 ms.
Built C files in :
/tmp/ltsmin17964615880254723681
[2024-05-30 17:00:47] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2024-05-30 17:00:47] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:00:47] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2024-05-30 17:00:47] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:00:48] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2024-05-30 17:00:48] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:00:48] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17964615880254723681
Running compilation step : cd /tmp/ltsmin17964615880254723681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1841 ms.
Running link step : cd /tmp/ltsmin17964615880254723681;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17964615880254723681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5382635093241248095.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 55 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Applied a total of 0 rules in 8 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2024-05-30 17:01:02] [INFO ] Invariant cache hit.
[2024-05-30 17:01:03] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-30 17:01:03] [INFO ] Invariant cache hit.
[2024-05-30 17:01:03] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-30 17:01:03] [INFO ] Redundant transitions in 1 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-30 17:01:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 187 constraints, problems are : Problem set: 0 solved, 290 unsolved in 12524 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 290/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 22376 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 35482ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 35486ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35816 ms. Remains : 165/165 places, 340/340 transitions.
Built C files in :
/tmp/ltsmin9103742606147342456
[2024-05-30 17:01:38] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2024-05-30 17:01:38] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:01:38] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2024-05-30 17:01:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:01:38] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2024-05-30 17:01:38] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:01:38] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9103742606147342456
Running compilation step : cd /tmp/ltsmin9103742606147342456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1567 ms.
Running link step : cd /tmp/ltsmin9103742606147342456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9103742606147342456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15570136724655833388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 17:01:53] [INFO ] Flatten gal took : 20 ms
[2024-05-30 17:01:53] [INFO ] Flatten gal took : 19 ms
[2024-05-30 17:01:53] [INFO ] Time to serialize gal into /tmp/LTL11510121267244065502.gal : 4 ms
[2024-05-30 17:01:53] [INFO ] Time to serialize properties into /tmp/LTL11785273530035387500.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11510121267244065502.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14053164597541575294.hoa' '-atoms' '/tmp/LTL11785273530035387500.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11785273530035387500.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14053164597541575294.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-30 17:02:08] [INFO ] Flatten gal took : 16 ms
[2024-05-30 17:02:08] [INFO ] Flatten gal took : 15 ms
[2024-05-30 17:02:09] [INFO ] Time to serialize gal into /tmp/LTL5481319531387924077.gal : 8 ms
[2024-05-30 17:02:09] [INFO ] Time to serialize properties into /tmp/LTL5173123509577851936.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5481319531387924077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5173123509577851936.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(F(((((((((G(!("(((((Finished_2>=1)||(Finished_3>=1))||((Finished_5>=1)||(Finished_4>=1)))||(((Finished_0>=1)||(Finished_1>=1))...9694
Formula 0 simplified : X(G(F"(((((Finished_2>=1)||(Finished_3>=1))||((Finished_5>=1)||(Finished_4>=1)))||(((Finished_0>=1)||(Finished_1>=1))||((Finished_7>...9670
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-30 17:02:24] [INFO ] Flatten gal took : 13 ms
[2024-05-30 17:02:24] [INFO ] Applying decomposition
[2024-05-30 17:02:24] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13534554963230206225.txt' '-o' '/tmp/graph13534554963230206225.bin' '-w' '/tmp/graph13534554963230206225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13534554963230206225.bin' '-l' '-1' '-v' '-w' '/tmp/graph13534554963230206225.weights' '-q' '0' '-e' '0.001'
[2024-05-30 17:02:24] [INFO ] Decomposing Gal with order
[2024-05-30 17:02:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 17:02:24] [INFO ] Removed a total of 528 redundant transitions.
[2024-05-30 17:02:24] [INFO ] Flatten gal took : 32 ms
[2024-05-30 17:02:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 8 ms.
[2024-05-30 17:02:24] [INFO ] Time to serialize gal into /tmp/LTL1978666576473160333.gal : 4 ms
[2024-05-30 17:02:24] [INFO ] Time to serialize properties into /tmp/LTL6875461943839645850.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1978666576473160333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6875461943839645850.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G(F(((((((((G(!("(((((i8.u42.Finished_2>=1)||(i7.u47.Finished_3>=1))||((i2.u49.Finished_5>=1)||(i1.u48.Finished_4>=1)))||(((i0.u...12914
Formula 0 simplified : X(G(F"(((((i8.u42.Finished_2>=1)||(i7.u47.Finished_3>=1))||((i2.u49.Finished_5>=1)||(i1.u48.Finished_4>=1)))||(((i0.u40.Finished_0>=...12890
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-06 finished in 240945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-30 17:02:39] [INFO ] Computed 22 invariants in 4 ms
[2024-05-30 17:02:39] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 17:02:39] [INFO ] Invariant cache hit.
[2024-05-30 17:02:39] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 17:02:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25465 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56354ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56360ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56732 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-07 finished in 56923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&p1))))'
Support contains 20 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 72 transition count 70
Applied a total of 676 rules in 33 ms. Remains 72 /375 variables (removed 303) and now considering 70/590 (removed 520) transitions.
// Phase 1: matrix 70 rows 72 cols
[2024-05-30 17:03:36] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 17:03:36] [INFO ] Implicit Places using invariants in 74 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/375 places, 70/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 71/375 places, 70/590 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-08
Product exploration explored 100000 steps with 5358 reset in 201 ms.
Product exploration explored 100000 steps with 5328 reset in 217 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 84 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 70 rows 71 cols
[2024-05-30 17:03:37] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 17:03:37] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-30 17:03:37] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-30 17:03:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:03:37] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-30 17:03:37] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-30 17:03:37] [INFO ] Computed and/alt/rep : 60/90/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-30 17:03:37] [INFO ] Added : 15 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 71 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 70/70 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-30 17:03:37] [INFO ] Invariant cache hit.
[2024-05-30 17:03:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-30 17:03:37] [INFO ] Invariant cache hit.
[2024-05-30 17:03:37] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-30 17:03:37] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-30 17:03:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/141 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 92 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/141 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 60/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 152 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1174 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2419ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2423ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2598 ms. Remains : 71/71 places, 70/70 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 81 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-30 17:03:40] [INFO ] Invariant cache hit.
[2024-05-30 17:03:40] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-30 17:03:40] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-30 17:03:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:03:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-30 17:03:40] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-30 17:03:40] [INFO ] Computed and/alt/rep : 60/90/60 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 17:03:40] [INFO ] Added : 14 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5331 reset in 202 ms.
Product exploration explored 100000 steps with 5347 reset in 221 ms.
Built C files in :
/tmp/ltsmin16343504505355175779
[2024-05-30 17:03:41] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2024-05-30 17:03:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:03:41] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2024-05-30 17:03:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:03:41] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2024-05-30 17:03:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:03:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16343504505355175779
Running compilation step : cd /tmp/ltsmin16343504505355175779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 290 ms.
Running link step : cd /tmp/ltsmin16343504505355175779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16343504505355175779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9776538633510994400.hoa' '--buchi-type=spotba'
LTSmin run took 14107 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-08 finished in 19678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(F(p1))))))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 12 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-30 17:03:55] [INFO ] Computed 22 invariants in 3 ms
[2024-05-30 17:03:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-30 17:03:55] [INFO ] Invariant cache hit.
[2024-05-30 17:03:56] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 17:03:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25379 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56251ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56258ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56592 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-09
Product exploration explored 100000 steps with 8054 reset in 934 ms.
Product exploration explored 100000 steps with 8118 reset in 946 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Support contains 45 out of 255 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 215 transition count 430
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 120 place count 215 transition count 390
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 1 with 20 rules applied. Total rules applied 140 place count 205 transition count 380
Applied a total of 140 rules in 33 ms. Remains 205 /255 variables (removed 50) and now considering 380/470 (removed 90) transitions.
// Phase 1: matrix 380 rows 205 cols
[2024-05-30 17:04:55] [INFO ] Computed 22 invariants in 3 ms
[2024-05-30 17:04:55] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-30 17:04:55] [INFO ] Invariant cache hit.
[2024-05-30 17:04:55] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-30 17:04:55] [INFO ] Redundant transitions in 1 ms returned []
Running 330 sub problems to find dead transitions.
[2024-05-30 17:04:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 227 constraints, problems are : Problem set: 0 solved, 330 unsolved in 15220 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 330/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 557 constraints, problems are : Problem set: 0 solved, 330 unsolved in 25740 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 41535ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 41539ms
Starting structural reductions in SI_LTL mode, iteration 1 : 205/255 places, 380/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41927 ms. Remains : 205/255 places, 380/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7900 reset in 919 ms.
Product exploration explored 100000 steps with 7938 reset in 919 ms.
Built C files in :
/tmp/ltsmin3246154879880497743
[2024-05-30 17:05:39] [INFO ] Computing symmetric may disable matrix : 380 transitions.
[2024-05-30 17:05:39] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:05:39] [INFO ] Computing symmetric may enable matrix : 380 transitions.
[2024-05-30 17:05:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:05:39] [INFO ] Computing Do-Not-Accords matrix : 380 transitions.
[2024-05-30 17:05:39] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:05:39] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3246154879880497743
Running compilation step : cd /tmp/ltsmin3246154879880497743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1918 ms.
Running link step : cd /tmp/ltsmin3246154879880497743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3246154879880497743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6103952452670595102.hoa' '--buchi-type=spotba'
LTSmin run took 1982 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-09 finished in 107845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||(X(p2)&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Support contains 70 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-30 17:05:43] [INFO ] Computed 22 invariants in 3 ms
[2024-05-30 17:05:43] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 17:05:43] [INFO ] Invariant cache hit.
[2024-05-30 17:05:44] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 17:05:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25765 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56656ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56662ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57145 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p1, p1, (AND (NOT p1) (NOT p2)), false, true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-10 finished in 57455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 85 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 5 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-05-30 17:06:41] [INFO ] Invariant cache hit.
[2024-05-30 17:06:41] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-30 17:06:41] [INFO ] Invariant cache hit.
[2024-05-30 17:06:41] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 17:06:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25855 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56772ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56778ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57242 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-11 finished in 57425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0))||((p1&&F(p2)) U X(!p3))))'
Support contains 115 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 5 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-05-30 17:07:38] [INFO ] Invariant cache hit.
[2024-05-30 17:07:38] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-30 17:07:38] [INFO ] Invariant cache hit.
[2024-05-30 17:07:38] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 17:07:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25790 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56702ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56707ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57078 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND p0 p3), (AND p0 p3), (AND (NOT p2) p3 p0), (AND p0 p3), p0, (AND (NOT p2) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) p3 p0))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND (NOT p2) p3 p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND (NOT p2) p3 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 19 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-12 finished in 57899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(X(p0)&&F(p1))))'
Support contains 60 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-05-30 17:08:36] [INFO ] Invariant cache hit.
[2024-05-30 17:08:36] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-30 17:08:36] [INFO ] Invariant cache hit.
[2024-05-30 17:08:37] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 17:08:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 26396 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 57280ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 57286ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57820 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-13 finished in 58662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(!p1)&&X(F(p0)))))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 5 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-05-30 17:09:35] [INFO ] Invariant cache hit.
[2024-05-30 17:09:35] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-30 17:09:35] [INFO ] Invariant cache hit.
[2024-05-30 17:09:35] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 17:09:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25951 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56792ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56798ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57252 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-14
Product exploration explored 100000 steps with 1842 reset in 1953 ms.
Product exploration explored 100000 steps with 1906 reset in 1953 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 14 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 5 factoid took 381 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
[2024-05-30 17:10:37] [INFO ] Invariant cache hit.
[2024-05-30 17:10:39] [INFO ] [Real]Absence check using 22 positive place invariants in 25 ms returned sat
[2024-05-30 17:10:39] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2024-05-30 17:10:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:41] [INFO ] [Nat]Absence check using 22 positive place invariants in 23 ms returned sat
[2024-05-30 17:10:42] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-05-30 17:10:42] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-30 17:10:43] [INFO ] Added : 196 causal constraints over 40 iterations in 1326 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 17:10:43] [INFO ] Invariant cache hit.
[2024-05-30 17:10:43] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-05-30 17:10:44] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2024-05-30 17:10:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:44] [INFO ] [Nat]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-05-30 17:10:44] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2024-05-30 17:10:44] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-30 17:10:44] [INFO ] Added : 0 causal constraints over 0 iterations in 78 ms. Result :sat
Could not prove EG p1
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-30 17:10:44] [INFO ] Invariant cache hit.
[2024-05-30 17:10:44] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-30 17:10:44] [INFO ] Invariant cache hit.
[2024-05-30 17:10:45] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 17:10:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25663 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56581ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56586ms
Finished structural reductions in LTL mode , in 1 iterations and 57015 ms. Remains : 255/255 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 336 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 18 steps (0 resets) in 9 ms. (1 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 5 factoid took 361 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
[2024-05-30 17:11:42] [INFO ] Invariant cache hit.
[2024-05-30 17:11:44] [INFO ] [Real]Absence check using 22 positive place invariants in 25 ms returned sat
[2024-05-30 17:11:45] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2024-05-30 17:11:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:11:46] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-05-30 17:11:47] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2024-05-30 17:11:47] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-30 17:11:48] [INFO ] Added : 196 causal constraints over 40 iterations in 1287 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 17:11:48] [INFO ] Invariant cache hit.
[2024-05-30 17:11:48] [INFO ] [Real]Absence check using 22 positive place invariants in 22 ms returned sat
[2024-05-30 17:11:49] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2024-05-30 17:11:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:11:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-05-30 17:11:49] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2024-05-30 17:11:49] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-30 17:11:49] [INFO ] Added : 0 causal constraints over 0 iterations in 76 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 1878 reset in 1950 ms.
Product exploration explored 100000 steps with 1868 reset in 1931 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 510
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 255 transition count 510
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 255 transition count 510
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 120 place count 255 transition count 470
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 120 rules in 19 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-30 17:11:54] [INFO ] Redundant transitions in 2 ms returned []
Running 460 sub problems to find dead transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-30 17:11:54] [INFO ] Computed 22 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-30 17:11:58] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 10/255 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-30 17:12:05] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-30 17:12:06] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-05-30 17:12:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
[2024-05-30 17:12:06] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-05-30 17:12:06] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-30 17:12:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-05-30 17:12:06] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-05-30 17:12:06] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
[2024-05-30 17:12:06] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
Problem TDEAD158 is UNSAT
[2024-05-30 17:12:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 10/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 470/725 variables, 255/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/725 variables, 0/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 288 constraints, problems are : Problem set: 120 solved, 340 unsolved in 26317 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 120 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 90/255 variables, 22/23 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 10/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 470/725 variables, 255/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 340/628 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/628 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/725 variables, 0/628 constraints. Problems are: Problem set: 120 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 725/725 variables, and 628 constraints, problems are : Problem set: 120 solved, 340 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 340/460 constraints, Known Traps: 11/11 constraints]
After SMT, in 56982ms problems are : Problem set: 120 solved, 340 unsolved
Search for dead transitions found 120 dead transitions in 56990ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 255/255 places, 350/470 transitions.
Graph (complete) has 530 edges and 255 vertex of which 175 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.3 ms
Discarding 80 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 175 /255 variables (removed 80) and now considering 350/350 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 175/255 places, 350/470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57031 ms. Remains : 175/255 places, 350/470 transitions.
Built C files in :
/tmp/ltsmin12205918632326820340
[2024-05-30 17:12:51] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12205918632326820340
Running compilation step : cd /tmp/ltsmin12205918632326820340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1551 ms.
Running link step : cd /tmp/ltsmin12205918632326820340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12205918632326820340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4365780367892350865.hoa' '--buchi-type=spotba'
LTSmin run took 375 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-14 finished in 198155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((G(!p1)||p0))) U p1)))'
[2024-05-30 17:12:53] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1241747731995168028
[2024-05-30 17:12:53] [INFO ] Computing symmetric may disable matrix : 590 transitions.
[2024-05-30 17:12:53] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:12:53] [INFO ] Applying decomposition
[2024-05-30 17:12:53] [INFO ] Computing symmetric may enable matrix : 590 transitions.
[2024-05-30 17:12:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:12:53] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14345786130942919975.txt' '-o' '/tmp/graph14345786130942919975.bin' '-w' '/tmp/graph14345786130942919975.weights'
[2024-05-30 17:12:53] [INFO ] Computing Do-Not-Accords matrix : 590 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14345786130942919975.bin' '-l' '-1' '-v' '-w' '/tmp/graph14345786130942919975.weights' '-q' '0' '-e' '0.001'
[2024-05-30 17:12:53] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 17:12:53] [INFO ] Decomposing Gal with order
[2024-05-30 17:12:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 17:12:53] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1241747731995168028
Running compilation step : cd /tmp/ltsmin1241747731995168028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 17:12:53] [INFO ] Removed a total of 482 redundant transitions.
[2024-05-30 17:12:53] [INFO ] Flatten gal took : 44 ms
[2024-05-30 17:12:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 335 labels/synchronizations in 16 ms.
[2024-05-30 17:12:53] [INFO ] Time to serialize gal into /tmp/LTLFireability11341422313473417804.gal : 6 ms
[2024-05-30 17:12:53] [INFO ] Time to serialize properties into /tmp/LTLFireability9856565985811858989.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11341422313473417804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9856565985811858989.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F(("((((((((((i2.u24.IdleTechs_2>=1)&&(i8.u37.OpenRequests_26>=1))&&(i3.u3.Idles>=1))||(((i0.u39.IdleTechs_0>=1)&&(i4.u33.Open...12970
Formula 0 simplified : X(G(F"(((((i7.u46.Finished_2>=1)||(i4.u41.Finished_3>=1))||((i6.u43.Finished_5>=1)||(i5.u42.Finished_4>=1)))||(((i2.u40.Finished_0>=...12958
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 3117 ms.
Running link step : cd /tmp/ltsmin1241747731995168028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1241747731995168028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(([](!(LTLAPp1==true))||(LTLAPp0==true)))) U (LTLAPp1==true)))' '--buchi-type=spotba'
46 unique states visited
0 strongly connected components in search stack
87 transitions explored
45 items max in DFS search stack
6668 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,66.7578,946484,1,0,1.68128e+06,12320,3784,2.68433e+06,624,77596,2422481
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1735931 ms.

BK_STOP 1717089335756

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="UtilityControlRoom-COL-Z4T3N10"
export BK_EXAMINATION="LTLFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-COL-Z4T3N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r444-smll-171701110700100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;