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.r443-smll-171701109800124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is UtilityControlRoom-COL-Z4T4N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701109800124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.1K Apr 13 05:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 05:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 05:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 05:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 13 05:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 05:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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-Z4T4N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717067234362

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 11:07:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 11:07:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 11:07:16] [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 11:07:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 11:07:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1222 ms
[2024-05-30 11:07:17] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 228 PT places and 450.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 11:07:17] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-05-30 11:07:17] [INFO ] Skeletonized 16 HLPN properties in 11 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 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 16 to 13
RANDOM walk for 1012 steps (0 resets) in 59 ms. (16 steps per ms) remains 0/13 properties
[2024-05-30 11:07:17] [INFO ] Flatten gal took : 25 ms
[2024-05-30 11:07:18] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 11:07:18] [INFO ] Unfolded HLPN to a Petri net with 228 places and 450 transitions 1446 arcs in 53 ms.
[2024-05-30 11:07:18] [INFO ] Unfolded 14 HLPN properties in 2 ms.
[2024-05-30 11:07:18] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 11:07:18] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 11:07:18] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 11:07:18] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 11:07:18] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 11:07:18] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 11:07:18] [INFO ] Reduced 18 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 203 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 15 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2024-05-30 11:07:18] [INFO ] Computed 15 invariants in 35 ms
[2024-05-30 11:07:18] [INFO ] Implicit Places using invariants in 380 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 444 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/228 places, 354/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 482 ms. Remains : 227/228 places, 354/354 transitions.
Support contains 203 out of 227 places after structural reductions.
[2024-05-30 11:07:18] [INFO ] Flatten gal took : 68 ms
[2024-05-30 11:07:19] [INFO ] Flatten gal took : 77 ms
[2024-05-30 11:07:19] [INFO ] Input system was already deterministic with 354 transitions.
RANDOM walk for 1722 steps (0 resets) in 96 ms. (17 steps per ms) remains 0/14 properties
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(F(p0)))'
Support contains 30 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 32 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-30 11:07:19] [INFO ] Computed 14 invariants in 8 ms
[2024-05-30 11:07:20] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-30 11:07:20] [INFO ] Invariant cache hit.
[2024-05-30 11:07:20] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:07:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11168 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17585 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 29564ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 29602ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30115 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-00
Product exploration explored 100000 steps with 1405 reset in 501 ms.
Product exploration explored 100000 steps with 1475 reset in 452 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 372 steps (0 resets) in 9 ms. (37 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 108 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)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-30 11:07:51] [INFO ] Invariant cache hit.
[2024-05-30 11:07:51] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 finished in 32304 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((!p0 U (G(!p0)||p1))) U (G(X((!p0 U (p1||G(!p0)))))||(X((!p0 U (p1||G(!p0))))&&p2))))) U (G(X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0))))))))))||(G(!p2)&&X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0)))))))))))))'
Support contains 83 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 12 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-05-30 11:07:52] [INFO ] Invariant cache hit.
[2024-05-30 11:07:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 11:07:52] [INFO ] Invariant cache hit.
[2024-05-30 11:07:52] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:07:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10294 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17539 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 28228ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 28233ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28459 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
Product exploration explored 100000 steps with 1995 reset in 1270 ms.
Product exploration explored 100000 steps with 1983 reset in 1339 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 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))))]
Knowledge based reduction with 14 factoid took 397 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 77 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F p0), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))))]
Knowledge based reduction with 14 factoid took 671 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 83 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-30 11:08:24] [INFO ] Invariant cache hit.
[2024-05-30 11:08:25] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 11:08:25] [INFO ] Invariant cache hit.
[2024-05-30 11:08:25] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:08:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10751 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17465 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 28548ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 28554ms
Finished structural reductions in LTL mode , in 1 iterations and 28797 ms. Remains : 155/155 places, 282/282 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) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))))]
Knowledge based reduction with 14 factoid took 400 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 160 steps (0 resets) in 9 ms. (16 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p2)) (OR (NOT p2) p0)))), (F (NOT (OR p1 p0))), (F p0), (F p2), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 696 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1990 reset in 1789 ms.
Stack based approach found an accepted trace after 2630 steps with 47 reset with depth 100 and stack size 100 in 48 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 finished in 65120 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))'
Support contains 149 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 221 transition count 348
Applied a total of 12 rules in 37 ms. Remains 221 /227 variables (removed 6) and now considering 348/354 (removed 6) transitions.
// Phase 1: matrix 348 rows 221 cols
[2024-05-30 11:08:57] [INFO ] Computed 14 invariants in 3 ms
[2024-05-30 11:08:57] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-30 11:08:57] [INFO ] Invariant cache hit.
[2024-05-30 11:08:57] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2024-05-30 11:08:57] [INFO ] Redundant transitions in 24 ms returned []
Running 318 sub problems to find dead transitions.
[2024-05-30 11:08:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 15899 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 23730 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 39969ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 39974ms
Starting structural reductions in SI_LTL mode, iteration 1 : 221/227 places, 348/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40437 ms. Remains : 221/227 places, 348/354 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
Product exploration explored 100000 steps with 44628 reset in 1758 ms.
Product exploration explored 100000 steps with 44663 reset in 1762 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 (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 368 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
RANDOM walk for 39 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 3 factoid took 443 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p1)]
[2024-05-30 11:09:42] [INFO ] Invariant cache hit.
[2024-05-30 11:09:43] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-05-30 11:09:43] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-30 11:09:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 11:09:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-30 11:09:44] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-05-30 11:09:44] [INFO ] Computed and/alt/rep : 318/480/318 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-30 11:09:45] [INFO ] Added : 265 causal constraints over 54 iterations in 1624 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 149 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 348/348 transitions.
Applied a total of 0 rules in 17 ms. Remains 221 /221 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-05-30 11:09:46] [INFO ] Invariant cache hit.
[2024-05-30 11:09:46] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-30 11:09:46] [INFO ] Invariant cache hit.
[2024-05-30 11:09:46] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-30 11:09:46] [INFO ] Redundant transitions in 7 ms returned []
Running 318 sub problems to find dead transitions.
[2024-05-30 11:09:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 16118 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 24647 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 41147ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 41152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41571 ms. Remains : 221/221 places, 348/348 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 369 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p1)]
RANDOM walk for 52 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 3 factoid took 461 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p1)]
[2024-05-30 11:10:28] [INFO ] Invariant cache hit.
[2024-05-30 11:10:29] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-30 11:10:29] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-05-30 11:10:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 11:10:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-30 11:10:30] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2024-05-30 11:10:30] [INFO ] Computed and/alt/rep : 318/480/318 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-30 11:10:32] [INFO ] Added : 265 causal constraints over 54 iterations in 1569 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 44638 reset in 1754 ms.
Product exploration explored 100000 steps with 44697 reset in 1760 ms.
Support contains 149 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 348/348 transitions.
Applied a total of 0 rules in 9 ms. Remains 221 /221 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-05-30 11:10:36] [INFO ] Invariant cache hit.
[2024-05-30 11:10:36] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-30 11:10:36] [INFO ] Invariant cache hit.
[2024-05-30 11:10:36] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-30 11:10:36] [INFO ] Redundant transitions in 5 ms returned []
Running 318 sub problems to find dead transitions.
[2024-05-30 11:10:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 16444 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 24332 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 41114ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 41118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41487 ms. Remains : 221/221 places, 348/348 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 finished in 140383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Applied a total of 396 rules in 30 ms. Remains 50 /227 variables (removed 177) and now considering 48/354 (removed 306) transitions.
// Phase 1: matrix 48 rows 50 cols
[2024-05-30 11:11:17] [INFO ] Computed 14 invariants in 0 ms
[2024-05-30 11:11:17] [INFO ] Implicit Places using invariants in 84 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/227 places, 48/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 49/227 places, 48/354 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 774 steps with 0 reset with depth 775 and stack size 775 in 2 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 finished in 431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 421 place count 37 transition count 36
Applied a total of 421 rules in 21 ms. Remains 37 /227 variables (removed 190) and now considering 36/354 (removed 318) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-05-30 11:11:18] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 11:11:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 11:11:18] [INFO ] Invariant cache hit.
[2024-05-30 11:11:18] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-30 11:11:18] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 11:11:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 0 solved, 30 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 80 constraints, problems are : Problem set: 0 solved, 30 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 906ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 907ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/227 places, 36/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1035 ms. Remains : 37/227 places, 36/354 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 167 ms.
Stack based approach found an accepted trace after 375 steps with 0 reset with depth 376 and stack size 376 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 finished in 1372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 59 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Applied a total of 216 rules in 33 ms. Remains 131 /227 variables (removed 96) and now considering 234/354 (removed 120) transitions.
// Phase 1: matrix 234 rows 131 cols
[2024-05-30 11:11:19] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 11:11:19] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 11:11:19] [INFO ] Invariant cache hit.
[2024-05-30 11:11:19] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-30 11:11:19] [INFO ] Redundant transitions in 0 ms returned []
Running 228 sub problems to find dead transitions.
[2024-05-30 11:11:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 234/365 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 145 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7310 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 234/365 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 228/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 373 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12413 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 19937ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 19942ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/227 places, 234/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20189 ms. Remains : 131/227 places, 234/354 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 523 ms.
Stack based approach found an accepted trace after 13984 steps with 0 reset with depth 13985 and stack size 13985 in 81 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 finished in 20862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(!p0)))||F(p1))))'
Support contains 42 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 11 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-30 11:11:40] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 11:11:40] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-30 11:11:40] [INFO ] Invariant cache hit.
[2024-05-30 11:11:40] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:11:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10352 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 28741ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 28746ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29103 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 201 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 p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-06 finished in 29736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p1))))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 396 place count 50 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 408 place count 44 transition count 42
Applied a total of 408 rules in 14 ms. Remains 44 /227 variables (removed 183) and now considering 42/354 (removed 312) transitions.
// Phase 1: matrix 42 rows 44 cols
[2024-05-30 11:12:10] [INFO ] Computed 14 invariants in 0 ms
[2024-05-30 11:12:10] [INFO ] Implicit Places using invariants in 49 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/227 places, 42/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 43/227 places, 42/354 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
Product exploration explored 100000 steps with 6775 reset in 146 ms.
Product exploration explored 100000 steps with 6753 reset in 166 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 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 74 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) p1), (NOT p0), p1]
// Phase 1: matrix 42 rows 43 cols
[2024-05-30 11:12:11] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 11:12:11] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-30 11:12:11] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-30 11:12:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 11:12:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-30 11:12:11] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-30 11:12:11] [INFO ] Computed and/alt/rep : 36/54/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 11:12:11] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG p1
Support contains 12 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-30 11:12:11] [INFO ] Invariant cache hit.
[2024-05-30 11:12:11] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 11:12:11] [INFO ] Invariant cache hit.
[2024-05-30 11:12:11] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-30 11:12:11] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 11:12:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 56 constraints, problems are : Problem set: 0 solved, 36 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 92 constraints, problems are : Problem set: 0 solved, 36 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1192ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1192ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1299 ms. Remains : 43/43 places, 42/42 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 130 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p1), (NOT p0), p1]
[2024-05-30 11:12:13] [INFO ] Invariant cache hit.
[2024-05-30 11:12:13] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-30 11:12:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-30 11:12:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 11:12:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-30 11:12:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-30 11:12:13] [INFO ] Computed and/alt/rep : 36/54/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-30 11:12:13] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Product exploration explored 100000 steps with 6777 reset in 149 ms.
Product exploration explored 100000 steps with 6733 reset in 161 ms.
Support contains 12 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-30 11:12:14] [INFO ] Invariant cache hit.
[2024-05-30 11:12:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 11:12:14] [INFO ] Invariant cache hit.
[2024-05-30 11:12:14] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-30 11:12:14] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 11:12:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 56 constraints, problems are : Problem set: 0 solved, 36 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 92 constraints, problems are : Problem set: 0 solved, 36 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1128ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1129ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1243 ms. Remains : 43/43 places, 42/42 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 finished in 5255 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(F((!p1 U (G(!p1)||(!p1&&F(p2)))))))))'
Support contains 42 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 11 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-30 11:12:15] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 11:12:15] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-30 11:12:15] [INFO ] Invariant cache hit.
[2024-05-30 11:12:15] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:12:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10326 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17913 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 28565ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 28571ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28906 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
Product exploration explored 100000 steps with 1494 reset in 506 ms.
Product exploration explored 100000 steps with 1304 reset in 518 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) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 316 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p1, (AND p1 (NOT p2))]
RANDOM walk for 608 steps (0 resets) in 8 ms. (67 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 427 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Support contains 36 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-30 11:12:46] [INFO ] Invariant cache hit.
[2024-05-30 11:12:46] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-30 11:12:46] [INFO ] Invariant cache hit.
[2024-05-30 11:12:47] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:12:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10295 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17531 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 28139ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 28144ms
Finished structural reductions in LTL mode , in 1 iterations and 28473 ms. Remains : 155/155 places, 282/282 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 p1) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p1, p1, p1, (AND p1 (NOT p2))]
RANDOM walk for 135 steps (0 resets) in 6 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1490 reset in 367 ms.
Product exploration explored 100000 steps with 1476 reset in 386 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 151 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 0 with 54 rules applied. Total rules applied 54 place count 155 transition count 282
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 78 place count 155 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 152 transition count 186
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 152 transition count 186
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 102 place count 134 transition count 168
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 120 place count 134 transition count 168
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 120 rules in 23 ms. Remains 134 /155 variables (removed 21) and now considering 168/282 (removed 114) transitions.
[2024-05-30 11:13:17] [INFO ] Redundant transitions in 0 ms returned []
Running 162 sub problems to find dead transitions.
// Phase 1: matrix 168 rows 134 cols
[2024-05-30 11:13:17] [INFO ] Computed 14 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 11:13:18] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 16 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 6/134 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 11:13:20] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2024-05-30 11:13:20] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:13:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-30 11:13:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-30 11:13:20] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-30 11:13:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 11:13:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
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 TDEAD20 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 TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 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
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 7/22 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 168/302 variables, 134/156 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/156 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/156 constraints. Problems are: Problem set: 36 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 156 constraints, problems are : Problem set: 36 solved, 126 unsolved in 5557 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 36 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 42/134 variables, 14/15 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 7/22 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 168/302 variables, 134/156 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 126/282 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/282 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/282 constraints. Problems are: Problem set: 36 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 282 constraints, problems are : Problem set: 36 solved, 126 unsolved in 4264 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 126/162 constraints, Known Traps: 8/8 constraints]
After SMT, in 9879ms problems are : Problem set: 36 solved, 126 unsolved
Search for dead transitions found 36 dead transitions in 9884ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 134/155 places, 132/282 transitions.
Graph (complete) has 246 edges and 134 vertex of which 98 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 8 ms. Remains 97 /134 variables (removed 37) and now considering 132/132 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/155 places, 132/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9924 ms. Remains : 97/155 places, 132/282 transitions.
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-30 11:13:27] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 11:13:27] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-30 11:13:27] [INFO ] Invariant cache hit.
[2024-05-30 11:13:27] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:13:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10129 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17380 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 27832ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 27836ms
Finished structural reductions in LTL mode , in 1 iterations and 28234 ms. Remains : 155/155 places, 282/282 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 finished in 100415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&X(p2)))))'
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-05-30 11:13:55] [INFO ] Invariant cache hit.
[2024-05-30 11:13:55] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-30 11:13:55] [INFO ] Invariant cache hit.
[2024-05-30 11:13:56] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:13:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10217 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17451 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 27983ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 27987ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28341 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
Product exploration explored 100000 steps with 8182 reset in 423 ms.
Product exploration explored 100000 steps with 8173 reset in 440 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) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 24 factoid took 424 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 345 steps (0 resets) in 7 ms. (43 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 24 factoid took 767 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-30 11:14:26] [INFO ] Invariant cache hit.
[2024-05-30 11:14:26] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-30 11:14:26] [INFO ] Invariant cache hit.
[2024-05-30 11:14:27] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:14:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10199 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17709 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 28228ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 28232ms
Finished structural reductions in LTL mode , in 1 iterations and 28590 ms. Remains : 155/155 places, 282/282 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 p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 24 factoid took 347 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 190 steps (0 resets) in 12 ms. (14 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 24 factoid took 851 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8190 reset in 417 ms.
Product exploration explored 100000 steps with 8090 reset in 435 ms.
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-30 11:14:58] [INFO ] Invariant cache hit.
[2024-05-30 11:14:58] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-30 11:14:58] [INFO ] Invariant cache hit.
[2024-05-30 11:14:58] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:14:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10108 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17847 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 28279ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 28283ms
Finished structural reductions in LTL mode , in 1 iterations and 28639 ms. Remains : 155/155 places, 282/282 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 finished in 91182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||G(p1))))'
Support contains 54 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 216 place count 119 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 240 place count 119 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 243 place count 116 transition count 150
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 115 transition count 150
Applied a total of 247 rules in 23 ms. Remains 115 /227 variables (removed 112) and now considering 150/354 (removed 204) transitions.
// Phase 1: matrix 150 rows 115 cols
[2024-05-30 11:15:26] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 11:15:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 11:15:27] [INFO ] Invariant cache hit.
[2024-05-30 11:15:27] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-30 11:15:27] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-30 11:15:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 6/115 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 150/265 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 128 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3415 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 6/115 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 150/265 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 254 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3761 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 7224ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 7226ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/227 places, 150/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7438 ms. Remains : 115/227 places, 150/354 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-13
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 finished in 7638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 24 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 216 place count 119 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 240 place count 119 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 243 place count 116 transition count 150
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 115 transition count 150
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 265 place count 97 transition count 114
Iterating global reduction 0 with 18 rules applied. Total rules applied 283 place count 97 transition count 114
Applied a total of 283 rules in 24 ms. Remains 97 /227 variables (removed 130) and now considering 114/354 (removed 240) transitions.
// Phase 1: matrix 114 rows 97 cols
[2024-05-30 11:15:34] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 11:15:34] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 11:15:34] [INFO ] Invariant cache hit.
[2024-05-30 11:15:34] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-30 11:15:34] [INFO ] Redundant transitions in 0 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-30 11:15:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 6/97 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 114/211 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 110 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2087 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 6/97 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 114/211 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/200 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 200 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 4481ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 4482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/227 places, 114/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4695 ms. Remains : 97/227 places, 114/354 transitions.
Stuttering acceptance computed with spot in 89 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-14
Product exploration explored 100000 steps with 3567 reset in 285 ms.
Stack based approach found an accepted trace after 119 steps with 2 reset with depth 28 and stack size 28 in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 finished in 5086 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(F(p1))))))'
Support contains 59 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-30 11:15:39] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 11:15:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 11:15:39] [INFO ] Invariant cache hit.
[2024-05-30 11:15:39] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 11:15:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10306 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16318 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 26934ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 26939ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27202 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 640 ms.
Product exploration explored 100000 steps with 33333 reset in 655 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 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 finished in 28655 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F((!p1 U (G(!p1)||(!p1&&F(p2)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&X(p2)))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 204 place count 125 transition count 252
Applied a total of 204 rules in 15 ms. Remains 125 /227 variables (removed 102) and now considering 252/354 (removed 102) transitions.
// Phase 1: matrix 252 rows 125 cols
[2024-05-30 11:16:08] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 11:16:09] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-30 11:16:09] [INFO ] Invariant cache hit.
[2024-05-30 11:16:09] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-30 11:16:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 139 constraints, problems are : Problem set: 0 solved, 228 unsolved in 6981 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 228/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 367 constraints, problems are : Problem set: 0 solved, 228 unsolved in 11693 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 18976ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 18980ms
Starting structural reductions in LI_LTL mode, iteration 1 : 125/227 places, 252/354 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 19383 ms. Remains : 125/227 places, 252/354 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
Product exploration explored 100000 steps with 9810 reset in 464 ms.
Product exploration explored 100000 steps with 9755 reset in 484 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) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 21 factoid took 532 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 215 steps (0 resets) in 8 ms. (23 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 21 factoid took 961 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 36 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 252/252 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-30 11:16:31] [INFO ] Invariant cache hit.
[2024-05-30 11:16:31] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 11:16:31] [INFO ] Invariant cache hit.
[2024-05-30 11:16:31] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-30 11:16:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 139 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7066 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 228/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 367 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12755 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 20295ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 20300ms
Finished structural reductions in LTL mode , in 1 iterations and 20688 ms. Remains : 125/125 places, 252/252 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 p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 21 factoid took 660 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 248 steps (0 resets) in 11 ms. (20 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 21 factoid took 1115 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 9796 reset in 491 ms.
Product exploration explored 100000 steps with 9818 reset in 520 ms.
Support contains 36 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 252/252 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-30 11:16:55] [INFO ] Invariant cache hit.
[2024-05-30 11:16:55] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-30 11:16:55] [INFO ] Invariant cache hit.
[2024-05-30 11:16:56] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-30 11:16:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 139 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7254 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 228/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 367 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12659 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 20238ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 20241ms
Finished structural reductions in LTL mode , in 1 iterations and 20780 ms. Remains : 125/125 places, 252/252 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 finished in 67706 ms.
[2024-05-30 11:17:16] [INFO ] Flatten gal took : 35 ms
[2024-05-30 11:17:16] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2024-05-30 11:17:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 227 places, 354 transitions and 1032 arcs took 8 ms.
Total runtime 600350 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtilityControlRoom-COL-Z4T4N06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 227
TRANSITIONS: 354
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2499
MODEL NAME: /home/mcc/execution/412/model
227 places, 354 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717067852958

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z4T4N06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is UtilityControlRoom-COL-Z4T4N06, 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 r443-smll-171701109800124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N06.tgz
mv UtilityControlRoom-COL-Z4T4N06 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 ;