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.r373-tall-171683789800653.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 gold2023
Input is ShieldRVt-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789800653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 11:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 11:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 08:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 273K 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 ShieldRVt-PT-100A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717016512603

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 21:01:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 21:01:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:01:54] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-29 21:01:54] [INFO ] Transformed 803 places.
[2024-05-29 21:01:54] [INFO ] Transformed 803 transitions.
[2024-05-29 21:01:54] [INFO ] Found NUPN structural information;
[2024-05-29 21:01:54] [INFO ] Parsed PT model containing 803 places and 803 transitions and 3406 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-100A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 95 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:01:55] [INFO ] Computed 401 invariants in 30 ms
[2024-05-29 21:01:55] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-29 21:01:55] [INFO ] Invariant cache hit.
[2024-05-29 21:01:56] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1641 ms to find 0 implicit places.
[2024-05-29 21:01:56] [INFO ] Invariant cache hit.
[2024-05-29 21:01:57] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2286 ms. Remains : 803/803 places, 802/802 transitions.
Support contains 51 out of 803 places after structural reductions.
[2024-05-29 21:01:57] [INFO ] Flatten gal took : 150 ms
[2024-05-29 21:01:57] [INFO ] Flatten gal took : 72 ms
[2024-05-29 21:01:57] [INFO ] Input system was already deterministic with 802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-29 21:01:58] [INFO ] Invariant cache hit.
[2024-05-29 21:01:59] [INFO ] [Real]Absence check using 401 positive place invariants in 72 ms returned sat
[2024-05-29 21:01:59] [INFO ] After 717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-29 21:01:59] [INFO ] [Nat]Absence check using 401 positive place invariants in 58 ms returned sat
[2024-05-29 21:02:02] [INFO ] After 2679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-29 21:02:04] [INFO ] After 4134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 2582 ms.
[2024-05-29 21:02:06] [INFO ] After 7414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 1154 ms.
Support contains 41 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 0 with 90 rules applied. Total rules applied 92 place count 802 transition count 801
Drop transitions removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 0 with 90 rules applied. Total rules applied 182 place count 802 transition count 711
Applied a total of 182 rules in 241 ms. Remains 802 /803 variables (removed 1) and now considering 711/802 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 802/803 places, 711/802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 246714 steps, run timeout after 3003 ms. (steps per millisecond=82 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 14=1, 15=1, 16=1}
Probabilistic random walk after 246714 steps, saw 244828 distinct states, run finished after 3004 ms. (steps per millisecond=82 ) properties seen :16
Running SMT prover for 1 properties.
// Phase 1: matrix 711 rows 802 cols
[2024-05-29 21:02:11] [INFO ] Computed 401 invariants in 8 ms
[2024-05-29 21:02:11] [INFO ] [Real]Absence check using 401 positive place invariants in 74 ms returned sat
[2024-05-29 21:02:12] [INFO ] After 598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 21:02:12] [INFO ] [Nat]Absence check using 401 positive place invariants in 62 ms returned sat
[2024-05-29 21:02:12] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 21:02:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 21:02:12] [INFO ] After 54ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 21:02:13] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-29 21:02:13] [INFO ] After 818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 711/711 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 802 transition count 711
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 802 transition count 703
Applied a total of 16 rules in 125 ms. Remains 802 /802 variables (removed 0) and now considering 703/711 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 802/802 places, 703/711 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322174 steps, run timeout after 3002 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322174 steps, saw 319690 distinct states, run finished after 3005 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 703 rows 802 cols
[2024-05-29 21:02:16] [INFO ] Computed 401 invariants in 10 ms
[2024-05-29 21:02:16] [INFO ] [Real]Absence check using 401 positive place invariants in 67 ms returned sat
[2024-05-29 21:02:17] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 21:02:17] [INFO ] [Nat]Absence check using 401 positive place invariants in 62 ms returned sat
[2024-05-29 21:02:17] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 21:02:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 21:02:17] [INFO ] After 45ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 21:02:17] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-29 21:02:17] [INFO ] After 747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 703/703 transitions.
Applied a total of 0 rules in 30 ms. Remains 802 /802 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 802/802 places, 703/703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 703/703 transitions.
Applied a total of 0 rules in 24 ms. Remains 802 /802 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2024-05-29 21:02:17] [INFO ] Invariant cache hit.
[2024-05-29 21:02:18] [INFO ] Implicit Places using invariants in 481 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 484 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 801/802 places, 703/703 transitions.
Applied a total of 0 rules in 22 ms. Remains 801 /801 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 532 ms. Remains : 801/802 places, 703/703 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 314418 steps, run timeout after 3002 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314418 steps, saw 312007 distinct states, run finished after 3004 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 703 rows 801 cols
[2024-05-29 21:02:21] [INFO ] Computed 400 invariants in 16 ms
[2024-05-29 21:02:21] [INFO ] [Real]Absence check using 400 positive place invariants in 66 ms returned sat
[2024-05-29 21:02:22] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 21:02:22] [INFO ] [Nat]Absence check using 400 positive place invariants in 64 ms returned sat
[2024-05-29 21:02:22] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 21:02:23] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-29 21:02:23] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 703/703 transitions.
Applied a total of 0 rules in 21 ms. Remains 801 /801 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 801/801 places, 703/703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 703/703 transitions.
Applied a total of 0 rules in 24 ms. Remains 801 /801 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2024-05-29 21:02:23] [INFO ] Invariant cache hit.
[2024-05-29 21:02:23] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-29 21:02:23] [INFO ] Invariant cache hit.
[2024-05-29 21:02:24] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2024-05-29 21:02:24] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-29 21:02:24] [INFO ] Invariant cache hit.
[2024-05-29 21:02:25] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2038 ms. Remains : 801/801 places, 703/703 transitions.
Applied a total of 0 rules in 51 ms. Remains 801 /801 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 21:02:25] [INFO ] Invariant cache hit.
[2024-05-29 21:02:25] [INFO ] [Real]Absence check using 400 positive place invariants in 63 ms returned sat
[2024-05-29 21:02:25] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 21:02:26] [INFO ] [Nat]Absence check using 400 positive place invariants in 65 ms returned sat
[2024-05-29 21:02:27] [INFO ] After 920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 21:02:27] [INFO ] After 997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-29 21:02:27] [INFO ] After 1271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 13 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:02:27] [INFO ] Computed 401 invariants in 5 ms
[2024-05-29 21:02:27] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-29 21:02:27] [INFO ] Invariant cache hit.
[2024-05-29 21:02:28] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2024-05-29 21:02:28] [INFO ] Invariant cache hit.
[2024-05-29 21:02:29] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1815 ms. Remains : 803/803 places, 802/802 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (NEQ s216 1) (NEQ s218 1) (NEQ s223 1)) (OR (NEQ s620 1) (NEQ s621 1) (NEQ s624 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 944 ms.
Product exploration explored 100000 steps with 0 reset in 1053 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1806 steps, run visited all 1 properties in 23 ms. (steps per millisecond=78 )
Probabilistic random walk after 1806 steps, saw 1718 distinct states, run finished after 24 ms. (steps per millisecond=75 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-100A-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-100A-LTLFireability-01 finished in 4523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 19 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:02:31] [INFO ] Invariant cache hit.
[2024-05-29 21:02:32] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-29 21:02:32] [INFO ] Invariant cache hit.
[2024-05-29 21:02:33] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2024-05-29 21:02:33] [INFO ] Invariant cache hit.
[2024-05-29 21:02:33] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1798 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s45 0) (EQ s13 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3682 ms.
Product exploration explored 100000 steps with 50000 reset in 3815 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-100A-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-100A-LTLFireability-02 finished in 9394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Applied a total of 2 rules in 42 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2024-05-29 21:02:41] [INFO ] Computed 401 invariants in 7 ms
[2024-05-29 21:02:41] [INFO ] Implicit Places using invariants in 454 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 464 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 24 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 530 ms. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s35 1), p1:(AND (EQ s308 1) (EQ s309 1) (EQ s312 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 864 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-05 finished in 1465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(G(p1))))))'
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 15 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:02:42] [INFO ] Computed 401 invariants in 4 ms
[2024-05-29 21:02:43] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-29 21:02:43] [INFO ] Invariant cache hit.
[2024-05-29 21:02:44] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2024-05-29 21:02:44] [INFO ] Invariant cache hit.
[2024-05-29 21:02:44] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1785 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s310 1) (EQ s313 1)), p1:(OR (EQ s20 0) (EQ s21 0) (EQ s24 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 843 ms.
Product exploration explored 100000 steps with 0 reset in 1028 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Finished probabilistic random walk after 40141 steps, run visited all 3 properties in 649 ms. (steps per millisecond=61 )
Probabilistic random walk after 40141 steps, saw 39519 distinct states, run finished after 651 ms. (steps per millisecond=61 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 17 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:02:48] [INFO ] Invariant cache hit.
[2024-05-29 21:02:49] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-29 21:02:49] [INFO ] Invariant cache hit.
[2024-05-29 21:02:50] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2024-05-29 21:02:50] [INFO ] Invariant cache hit.
[2024-05-29 21:02:50] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1791 ms. Remains : 803/803 places, 802/802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Finished probabilistic random walk after 40141 steps, run visited all 3 properties in 758 ms. (steps per millisecond=52 )
Probabilistic random walk after 40141 steps, saw 39519 distinct states, run finished after 760 ms. (steps per millisecond=52 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 759 ms.
Product exploration explored 100000 steps with 0 reset in 937 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 803 transition count 802
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 133 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:02:55] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:02:55] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 21:02:55] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/803 places, 802/802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 803/803 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin10994558398665234696
[2024-05-29 21:02:55] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10994558398665234696
Running compilation step : cd /tmp/ltsmin10994558398665234696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1492 ms.
Running link step : cd /tmp/ltsmin10994558398665234696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10994558398665234696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14250439849872880212.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 73 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:03:10] [INFO ] Computed 401 invariants in 5 ms
[2024-05-29 21:03:11] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-29 21:03:11] [INFO ] Invariant cache hit.
[2024-05-29 21:03:12] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2024-05-29 21:03:12] [INFO ] Invariant cache hit.
[2024-05-29 21:03:12] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1813 ms. Remains : 803/803 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin7651004101145042517
[2024-05-29 21:03:12] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7651004101145042517
Running compilation step : cd /tmp/ltsmin7651004101145042517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1372 ms.
Running link step : cd /tmp/ltsmin7651004101145042517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7651004101145042517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9195414386865632978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 21:03:27] [INFO ] Flatten gal took : 71 ms
[2024-05-29 21:03:27] [INFO ] Flatten gal took : 58 ms
[2024-05-29 21:03:27] [INFO ] Time to serialize gal into /tmp/LTL3134432070165894816.gal : 11 ms
[2024-05-29 21:03:27] [INFO ] Time to serialize properties into /tmp/LTL6039982099487075824.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3134432070165894816.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8624568814856859246.hoa' '-atoms' '/tmp/LTL6039982099487075824.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6039982099487075824.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8624568814856859246.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 21:03:43] [INFO ] Flatten gal took : 48 ms
[2024-05-29 21:03:43] [INFO ] Flatten gal took : 57 ms
[2024-05-29 21:03:43] [INFO ] Time to serialize gal into /tmp/LTL6733154334890253816.gal : 19 ms
[2024-05-29 21:03:43] [INFO ] Time to serialize properties into /tmp/LTL740674802685383646.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6733154334890253816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL740674802685383646.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((p310==1)&&(p313==1))"))||(X(G("(((p20==0)||(p21==0))||(p24==0))")))))))
Formula 0 simplified : XX(G!"((p310==1)&&(p313==1))" & XF!"(((p20==0)||(p21==0))||(p24==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 21:03:58] [INFO ] Flatten gal took : 41 ms
[2024-05-29 21:03:58] [INFO ] Applying decomposition
[2024-05-29 21:03:58] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6836062510862902444.txt' '-o' '/tmp/graph6836062510862902444.bin' '-w' '/tmp/graph6836062510862902444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6836062510862902444.bin' '-l' '-1' '-v' '-w' '/tmp/graph6836062510862902444.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:03:58] [INFO ] Decomposing Gal with order
[2024-05-29 21:03:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:03:58] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 21:03:58] [INFO ] Flatten gal took : 131 ms
[2024-05-29 21:03:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 49 ms.
[2024-05-29 21:03:58] [INFO ] Time to serialize gal into /tmp/LTL10453671823091369685.gal : 17 ms
[2024-05-29 21:03:58] [INFO ] Time to serialize properties into /tmp/LTL7730254116628730881.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10453671823091369685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7730254116628730881.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((i11.u154.p310==1)&&(i11.u156.p313==1))"))||(X(G("(((i0.i1.i0.u9.p20==0)||(i0.i1.i0.u10.p21==0))||(i0.i1.i0.u11.p24==0))")...161
Formula 0 simplified : XX(G!"((i11.u154.p310==1)&&(i11.u156.p313==1))" & XF!"(((i0.i1.i0.u9.p20==0)||(i0.i1.i0.u10.p21==0))||(i0.i1.i0.u11.p24==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
18 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.310854,25832,1,0,6554,136,2114,9326,66,202,17175
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-100A-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-100A-LTLFireability-06 finished in 76406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 15 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:03:59] [INFO ] Invariant cache hit.
[2024-05-29 21:03:59] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-29 21:03:59] [INFO ] Invariant cache hit.
[2024-05-29 21:04:00] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2024-05-29 21:04:00] [INFO ] Invariant cache hit.
[2024-05-29 21:04:01] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1909 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s165 1) (AND (EQ s531 1) (EQ s540 1) (EQ s546 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 738 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-07 finished in 2779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 17 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:04:01] [INFO ] Invariant cache hit.
[2024-05-29 21:04:02] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-29 21:04:02] [INFO ] Invariant cache hit.
[2024-05-29 21:04:03] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
[2024-05-29 21:04:03] [INFO ] Invariant cache hit.
[2024-05-29 21:04:03] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1826 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s740 0) (EQ s741 0) (EQ s744 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1255 steps with 0 reset in 13 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-08 finished in 2016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 15 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:04:03] [INFO ] Invariant cache hit.
[2024-05-29 21:04:04] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-29 21:04:04] [INFO ] Invariant cache hit.
[2024-05-29 21:04:05] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2024-05-29 21:04:05] [INFO ] Invariant cache hit.
[2024-05-29 21:04:05] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1708 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s216 1) (EQ s218 1) (EQ s223 1)), p1:(OR (EQ s196 0) (EQ s197 0) (EQ s200 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 763 ms.
Product exploration explored 100000 steps with 0 reset in 902 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Finished probabilistic random walk after 28679 steps, run visited all 5 properties in 486 ms. (steps per millisecond=59 )
Probabilistic random walk after 28679 steps, saw 28142 distinct states, run finished after 489 ms. (steps per millisecond=58 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Applied a total of 2 rules in 42 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2024-05-29 21:04:09] [INFO ] Computed 401 invariants in 4 ms
[2024-05-29 21:04:09] [INFO ] Implicit Places using invariants in 468 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 472 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 28 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 542 ms. Remains : 801/803 places, 801/802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 130 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Finished probabilistic random walk after 28758 steps, run visited all 5 properties in 707 ms. (steps per millisecond=40 )
Probabilistic random walk after 28758 steps, saw 27885 distinct states, run finished after 709 ms. (steps per millisecond=40 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 430 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 774 ms.
Product exploration explored 100000 steps with 0 reset in 932 ms.
Built C files in :
/tmp/ltsmin14854169790056042088
[2024-05-29 21:04:14] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2024-05-29 21:04:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:04:14] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2024-05-29 21:04:14] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:04:14] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2024-05-29 21:04:14] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:04:14] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14854169790056042088
Running compilation step : cd /tmp/ltsmin14854169790056042088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2152 ms.
Running link step : cd /tmp/ltsmin14854169790056042088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14854169790056042088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7712273264395787750.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 801/801 transitions.
Applied a total of 0 rules in 19 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 801 cols
[2024-05-29 21:04:29] [INFO ] Computed 400 invariants in 4 ms
[2024-05-29 21:04:29] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-29 21:04:29] [INFO ] Invariant cache hit.
[2024-05-29 21:04:30] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
[2024-05-29 21:04:30] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 21:04:30] [INFO ] Invariant cache hit.
[2024-05-29 21:04:31] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1775 ms. Remains : 801/801 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin8582719132914718177
[2024-05-29 21:04:31] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2024-05-29 21:04:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:04:31] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2024-05-29 21:04:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:04:31] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2024-05-29 21:04:31] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:04:31] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8582719132914718177
Running compilation step : cd /tmp/ltsmin8582719132914718177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2127 ms.
Running link step : cd /tmp/ltsmin8582719132914718177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin8582719132914718177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13700894646949638820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 21:04:46] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:04:46] [INFO ] Flatten gal took : 34 ms
[2024-05-29 21:04:46] [INFO ] Time to serialize gal into /tmp/LTL16296280868729749925.gal : 7 ms
[2024-05-29 21:04:46] [INFO ] Time to serialize properties into /tmp/LTL17737049930002557706.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16296280868729749925.gal' '-t' 'CGAL' '-hoa' '/tmp/aut300864843172294391.hoa' '-atoms' '/tmp/LTL17737049930002557706.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17737049930002557706.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut300864843172294391.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 21:05:01] [INFO ] Flatten gal took : 39 ms
[2024-05-29 21:05:01] [INFO ] Flatten gal took : 36 ms
[2024-05-29 21:05:01] [INFO ] Time to serialize gal into /tmp/LTL9045199038441571491.gal : 5 ms
[2024-05-29 21:05:01] [INFO ] Time to serialize properties into /tmp/LTL12965486177720020477.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9045199038441571491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12965486177720020477.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((p216==1)&&(p218==1))&&(p223==1))")))||(G("(((p196==0)||(p197==0))||(p200==0))"))))
Formula 0 simplified : XG!"(((p216==1)&&(p218==1))&&(p223==1))" & F!"(((p196==0)||(p197==0))||(p200==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 21:05:16] [INFO ] Flatten gal took : 34 ms
[2024-05-29 21:05:16] [INFO ] Applying decomposition
[2024-05-29 21:05:16] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph328028409687324786.txt' '-o' '/tmp/graph328028409687324786.bin' '-w' '/tmp/graph328028409687324786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph328028409687324786.bin' '-l' '-1' '-v' '-w' '/tmp/graph328028409687324786.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:05:16] [INFO ] Decomposing Gal with order
[2024-05-29 21:05:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:05:16] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 21:05:16] [INFO ] Flatten gal took : 46 ms
[2024-05-29 21:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2024-05-29 21:05:16] [INFO ] Time to serialize gal into /tmp/LTL2697345297011213509.gal : 12 ms
[2024-05-29 21:05:16] [INFO ] Time to serialize properties into /tmp/LTL3296940984363168428.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2697345297011213509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3296940984363168428.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((i8.u107.p216==1)&&(i8.u108.p218==1))&&(i9.u111.p223==1))")))||(G("(((i7.u97.p196==0)||(i7.u98.p197==0))||(i7.u99.p200==0))...160
Formula 0 simplified : XG!"(((i8.u107.p216==1)&&(i8.u108.p218==1))&&(i9.u111.p223==1))" & F!"(((i7.u97.p196==0)||(i7.u98.p197==0))||(i7.u99.p200==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
22 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.346129,25792,1,0,10524,145,2269,13225,66,220,22118
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-100A-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-100A-LTLFireability-09 finished in 73211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Applied a total of 2 rules in 40 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2024-05-29 21:05:17] [INFO ] Computed 401 invariants in 5 ms
[2024-05-29 21:05:17] [INFO ] Implicit Places using invariants in 456 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 458 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 21 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 520 ms. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s768 1) (EQ s770 1) (EQ s775 1)), p1:(NEQ s667 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 813 ms.
Product exploration explored 100000 steps with 2 reset in 999 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 96 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1115 steps, run visited all 1 properties in 15 ms. (steps per millisecond=74 )
Probabilistic random walk after 1115 steps, saw 1043 distinct states, run finished after 16 ms. (steps per millisecond=69 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 124 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 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 801 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 801/801 transitions.
Applied a total of 0 rules in 22 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 801 cols
[2024-05-29 21:05:20] [INFO ] Computed 400 invariants in 6 ms
[2024-05-29 21:05:20] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-29 21:05:20] [INFO ] Invariant cache hit.
[2024-05-29 21:05:21] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
[2024-05-29 21:05:21] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 21:05:21] [INFO ] Invariant cache hit.
[2024-05-29 21:05:22] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1920 ms. Remains : 801/801 places, 801/801 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1115 steps, run visited all 1 properties in 21 ms. (steps per millisecond=53 )
Probabilistic random walk after 1115 steps, saw 1043 distinct states, run finished after 22 ms. (steps per millisecond=50 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 713 ms.
Product exploration explored 100000 steps with 0 reset in 879 ms.
Built C files in :
/tmp/ltsmin15436403621322242646
[2024-05-29 21:05:24] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2024-05-29 21:05:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:05:24] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2024-05-29 21:05:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:05:24] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2024-05-29 21:05:24] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:05:24] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15436403621322242646
Running compilation step : cd /tmp/ltsmin15436403621322242646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2065 ms.
Running link step : cd /tmp/ltsmin15436403621322242646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15436403621322242646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2073945050146620922.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 801/801 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 26 ms. Remains 800 /801 variables (removed 1) and now considering 800/801 (removed 1) transitions.
// Phase 1: matrix 800 rows 800 cols
[2024-05-29 21:05:39] [INFO ] Computed 400 invariants in 3 ms
[2024-05-29 21:05:40] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-29 21:05:40] [INFO ] Invariant cache hit.
[2024-05-29 21:05:40] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
[2024-05-29 21:05:40] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 21:05:40] [INFO ] Invariant cache hit.
[2024-05-29 21:05:41] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1697 ms. Remains : 800/801 places, 800/801 transitions.
Built C files in :
/tmp/ltsmin12303330940135597696
[2024-05-29 21:05:41] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2024-05-29 21:05:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:05:41] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2024-05-29 21:05:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:05:41] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2024-05-29 21:05:41] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:05:41] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12303330940135597696
Running compilation step : cd /tmp/ltsmin12303330940135597696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2019 ms.
Running link step : cd /tmp/ltsmin12303330940135597696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12303330940135597696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4711574490267536004.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 21:05:56] [INFO ] Flatten gal took : 23 ms
[2024-05-29 21:05:56] [INFO ] Flatten gal took : 19 ms
[2024-05-29 21:05:56] [INFO ] Time to serialize gal into /tmp/LTL9613833604738048978.gal : 5 ms
[2024-05-29 21:05:56] [INFO ] Time to serialize properties into /tmp/LTL6755631702525985450.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9613833604738048978.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11329280385197043143.hoa' '-atoms' '/tmp/LTL6755631702525985450.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6755631702525985450.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11329280385197043143.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
263 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.72559,93432,1,0,6,531820,24,0,21380,70186,19
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-100A-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-100A-LTLFireability-10 finished in 42143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(!p1)))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 19 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:05:59] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 21:05:59] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-29 21:05:59] [INFO ] Invariant cache hit.
[2024-05-29 21:06:00] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2024-05-29 21:06:00] [INFO ] Invariant cache hit.
[2024-05-29 21:06:01] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1751 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 222 ms :[p1, p1, p1, p1, true, p1, p1]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s463 1), p1:(AND (EQ s11 1) (EQ s20 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25016 reset in 2095 ms.
Product exploration explored 100000 steps with 24962 reset in 2234 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[p1, p1, p1, p1, true, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Finished probabilistic random walk after 89692 steps, run visited all 4 properties in 1478 ms. (steps per millisecond=60 )
Probabilistic random walk after 89692 steps, saw 88772 distinct states, run finished after 1479 ms. (steps per millisecond=60 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[p1, p1, p1, p1, true, p1, p1]
Stuttering acceptance computed with spot in 237 ms :[p1, p1, p1, p1, true, p1, p1]
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 17 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:06:08] [INFO ] Invariant cache hit.
[2024-05-29 21:06:09] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-29 21:06:09] [INFO ] Invariant cache hit.
[2024-05-29 21:06:10] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
[2024-05-29 21:06:10] [INFO ] Invariant cache hit.
[2024-05-29 21:06:10] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1790 ms. Remains : 803/803 places, 802/802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[p1, p1, p1, p1, true, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Finished probabilistic random walk after 89692 steps, run visited all 4 properties in 1143 ms. (steps per millisecond=78 )
Probabilistic random walk after 89692 steps, saw 88772 distinct states, run finished after 1146 ms. (steps per millisecond=78 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[p1, p1, p1, p1, true, p1, p1]
Stuttering acceptance computed with spot in 215 ms :[p1, p1, p1, p1, true, p1, p1]
Stuttering acceptance computed with spot in 245 ms :[p1, p1, p1, p1, true, p1, p1]
Product exploration explored 100000 steps with 24991 reset in 2231 ms.
Product exploration explored 100000 steps with 24970 reset in 2312 ms.
Applying partial POR strategy [false, false, false, true, true, false, false]
Stuttering acceptance computed with spot in 203 ms :[p1, p1, p1, p1, true, p1, p1]
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 803 transition count 802
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 36 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:06:18] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:06:18] [INFO ] Computed 401 invariants in 5 ms
[2024-05-29 21:06:19] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/803 places, 802/802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 568 ms. Remains : 803/803 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin17234743120834095395
[2024-05-29 21:06:19] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17234743120834095395
Running compilation step : cd /tmp/ltsmin17234743120834095395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1353 ms.
Running link step : cd /tmp/ltsmin17234743120834095395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17234743120834095395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16568209196116606319.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 13 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:06:34] [INFO ] Computed 401 invariants in 5 ms
[2024-05-29 21:06:34] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-29 21:06:34] [INFO ] Invariant cache hit.
[2024-05-29 21:06:35] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2024-05-29 21:06:35] [INFO ] Invariant cache hit.
[2024-05-29 21:06:36] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1726 ms. Remains : 803/803 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin4468505229534549868
[2024-05-29 21:06:36] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4468505229534549868
Running compilation step : cd /tmp/ltsmin4468505229534549868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1296 ms.
Running link step : cd /tmp/ltsmin4468505229534549868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4468505229534549868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12670088579992255331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 21:06:51] [INFO ] Flatten gal took : 32 ms
[2024-05-29 21:06:51] [INFO ] Flatten gal took : 30 ms
[2024-05-29 21:06:51] [INFO ] Time to serialize gal into /tmp/LTL46998485114074856.gal : 6 ms
[2024-05-29 21:06:51] [INFO ] Time to serialize properties into /tmp/LTL15915227590685306564.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL46998485114074856.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9749216699379560203.hoa' '-atoms' '/tmp/LTL15915227590685306564.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL15915227590685306564.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9749216699379560203.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
693 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.01676,115436,1,0,13,559055,24,0,23461,97761,42
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-100A-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-100A-LTLFireability-11 finished in 59190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F((G(p1)&&X(p0))))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 17 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:06:58] [INFO ] Invariant cache hit.
[2024-05-29 21:06:58] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-29 21:06:58] [INFO ] Invariant cache hit.
[2024-05-29 21:06:59] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2024-05-29 21:06:59] [INFO ] Invariant cache hit.
[2024-05-29 21:07:00] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1744 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}, { cond=p1, acceptance={0} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s397 1), p1:(AND (EQ s347 1) (EQ s356 1) (EQ s362 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-12 finished in 2016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0)&&F(p1))||X(G(!p0))))'
Support contains 7 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 18 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:07:00] [INFO ] Invariant cache hit.
[2024-05-29 21:07:00] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-29 21:07:00] [INFO ] Invariant cache hit.
[2024-05-29 21:07:01] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
[2024-05-29 21:07:01] [INFO ] Invariant cache hit.
[2024-05-29 21:07:02] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1733 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 142 ms :[p0, p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s195 1), p0:(AND (OR (NOT (AND (EQ s732 1) (EQ s733 1) (EQ s736 1))) (AND (EQ s84 1) (EQ s85 1) (EQ s88 1))) (EQ s732 1) (EQ s733 1) (EQ s736 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3511 ms.
Product exploration explored 100000 steps with 50000 reset in 3624 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-100A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-100A-LTLFireability-13 finished in 9053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (G(p0)||(p0&&G(!p1)))))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 18 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:07:09] [INFO ] Invariant cache hit.
[2024-05-29 21:07:10] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-29 21:07:10] [INFO ] Invariant cache hit.
[2024-05-29 21:07:10] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
[2024-05-29 21:07:10] [INFO ] Invariant cache hit.
[2024-05-29 21:07:11] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1819 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (AND (NOT p0) p1), p1, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(NEQ s17 1), p1:(AND (EQ s696 1) (EQ s698 1) (EQ s703 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 887 ms.
Product exploration explored 100000 steps with 0 reset in 1036 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 21:07:14] [INFO ] Invariant cache hit.
[2024-05-29 21:07:14] [INFO ] [Real]Absence check using 401 positive place invariants in 64 ms returned sat
[2024-05-29 21:07:14] [INFO ] After 743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 21:07:15] [INFO ] [Nat]Absence check using 401 positive place invariants in 63 ms returned sat
[2024-05-29 21:07:16] [INFO ] After 1013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 21:07:16] [INFO ] After 1216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 485 ms.
[2024-05-29 21:07:16] [INFO ] After 1974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 132 ms.
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 102 place count 802 transition count 801
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 202 place count 802 transition count 701
Applied a total of 202 rules in 90 ms. Remains 802 /803 variables (removed 1) and now considering 701/802 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 802/803 places, 701/802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Finished probabilistic random walk after 39838 steps, run visited all 3 properties in 605 ms. (steps per millisecond=65 )
Probabilistic random walk after 39838 steps, saw 39188 distinct states, run finished after 608 ms. (steps per millisecond=65 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 18 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:07:18] [INFO ] Invariant cache hit.
[2024-05-29 21:07:19] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-29 21:07:19] [INFO ] Invariant cache hit.
[2024-05-29 21:07:20] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2024-05-29 21:07:20] [INFO ] Invariant cache hit.
[2024-05-29 21:07:20] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1797 ms. Remains : 803/803 places, 802/802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :3
Running SMT prover for 3 properties.
[2024-05-29 21:07:21] [INFO ] Invariant cache hit.
[2024-05-29 21:07:21] [INFO ] [Real]Absence check using 401 positive place invariants in 61 ms returned sat
[2024-05-29 21:07:22] [INFO ] After 716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 21:07:22] [INFO ] [Nat]Absence check using 401 positive place invariants in 66 ms returned sat
[2024-05-29 21:07:23] [INFO ] After 986ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 21:07:23] [INFO ] After 1176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 490 ms.
[2024-05-29 21:07:24] [INFO ] After 1937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 220 ms.
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 102 place count 802 transition count 801
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 202 place count 802 transition count 701
Applied a total of 202 rules in 65 ms. Remains 802 /803 variables (removed 1) and now considering 701/802 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 802/803 places, 701/802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Finished probabilistic random walk after 39838 steps, run visited all 3 properties in 589 ms. (steps per millisecond=67 )
Probabilistic random walk after 39838 steps, saw 39188 distinct states, run finished after 590 ms. (steps per millisecond=67 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 853 ms.
Product exploration explored 100000 steps with 0 reset in 1044 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 803 transition count 802
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 33 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-29 21:07:28] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:07:28] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 21:07:28] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/803 places, 802/802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 563 ms. Remains : 803/803 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin11381036328219370244
[2024-05-29 21:07:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11381036328219370244
Running compilation step : cd /tmp/ltsmin11381036328219370244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1390 ms.
Running link step : cd /tmp/ltsmin11381036328219370244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11381036328219370244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11884777570374351249.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 18 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2024-05-29 21:07:44] [INFO ] Computed 401 invariants in 2 ms
[2024-05-29 21:07:44] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-29 21:07:44] [INFO ] Invariant cache hit.
[2024-05-29 21:07:45] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2024-05-29 21:07:45] [INFO ] Invariant cache hit.
[2024-05-29 21:07:45] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1756 ms. Remains : 803/803 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin18388567151519518553
[2024-05-29 21:07:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18388567151519518553
Running compilation step : cd /tmp/ltsmin18388567151519518553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1322 ms.
Running link step : cd /tmp/ltsmin18388567151519518553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18388567151519518553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14799341858962962170.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 21:08:00] [INFO ] Flatten gal took : 32 ms
[2024-05-29 21:08:00] [INFO ] Flatten gal took : 31 ms
[2024-05-29 21:08:00] [INFO ] Time to serialize gal into /tmp/LTL3101806246387436647.gal : 5 ms
[2024-05-29 21:08:00] [INFO ] Time to serialize properties into /tmp/LTL2094994266259716642.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3101806246387436647.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1077999844006838491.hoa' '-atoms' '/tmp/LTL2094994266259716642.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2094994266259716642.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1077999844006838491.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 21:08:16] [INFO ] Flatten gal took : 38 ms
[2024-05-29 21:08:16] [INFO ] Flatten gal took : 31 ms
[2024-05-29 21:08:16] [INFO ] Time to serialize gal into /tmp/LTL17197493658818236477.gal : 7 ms
[2024-05-29 21:08:16] [INFO ] Time to serialize properties into /tmp/LTL11600848472841935071.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17197493658818236477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11600848472841935071.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p17==0)")U((G("(p17==0)"))||(("(p17==0)")&&(G(!("(((p696==1)&&(p698==1))&&(p703==1))")))))))))
Formula 0 simplified : XX(F"(((p696==1)&&(p698==1))&&(p703==1))" U !"(p17==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 21:08:31] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:08:31] [INFO ] Applying decomposition
[2024-05-29 21:08:31] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11774199018769621113.txt' '-o' '/tmp/graph11774199018769621113.bin' '-w' '/tmp/graph11774199018769621113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11774199018769621113.bin' '-l' '-1' '-v' '-w' '/tmp/graph11774199018769621113.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:08:31] [INFO ] Decomposing Gal with order
[2024-05-29 21:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:08:31] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 21:08:31] [INFO ] Flatten gal took : 44 ms
[2024-05-29 21:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-29 21:08:31] [INFO ] Time to serialize gal into /tmp/LTL15519309098040158978.gal : 14 ms
[2024-05-29 21:08:31] [INFO ] Time to serialize properties into /tmp/LTL17566139709830498930.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15519309098040158978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17566139709830498930.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i0.u8.p17==0)")U((G("(i0.u8.p17==0)"))||(("(i0.u8.p17==0)")&&(G(!("(((i28.i0.i1.u347.p696==1)&&(i28.i0.i1.u348.p698==1))&&(i...188
Formula 0 simplified : XX(F"(((i28.i0.i1.u347.p696==1)&&(i28.i0.i1.u348.p698==1))&&(i28.i1.i0.u351.p703==1))" U !"(i0.u8.p17==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
9 unique states visited
9 strongly connected components in search stack
10 transitions explored
9 items max in DFS search stack
125 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.37039,68468,1,0,80409,147,2370,349159,66,222,50164
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-100A-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-100A-LTLFireability-14 finished in 83452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&F(p0)))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Applied a total of 2 rules in 45 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2024-05-29 21:08:33] [INFO ] Computed 401 invariants in 2 ms
[2024-05-29 21:08:33] [INFO ] Implicit Places using invariants in 397 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 398 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 18 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 462 ms. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s0 1), p1:(EQ s279 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-15 finished in 589 ms.
All properties solved by simple procedures.
Total runtime 399070 ms.

BK_STOP 1717016914544

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-100A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ShieldRVt-PT-100A, 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 r373-tall-171683789800653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100A.tgz
mv ShieldRVt-PT-100A 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 ;