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.r109-tall-171624208500438.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 DES-PT-30a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716337184981

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=DES-PT-30a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 00:19:46] [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-22 00:19:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:19:46] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-22 00:19:46] [INFO ] Transformed 234 places.
[2024-05-22 00:19:46] [INFO ] Transformed 191 transitions.
[2024-05-22 00:19:46] [INFO ] Found NUPN structural information;
[2024-05-22 00:19:46] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 149 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 4 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 234 cols
[2024-05-22 00:19:47] [INFO ] Computed 59 invariants in 22 ms
[2024-05-22 00:19:47] [INFO ] Implicit Places using invariants in 291 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 316 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/234 places, 177/177 transitions.
Applied a total of 0 rules in 14 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 354 ms. Remains : 233/234 places, 177/177 transitions.
Support contains 53 out of 233 places after structural reductions.
[2024-05-22 00:19:47] [INFO ] Flatten gal took : 46 ms
[2024-05-22 00:19:47] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:19:47] [INFO ] Input system was already deterministic with 177 transitions.
Support contains 50 out of 233 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 33) seen :15
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 177 rows 233 cols
[2024-05-22 00:19:48] [INFO ] Computed 58 invariants in 11 ms
[2024-05-22 00:19:48] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2024-05-22 00:19:48] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-22 00:19:48] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-22 00:19:48] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2024-05-22 00:19:48] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 44 ms returned sat
[2024-05-22 00:19:54] [INFO ] After 5661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 4 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-22 00:19:58] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:19:58] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:19:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2024-05-22 00:19:58] [INFO ] After 9865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 3315 ms.
[2024-05-22 00:20:02] [INFO ] After 13641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 15 properties in 684 ms.
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 177/177 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 232 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 232 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 232 transition count 174
Applied a total of 9 rules in 36 ms. Remains 232 /233 variables (removed 1) and now considering 174/177 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 232/233 places, 174/177 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1218429 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :{}
Probabilistic random walk after 1218429 steps, saw 170666 distinct states, run finished after 3002 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 174 rows 232 cols
[2024-05-22 00:20:06] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 00:20:06] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-22 00:20:06] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:20:06] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:20:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:20:06] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 85 ms returned sat
[2024-05-22 00:20:06] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:20:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:20:06] [INFO ] After 67ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-22 00:20:06] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-22 00:20:06] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 155 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 16 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-22 00:20:06] [INFO ] Invariant cache hit.
[2024-05-22 00:20:06] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 00:20:06] [INFO ] Invariant cache hit.
[2024-05-22 00:20:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:20:07] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-22 00:20:07] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-22 00:20:07] [INFO ] Invariant cache hit.
[2024-05-22 00:20:07] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 539 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-22 00:20:07] [INFO ] Invariant cache hit.
[2024-05-22 00:20:07] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:20:07] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:20:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:07] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 52 ms returned sat
[2024-05-22 00:20:07] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:20:07] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-22 00:20:07] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA DES-PT-30a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 136 stabilizing places and 131 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' '!(!(!p0 U (X(p0)&&p1)))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 6 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:20:08] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 00:20:08] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 00:20:08] [INFO ] Invariant cache hit.
[2024-05-22 00:20:08] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-22 00:20:08] [INFO ] Invariant cache hit.
[2024-05-22 00:20:08] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 232/233 places, 176/177 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 195 ms :[(AND p0 p1), p0, true]
Running random walk in product with property : DES-PT-30a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s140 1) (EQ s145 1) (EQ s147 1)), p1:(AND (EQ s2 1) (EQ s151 1) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3036 reset in 409 ms.
Product exploration explored 100000 steps with 3033 reset in 254 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND p0 p1), p0, true]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:20:09] [INFO ] Invariant cache hit.
[2024-05-22 00:20:09] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:09] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-22 00:20:09] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:20:10] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:10] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 21 ms returned sat
[2024-05-22 00:20:10] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:20:10] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 00:20:10] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 231 transition count 173
Applied a total of 9 rules in 23 ms. Remains 231 /232 variables (removed 1) and now considering 173/176 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 231/232 places, 173/176 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1803911 steps, run timeout after 3001 ms. (steps per millisecond=601 ) properties seen :{}
Probabilistic random walk after 1803911 steps, saw 251776 distinct states, run finished after 3002 ms. (steps per millisecond=600 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2024-05-22 00:20:13] [INFO ] Computed 60 invariants in 13 ms
[2024-05-22 00:20:13] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:20:13] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:20:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 00:20:13] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:20:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:20:13] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:20:13] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:20:13] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-05-22 00:20:13] [INFO ] Invariant cache hit.
[2024-05-22 00:20:13] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-22 00:20:13] [INFO ] Invariant cache hit.
[2024-05-22 00:20:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:20:14] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-22 00:20:14] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-22 00:20:14] [INFO ] Invariant cache hit.
[2024-05-22 00:20:14] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 231/231 places, 173/173 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 173
Applied a total of 1 rules in 13 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2024-05-22 00:20:14] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:20:14] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:20:14] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 00:20:14] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:20:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 00:20:14] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:20:14] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-22 00:20:14] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 117 ms :[(AND p0 p1), p0, true]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:20:14] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 00:20:15] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 00:20:15] [INFO ] Invariant cache hit.
[2024-05-22 00:20:15] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-22 00:20:15] [INFO ] Invariant cache hit.
[2024-05-22 00:20:15] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND p0 p1), p0, true]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:20:15] [INFO ] Invariant cache hit.
[2024-05-22 00:20:15] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:15] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-22 00:20:15] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:20:15] [INFO ] [Nat]Absence check using 32 positive place invariants in 3 ms returned sat
[2024-05-22 00:20:15] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-22 00:20:15] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:20:15] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:20:15] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 231 transition count 173
Applied a total of 9 rules in 19 ms. Remains 231 /232 variables (removed 1) and now considering 173/176 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 231/232 places, 173/176 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1762396 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :{}
Probabilistic random walk after 1762396 steps, saw 246133 distinct states, run finished after 3001 ms. (steps per millisecond=587 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2024-05-22 00:20:19] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 00:20:19] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:20:19] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:20:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 00:20:19] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:20:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:20:19] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:20:19] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-22 00:20:19] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-05-22 00:20:19] [INFO ] Invariant cache hit.
[2024-05-22 00:20:19] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 00:20:19] [INFO ] Invariant cache hit.
[2024-05-22 00:20:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:20:19] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-22 00:20:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:20:19] [INFO ] Invariant cache hit.
[2024-05-22 00:20:19] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 231/231 places, 173/173 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 173
Applied a total of 1 rules in 11 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2024-05-22 00:20:19] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:20:20] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:20:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 00:20:20] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:20:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:20:20] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:20:20] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:20:20] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 95 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p1), p0, true]
Product exploration explored 100000 steps with 3031 reset in 206 ms.
Product exploration explored 100000 steps with 3002 reset in 346 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 92 ms :[(AND p0 p1), p0, true]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 27 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:20:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:20:21] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:20:21] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin17483341981045075110
[2024-05-22 00:20:21] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17483341981045075110
Running compilation step : cd /tmp/ltsmin17483341981045075110;'/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 413 ms.
Running link step : cd /tmp/ltsmin17483341981045075110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17483341981045075110;'/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/stateBased13419086469819370791.hoa' '--buchi-type=spotba'
LTSmin run took 1664 ms.
FORMULA DES-PT-30a-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30a-LTLFireability-00 finished in 15639 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 U p1))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 20 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 00:20:23] [INFO ] Invariant cache hit.
[2024-05-22 00:20:24] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 00:20:24] [INFO ] Invariant cache hit.
[2024-05-22 00:20:24] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-22 00:20:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:20:24] [INFO ] Invariant cache hit.
[2024-05-22 00:20:24] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 454 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s38 1) (EQ s227 1)), p0:(AND (EQ s128 1) (EQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-01 finished in 557 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((G(p0)||F(G(p1))))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 10 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 00:20:24] [INFO ] Invariant cache hit.
[2024-05-22 00:20:24] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 00:20:24] [INFO ] Invariant cache hit.
[2024-05-22 00:20:24] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-22 00:20:24] [INFO ] Invariant cache hit.
[2024-05-22 00:20:24] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s107 1) (EQ s124 1)), p1:(OR (EQ s134 0) (EQ s144 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2229 reset in 316 ms.
Product exploration explored 100000 steps with 2263 reset in 281 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 56 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Support contains 2 out of 232 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 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:20:26] [INFO ] Invariant cache hit.
[2024-05-22 00:20:26] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:20:26] [INFO ] Invariant cache hit.
[2024-05-22 00:20:26] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-22 00:20:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:20:26] [INFO ] Invariant cache hit.
[2024-05-22 00:20:26] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 478 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
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 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2217 reset in 205 ms.
Product exploration explored 100000 steps with 2232 reset in 226 ms.
Built C files in :
/tmp/ltsmin2230927852331361953
[2024-05-22 00:20:27] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-22 00:20:27] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:20:27] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-22 00:20:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:20:27] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-22 00:20:27] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:20:27] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2230927852331361953
Running compilation step : cd /tmp/ltsmin2230927852331361953;'/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 385 ms.
Running link step : cd /tmp/ltsmin2230927852331361953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2230927852331361953;'/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/stateBased3584788500445008772.hoa' '--buchi-type=spotba'
LTSmin run took 425 ms.
FORMULA DES-PT-30a-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30a-LTLFireability-02 finished in 3723 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 (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))||(G(p3)&&F(p4))))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 16 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 00:20:28] [INFO ] Invariant cache hit.
[2024-05-22 00:20:28] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-22 00:20:28] [INFO ] Invariant cache hit.
[2024-05-22 00:20:28] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-22 00:20:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:20:28] [INFO ] Invariant cache hit.
[2024-05-22 00:20:28] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 543 ms :[true, (OR (NOT p3) (NOT p4)), (OR (AND p0 p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p2) (NOT p4))), (AND (NOT p2) p1 p0 (NOT p3)), (NOT p3), (AND p0 (NOT p3)), (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p2) p1), p0, (OR (AND p0 (NOT p3)) (AND p0 (NOT p4))), (AND p0 (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p4), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p3 (NOT p4) (NOT p2) p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p3 p4 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p3 p4 (NOT p2) p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p3 p4 (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p4) (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 6}, { cond=(AND p3 p4 (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND p3 (NOT p4) (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 11}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p3 p0), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 0}, { cond=(AND p3 (NOT p4) (NOT p2) p1), acceptance={} source=6 dest: 1}, { cond=(AND p3 p4 (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p3 p4 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 0}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=p0, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p3) p0), acceptance={} source=9 dest: 0}, { cond=(AND p3 (NOT p4) p0), acceptance={} source=9 dest: 1}, { cond=(AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 2}, { cond=(AND p3 p4 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND p3 p4 p0), acceptance={} source=9 dest: 4}, { cond=(AND p3 p4 (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p3 (NOT p4) (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 11}]], initial=9, aps=[p3:(OR (EQ s35 0) (EQ s227 0)), p4:(OR (EQ s48 0) (EQ s227 0)), p2:(AND (EQ s35 1) (EQ s227 1) (NOT (AND (EQ s141 1) (EQ s143 1)))), p1:(AND (EQ s141 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2245 reset in 306 ms.
Product exploration explored 100000 steps with 2231 reset in 326 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/5 atomic propositions.
Knowledge obtained : [(AND p3 p4 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X p3), (X (AND p3 p4)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 p4 p0))), (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0))), (X (AND p3 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 p4 (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0)))), (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0)))), (X (X p3)), (X (X (AND p3 p4))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 p4 p0)))), (X (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0)))), (X (X (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p4 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p4 (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1))))), (X (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 p0)))), (X (X (AND p3 p4 (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 71 factoid took 5748 ms. Reduced automaton from 12 states, 60 edges and 5 AP (stutter insensitive) to 17 states, 118 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 752 ms :[true, (AND (NOT p3) p0 p1 (NOT p2)), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (NOT p3), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2)), p0, (AND p0 (NOT p3))]
Incomplete random walk after 10000 steps, including 217 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2024-05-22 00:20:36] [INFO ] Invariant cache hit.
[2024-05-22 00:20:36] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2024-05-22 00:20:36] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 36 ms returned sat
[2024-05-22 00:20:37] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:16
[2024-05-22 00:20:37] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2024-05-22 00:20:37] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 62 ms returned sat
[2024-05-22 00:20:37] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :10
[2024-05-22 00:20:37] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :10
Attempting to minimize the solution found.
Minimization took 262 ms.
[2024-05-22 00:20:38] [INFO ] After 1197ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :10
Fused 22 Parikh solutions to 10 different solutions.
Parikh walk visited 2 properties in 180 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 232 transition count 175
Applied a total of 7 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 232/232 places, 175/176 transitions.
Incomplete random walk after 10000 steps, including 172 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 793834 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :{}
Probabilistic random walk after 793834 steps, saw 107960 distinct states, run finished after 3002 ms. (steps per millisecond=264 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 00:20:41] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:20:42] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:20:42] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 22 ms returned sat
[2024-05-22 00:20:42] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 00:20:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:20:42] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 84 ms returned sat
[2024-05-22 00:20:42] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-22 00:20:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:20:42] [INFO ] After 222ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-22 00:20:42] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 191 ms.
[2024-05-22 00:20:43] [INFO ] After 1139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 290 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 00:20:43] [INFO ] Invariant cache hit.
[2024-05-22 00:20:43] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 00:20:43] [INFO ] Invariant cache hit.
[2024-05-22 00:20:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:20:43] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-22 00:20:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:20:43] [INFO ] Invariant cache hit.
[2024-05-22 00:20:43] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 232/232 places, 175/175 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
Applied a total of 1 rules in 29 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 00:20:43] [INFO ] Computed 59 invariants in 1 ms
[2024-05-22 00:20:44] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:20:44] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 22 ms returned sat
[2024-05-22 00:20:44] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 00:20:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:44] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 91 ms returned sat
[2024-05-22 00:20:44] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-22 00:20:44] [INFO ] After 636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 239 ms.
[2024-05-22 00:20:45] [INFO ] After 1071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p3 p4 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X p3), (X (AND p3 p4)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 p4 p0))), (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0))), (X (AND p3 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 p4 (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0)))), (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0)))), (X (X p3)), (X (X (AND p3 p4))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 p4 p0)))), (X (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0)))), (X (X (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p4 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p4 (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1))))), (X (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 p0)))), (X (X (AND p3 p4 (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (G (NOT (AND p0 (NOT p3)))), (G (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND p0 p1 p2 (NOT p3))), (F (AND p0 (NOT p1) p2 p3)), (F (AND p0 p1 p2 p3)), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F (AND (NOT p0) p1 (NOT p2) p3)), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (AND p1 (NOT p2) p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) p1 p2 p3)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2) p3))]
Property proved to be false thanks to negative knowledge :(F (AND p0 p1 p2 (NOT p3)))
Knowledge based reduction with 76 factoid took 6712 ms. Reduced automaton from 17 states, 118 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-03 finished in 23726 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((p0&&X((!p1 U (G(!p1)||(!p1&&(p2 U p3))))))))'
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 5 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:20:51] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:20:52] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:20:52] [INFO ] Invariant cache hit.
[2024-05-22 00:20:52] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-22 00:20:52] [INFO ] Invariant cache hit.
[2024-05-22 00:20:52] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : DES-PT-30a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s103 0) (EQ s124 0)), p1:(AND (EQ s14 1) (EQ s151 1) (EQ s153 1)), p3:(AND (EQ s22 1) (EQ s151 1) (EQ s153 1)), p2:(AND (EQ s135 1) (EQ s136 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2245 reset in 282 ms.
Product exploration explored 100000 steps with 2222 reset in 245 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 225 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 223 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-22 00:20:54] [INFO ] Invariant cache hit.
[2024-05-22 00:20:54] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 00:20:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-22 00:20:54] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 60 ms returned sat
[2024-05-22 00:20:54] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2024-05-22 00:20:55] [INFO ] After 910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 350 ms.
[2024-05-22 00:20:55] [INFO ] After 1468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 281 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 232 transition count 175
Applied a total of 6 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 175/176 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 856731 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 856731 steps, saw 114540 distinct states, run finished after 3002 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 00:20:59] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:20:59] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 00:20:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:20:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 84 ms returned sat
[2024-05-22 00:20:59] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 00:20:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:21:00] [INFO ] After 275ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2024-05-22 00:21:00] [INFO ] After 756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 255 ms.
[2024-05-22 00:21:00] [INFO ] After 1581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 233 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 00:21:01] [INFO ] Invariant cache hit.
[2024-05-22 00:21:01] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 00:21:01] [INFO ] Invariant cache hit.
[2024-05-22 00:21:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:21:01] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-22 00:21:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:21:01] [INFO ] Invariant cache hit.
[2024-05-22 00:21:01] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-22 00:21:01] [INFO ] Invariant cache hit.
[2024-05-22 00:21:01] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 00:21:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:21:01] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 67 ms returned sat
[2024-05-22 00:21:02] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 00:21:02] [INFO ] After 642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 242 ms.
[2024-05-22 00:21:02] [INFO ] After 1102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND p0 p2 (NOT p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 17 factoid took 588 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:21:03] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 00:21:04] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 00:21:04] [INFO ] Invariant cache hit.
[2024-05-22 00:21:04] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-22 00:21:04] [INFO ] Invariant cache hit.
[2024-05-22 00:21:04] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 222 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 223 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-22 00:21:05] [INFO ] Invariant cache hit.
[2024-05-22 00:21:05] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 00:21:05] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-22 00:21:05] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 61 ms returned sat
[2024-05-22 00:21:06] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-22 00:21:06] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:21:06] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:21:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2024-05-22 00:21:06] [INFO ] After 930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 355 ms.
[2024-05-22 00:21:07] [INFO ] After 1480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 256 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 232 transition count 175
Applied a total of 6 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 232/232 places, 175/176 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 869195 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 869195 steps, saw 116106 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 00:21:10] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:21:10] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 00:21:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:21:11] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 81 ms returned sat
[2024-05-22 00:21:11] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 00:21:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:21:11] [INFO ] After 267ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2024-05-22 00:21:12] [INFO ] After 748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 252 ms.
[2024-05-22 00:21:12] [INFO ] After 1547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 155 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 00:21:12] [INFO ] Invariant cache hit.
[2024-05-22 00:21:12] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 00:21:12] [INFO ] Invariant cache hit.
[2024-05-22 00:21:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:21:12] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-22 00:21:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:21:12] [INFO ] Invariant cache hit.
[2024-05-22 00:21:13] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-22 00:21:13] [INFO ] Invariant cache hit.
[2024-05-22 00:21:13] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 00:21:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:21:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 66 ms returned sat
[2024-05-22 00:21:13] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 00:21:13] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 229 ms.
[2024-05-22 00:21:14] [INFO ] After 1061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND p0 p2 (NOT p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 17 factoid took 560 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 2224 reset in 231 ms.
Product exploration explored 100000 steps with 2202 reset in 248 ms.
Built C files in :
/tmp/ltsmin7538809606821756048
[2024-05-22 00:21:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7538809606821756048
Running compilation step : cd /tmp/ltsmin7538809606821756048;'/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 312 ms.
Running link step : cd /tmp/ltsmin7538809606821756048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7538809606821756048;'/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/stateBased4686570847567974754.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:21:31] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 00:21:31] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 00:21:31] [INFO ] Invariant cache hit.
[2024-05-22 00:21:31] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-22 00:21:31] [INFO ] Invariant cache hit.
[2024-05-22 00:21:31] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin7245336657241038570
[2024-05-22 00:21:31] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7245336657241038570
Running compilation step : cd /tmp/ltsmin7245336657241038570;'/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 307 ms.
Running link step : cd /tmp/ltsmin7245336657241038570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7245336657241038570;'/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/stateBased13421217669832993745.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:21:46] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:21:46] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:21:46] [INFO ] Time to serialize gal into /tmp/LTL7567070664333627108.gal : 3 ms
[2024-05-22 00:21:46] [INFO ] Time to serialize properties into /tmp/LTL15612824585953504828.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/LTL7567070664333627108.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9956468286155672014.hoa' '-atoms' '/tmp/LTL15612824585953504828.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/LTL15612824585953504828.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9956468286155672014.hoa
Detected timeout of ITS tools.
[2024-05-22 00:22:01] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:22:01] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:22:01] [INFO ] Time to serialize gal into /tmp/LTL3534632312050283975.gal : 3 ms
[2024-05-22 00:22:01] [INFO ] Time to serialize properties into /tmp/LTL11659510891533376579.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/LTL3534632312050283975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11659510891533376579.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 : !((F((X((!("(((p14==1)&&(p152==1))&&(p154==1))"))U((G(!("(((p14==1)&&(p152==1))&&(p154==1))")))||((!("(((p14==1)&&(p152==1))&&(p154==1...264
Formula 0 simplified : G(!"((p103==0)||(p124==0))" | X((!"((p136==1)&&(p137==1))" R !"(((p22==1)&&(p152==1))&&(p154==1))") U "(((p14==1)&&(p152==1))&&(p154...163
Detected timeout of ITS tools.
[2024-05-22 00:22:16] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:22:16] [INFO ] Applying decomposition
[2024-05-22 00:22:16] [INFO ] Flatten gal took : 13 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/graph6848206140355398126.txt' '-o' '/tmp/graph6848206140355398126.bin' '-w' '/tmp/graph6848206140355398126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6848206140355398126.bin' '-l' '-1' '-v' '-w' '/tmp/graph6848206140355398126.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:22:17] [INFO ] Decomposing Gal with order
[2024-05-22 00:22:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:22:17] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 00:22:17] [INFO ] Flatten gal took : 63 ms
[2024-05-22 00:22:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 00:22:17] [INFO ] Time to serialize gal into /tmp/LTL4935683398363889866.gal : 4 ms
[2024-05-22 00:22:17] [INFO ] Time to serialize properties into /tmp/LTL1497823119253420821.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/LTL4935683398363889866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1497823119253420821.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 : !((F((X((!("(((u14.p14==1)&&(u14.p152==1))&&(u14.p154==1))"))U((G(!("(((u14.p14==1)&&(u14.p152==1))&&(u14.p154==1))")))||((!("(((u14.p...342
Formula 0 simplified : G(!"((i1.u2.p103==0)||(i1.u2.p124==0))" | X((!"((i0.i0.u6.p136==1)&&(i0.i1.u7.p137==1))" R !"(((u14.p22==1)&&(u14.p152==1))&&(u14.p1...217
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t170, u13.t129, u14.t11, u48.t5, u48.t40, i0.i0.u0.t10, i0.i0.u6.t175, i0.i1....629
Computing Next relation with stutter on 1.99965e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17601897943267155206
[2024-05-22 00:22:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17601897943267155206
Running compilation step : cd /tmp/ltsmin17601897943267155206;'/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 318 ms.
Running link step : cd /tmp/ltsmin17601897943267155206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17601897943267155206;'/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' '--ltl' '<>((X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&((LTLAPp1==true) U (LTLAPp2==true))))))&&(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30a-LTLFireability-06 finished in 115384 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))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 8 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 00:22:47] [INFO ] Invariant cache hit.
[2024-05-22 00:22:47] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 00:22:47] [INFO ] Invariant cache hit.
[2024-05-22 00:22:47] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-22 00:22:47] [INFO ] Invariant cache hit.
[2024-05-22 00:22:47] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s97 0) (EQ s124 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 50000 reset in 334 ms.
Product exploration explored 100000 steps with 50000 reset in 331 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-08 finished in 1298 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((F(G(!p0)) U p1)))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 10 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 00:22:48] [INFO ] Invariant cache hit.
[2024-05-22 00:22:48] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 00:22:48] [INFO ] Invariant cache hit.
[2024-05-22 00:22:48] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-22 00:22:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:22:48] [INFO ] Invariant cache hit.
[2024-05-22 00:22:49] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 465 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s210 1) (EQ s219 1) (EQ s125 1) (EQ s146 1)), p0:(AND (EQ s30 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2222 reset in 205 ms.
Product exploration explored 100000 steps with 2208 reset in 235 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), p0, (NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), p0, (NOT p1)]
[2024-05-22 00:22:50] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-09 finished in 2137 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&&X(X(F(p1)))))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 00:22:50] [INFO ] Invariant cache hit.
[2024-05-22 00:22:50] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 00:22:50] [INFO ] Invariant cache hit.
[2024-05-22 00:22:51] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-05-22 00:22:51] [INFO ] Invariant cache hit.
[2024-05-22 00:22:51] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(AND (EQ s6 1) (EQ s151 1) (EQ s153 1)), p0:(OR (EQ s137 0) (EQ s139 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-10 finished in 691 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((((!p1 U G(!p2))||X(p3))&&p0)))'
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Applied a total of 0 rules in 3 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 233 cols
[2024-05-22 00:22:51] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:22:51] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-22 00:22:51] [INFO ] Invariant cache hit.
[2024-05-22 00:22:52] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2024-05-22 00:22:52] [INFO ] Invariant cache hit.
[2024-05-22 00:22:52] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1321 ms. Remains : 233/233 places, 177/177 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), true, (NOT p3), (AND p2 (NOT p3)), (AND p2 (NOT p3)), p2, p2]
Running random walk in product with property : DES-PT-30a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 2}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s121 1) (EQ s133 1)), p2:(AND (EQ s98 1) (EQ s124 1)), p1:(AND (EQ s178 1) (EQ s194 1)), p3:(OR (AND (EQ s156 1) (EQ s225 1)) (AND (EQ s121 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, 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 DES-PT-30a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-11 finished in 1626 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(p0)&&X(G((p1&&X((p1 U (!p2||G(p1)))))))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 6 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:22:53] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:22:53] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:22:53] [INFO ] Invariant cache hit.
[2024-05-22 00:22:53] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-22 00:22:53] [INFO ] Invariant cache hit.
[2024-05-22 00:22:53] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s70 0) (EQ s148 0)), p1:(OR (NEQ s11 1) (NEQ s151 1) (NEQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2203 reset in 229 ms.
Product exploration explored 100000 steps with 2187 reset in 247 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 333 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 216 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1599120 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :{}
Probabilistic random walk after 1599120 steps, saw 221156 distinct states, run finished after 3001 ms. (steps per millisecond=532 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:22:57] [INFO ] Invariant cache hit.
[2024-05-22 00:22:57] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-22 00:22:57] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-22 00:22:57] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:22:57] [INFO ] [Nat]Absence check using 32 positive place invariants in 3 ms returned sat
[2024-05-22 00:22:57] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 35 ms returned sat
[2024-05-22 00:22:57] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:22:57] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:22:57] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 231 transition count 173
Applied a total of 9 rules in 24 ms. Remains 231 /232 variables (removed 1) and now considering 173/176 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 231/232 places, 173/176 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1744482 steps, run timeout after 3001 ms. (steps per millisecond=581 ) properties seen :{}
Probabilistic random walk after 1744482 steps, saw 243587 distinct states, run finished after 3001 ms. (steps per millisecond=581 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2024-05-22 00:23:00] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 00:23:01] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 00:23:01] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:23:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 69 ms returned sat
[2024-05-22 00:23:01] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:23:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:23:01] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:23:01] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-22 00:23:01] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1172 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=234 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 10 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-12 finished in 8503 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(F(p0))&&F(p1))) U (p2 U p3)))'
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 15 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:23:01] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:23:01] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 00:23:01] [INFO ] Invariant cache hit.
[2024-05-22 00:23:01] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-22 00:23:01] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:23:01] [INFO ] Invariant cache hit.
[2024-05-22 00:23:02] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p3), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DES-PT-30a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s128 1) (EQ s212 1)), p2:(AND (EQ s50 1) (EQ s227 1)), p0:(OR (AND (EQ s86 1) (EQ s148 1)) (AND (EQ s50 1) (EQ s227 1))), p1:(AND (EQ s130 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 40 steps with 1 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-14 finished in 807 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((p0&&X((!p1 U (G(!p1)||(!p1&&(p2 U p3))))))))'
Found a Shortening insensitive property : DES-PT-30a-LTLFireability-06
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 00:23:02] [INFO ] Invariant cache hit.
[2024-05-22 00:23:02] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 00:23:02] [INFO ] Invariant cache hit.
[2024-05-22 00:23:02] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-22 00:23:02] [INFO ] Invariant cache hit.
[2024-05-22 00:23:03] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 444 ms. Remains : 232/233 places, 176/177 transitions.
Running random walk in product with property : DES-PT-30a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s103 0) (EQ s124 0)), p1:(AND (EQ s14 1) (EQ s151 1) (EQ s153 1)), p3:(AND (EQ s22 1) (EQ s151 1) (EQ s153 1)), p2:(AND (EQ s135 1) (EQ s136 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2245 reset in 220 ms.
Product exploration explored 100000 steps with 2218 reset in 267 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 228 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-22 00:23:04] [INFO ] Invariant cache hit.
[2024-05-22 00:23:04] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 00:23:04] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:04] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 62 ms returned sat
[2024-05-22 00:23:05] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2024-05-22 00:23:05] [INFO ] After 894ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 359 ms.
[2024-05-22 00:23:05] [INFO ] After 1456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 312 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 232 transition count 175
Applied a total of 6 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 175/176 transitions.
Incomplete random walk after 10000 steps, including 228 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 840740 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 840740 steps, saw 112396 distinct states, run finished after 3005 ms. (steps per millisecond=279 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 00:23:09] [INFO ] Computed 59 invariants in 1 ms
[2024-05-22 00:23:09] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 00:23:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 80 ms returned sat
[2024-05-22 00:23:10] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 00:23:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:23:10] [INFO ] After 275ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-05-22 00:23:11] [INFO ] After 735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 238 ms.
[2024-05-22 00:23:11] [INFO ] After 1520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 168 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 00:23:11] [INFO ] Invariant cache hit.
[2024-05-22 00:23:11] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 00:23:11] [INFO ] Invariant cache hit.
[2024-05-22 00:23:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:23:11] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-22 00:23:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:23:11] [INFO ] Invariant cache hit.
[2024-05-22 00:23:11] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-22 00:23:11] [INFO ] Invariant cache hit.
[2024-05-22 00:23:12] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 00:23:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:12] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 65 ms returned sat
[2024-05-22 00:23:12] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 00:23:12] [INFO ] After 650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 251 ms.
[2024-05-22 00:23:13] [INFO ] After 1114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND p0 p2 (NOT p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 17 factoid took 540 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:23:14] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:23:14] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 00:23:14] [INFO ] Invariant cache hit.
[2024-05-22 00:23:14] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-22 00:23:14] [INFO ] Invariant cache hit.
[2024-05-22 00:23:14] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 212 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-22 00:23:15] [INFO ] Invariant cache hit.
[2024-05-22 00:23:15] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 00:23:15] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:15] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 61 ms returned sat
[2024-05-22 00:23:16] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2024-05-22 00:23:16] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 365 ms.
[2024-05-22 00:23:16] [INFO ] After 1493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 216 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 232 transition count 175
Applied a total of 6 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 175/176 transitions.
Incomplete random walk after 10000 steps, including 233 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 863153 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 863153 steps, saw 115361 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 00:23:20] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:23:20] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 00:23:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 81 ms returned sat
[2024-05-22 00:23:21] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 00:23:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:23:21] [INFO ] After 253ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2024-05-22 00:23:21] [INFO ] After 731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 252 ms.
[2024-05-22 00:23:22] [INFO ] After 1532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 176 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 00:23:22] [INFO ] Invariant cache hit.
[2024-05-22 00:23:22] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 00:23:22] [INFO ] Invariant cache hit.
[2024-05-22 00:23:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:23:22] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-22 00:23:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:23:22] [INFO ] Invariant cache hit.
[2024-05-22 00:23:22] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-22 00:23:22] [INFO ] Invariant cache hit.
[2024-05-22 00:23:22] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 00:23:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 00:23:23] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 70 ms returned sat
[2024-05-22 00:23:23] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 00:23:23] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 237 ms.
[2024-05-22 00:23:24] [INFO ] After 1088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND p0 p2 (NOT p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 17 factoid took 529 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 2241 reset in 223 ms.
Product exploration explored 100000 steps with 2234 reset in 247 ms.
Built C files in :
/tmp/ltsmin12097648297560964703
[2024-05-22 00:23:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12097648297560964703
Running compilation step : cd /tmp/ltsmin12097648297560964703;'/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 312 ms.
Running link step : cd /tmp/ltsmin12097648297560964703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12097648297560964703;'/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/stateBased5555284303244811782.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:23:40] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:23:40] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-22 00:23:40] [INFO ] Invariant cache hit.
[2024-05-22 00:23:41] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-22 00:23:41] [INFO ] Invariant cache hit.
[2024-05-22 00:23:41] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin6944537121710602058
[2024-05-22 00:23:41] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6944537121710602058
Running compilation step : cd /tmp/ltsmin6944537121710602058;'/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 330 ms.
Running link step : cd /tmp/ltsmin6944537121710602058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6944537121710602058;'/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/stateBased8443241261880962217.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:23:56] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:23:56] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:23:56] [INFO ] Time to serialize gal into /tmp/LTL5891743150066815967.gal : 2 ms
[2024-05-22 00:23:56] [INFO ] Time to serialize properties into /tmp/LTL15040903465163054241.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/LTL5891743150066815967.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17067174157364181269.hoa' '-atoms' '/tmp/LTL15040903465163054241.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...319
Loading property file /tmp/LTL15040903465163054241.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17067174157364181269.hoa
Detected timeout of ITS tools.
[2024-05-22 00:24:11] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:24:11] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:24:11] [INFO ] Time to serialize gal into /tmp/LTL13687890082365935645.gal : 2 ms
[2024-05-22 00:24:11] [INFO ] Time to serialize properties into /tmp/LTL14886927676872299720.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/LTL13687890082365935645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14886927676872299720.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 : !((F((X((!("(((p14==1)&&(p152==1))&&(p154==1))"))U((G(!("(((p14==1)&&(p152==1))&&(p154==1))")))||((!("(((p14==1)&&(p152==1))&&(p154==1...264
Formula 0 simplified : G(!"((p103==0)||(p124==0))" | X((!"((p136==1)&&(p137==1))" R !"(((p22==1)&&(p152==1))&&(p154==1))") U "(((p14==1)&&(p152==1))&&(p154...163
Detected timeout of ITS tools.
[2024-05-22 00:24:26] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:24:26] [INFO ] Applying decomposition
[2024-05-22 00:24:26] [INFO ] Flatten gal took : 10 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/graph13455679381383177807.txt' '-o' '/tmp/graph13455679381383177807.bin' '-w' '/tmp/graph13455679381383177807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13455679381383177807.bin' '-l' '-1' '-v' '-w' '/tmp/graph13455679381383177807.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:24:26] [INFO ] Decomposing Gal with order
[2024-05-22 00:24:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:24:26] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 00:24:26] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:24:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 00:24:26] [INFO ] Time to serialize gal into /tmp/LTL10643142068489289684.gal : 3 ms
[2024-05-22 00:24:26] [INFO ] Time to serialize properties into /tmp/LTL14092838717972259009.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/LTL10643142068489289684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14092838717972259009.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 : !((F((X((!("(((u13.p14==1)&&(u13.p152==1))&&(u13.p154==1))"))U((G(!("(((u13.p14==1)&&(u13.p152==1))&&(u13.p154==1))")))||((!("(((u13.p...342
Formula 0 simplified : G(!"((i1.u2.p103==0)||(i1.u2.p124==0))" | X((!"((i0.i1.u6.p136==1)&&(i0.i0.u7.p137==1))" R !"(((u13.p22==1)&&(u13.p152==1))&&(u13.p1...217
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t170, u12.t129, u13.t11, u47.t5, u47.t40, i0.i0.t0, i0.i0.t168, i0.i0.t174, i...629
Computing Next relation with stutter on 1.99965e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5947995708957354870
[2024-05-22 00:24:41] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5947995708957354870
Running compilation step : cd /tmp/ltsmin5947995708957354870;'/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 335 ms.
Running link step : cd /tmp/ltsmin5947995708957354870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5947995708957354870;'/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' '--ltl' '<>((X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&((LTLAPp1==true) U (LTLAPp2==true))))))&&(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30a-LTLFireability-06 finished in 114478 ms.
[2024-05-22 00:24:56] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12677879124570726164
[2024-05-22 00:24:56] [INFO ] Applying decomposition
[2024-05-22 00:24:56] [INFO ] Computing symmetric may disable matrix : 177 transitions.
[2024-05-22 00:24:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:24:56] [INFO ] Computing symmetric may enable matrix : 177 transitions.
[2024-05-22 00:24:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:24:56] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:24:56] [INFO ] Computing Do-Not-Accords matrix : 177 transitions.
[2024-05-22 00:24:56] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:24:56] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12677879124570726164
Running compilation step : cd /tmp/ltsmin12677879124570726164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
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/graph753025229679018332.txt' '-o' '/tmp/graph753025229679018332.bin' '-w' '/tmp/graph753025229679018332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph753025229679018332.bin' '-l' '-1' '-v' '-w' '/tmp/graph753025229679018332.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:24:56] [INFO ] Decomposing Gal with order
[2024-05-22 00:24:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:24:56] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 00:24:56] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:24:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-22 00:24:56] [INFO ] Time to serialize gal into /tmp/LTLFireability8896952891958838184.gal : 3 ms
[2024-05-22 00:24:56] [INFO ] Time to serialize properties into /tmp/LTLFireability16232928287668629412.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/LTLFireability8896952891958838184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16232928287668629412.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...277
Read 1 LTL properties
Checking formula 0 : !((F(("((i1.u2.p103==0)||(i1.u2.p124==0))")&&(X((!("(((u14.p14==1)&&(u14.p152==1))&&(u14.p154==1))"))U((G(!("(((u14.p14==1)&&(u14.p152...342
Formula 0 simplified : G(!"((i1.u2.p103==0)||(i1.u2.p124==0))" | X((!"((i0.i0.u6.p136==1)&&(i0.i1.u7.p137==1))" R !"(((u14.p22==1)&&(u14.p152==1))&&(u14.p1...217
Compilation finished in 403 ms.
Running link step : cd /tmp/ltsmin12677879124570726164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12677879124570726164;'/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' '--ltl' '<>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t170, u13.t129, u14.t11, u48.t5, u48.t40, i0.i0.u0.t10, i0.i0.u6.t175, i0.i1....643
Computing Next relation with stutter on 2.19322e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: LTL layer: formula: <>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))
pins2lts-mc-linux64( 4/ 8), 0.003: "<>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.037: There are 182 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.037: State length is 234, there are 203 groups
pins2lts-mc-linux64( 0/ 8), 0.037: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.037: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.037: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.037: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.058: [Blue] ~36 levels ~960 states ~2608 transitions
pins2lts-mc-linux64( 1/ 8), 0.064: [Blue] ~36 levels ~1920 states ~5296 transitions
pins2lts-mc-linux64( 1/ 8), 0.085: [Blue] ~36 levels ~3840 states ~12424 transitions
pins2lts-mc-linux64( 1/ 8), 0.117: [Blue] ~39 levels ~7680 states ~27584 transitions
pins2lts-mc-linux64( 1/ 8), 0.202: [Blue] ~39 levels ~15360 states ~58584 transitions
pins2lts-mc-linux64( 7/ 8), 0.386: [Blue] ~97 levels ~30720 states ~115168 transitions
pins2lts-mc-linux64( 7/ 8), 0.637: [Blue] ~97 levels ~61440 states ~248616 transitions
pins2lts-mc-linux64( 7/ 8), 1.135: [Blue] ~97 levels ~122880 states ~507840 transitions
pins2lts-mc-linux64( 2/ 8), 2.010: [Blue] ~305 levels ~245760 states ~1130848 transitions
pins2lts-mc-linux64( 7/ 8), 3.552: [Blue] ~97 levels ~491520 states ~2525192 transitions
pins2lts-mc-linux64( 2/ 8), 6.083: [Blue] ~305 levels ~983040 states ~5970344 transitions
pins2lts-mc-linux64( 2/ 8), 10.563: [Blue] ~305 levels ~1966080 states ~13414320 transitions
pins2lts-mc-linux64( 2/ 8), 19.366: [Blue] ~357 levels ~3932160 states ~27427680 transitions
pins2lts-mc-linux64( 7/ 8), 36.524: [Blue] ~97 levels ~7864320 states ~58762152 transitions
pins2lts-mc-linux64( 3/ 8), 70.418: [Blue] ~974 levels ~15728640 states ~101845312 transitions
pins2lts-mc-linux64( 3/ 8), 140.167: [Blue] ~1681 levels ~31457280 states ~205515216 transitions
pins2lts-mc-linux64( 0/ 8), 281.430: [Blue] ~4223 levels ~62914560 states ~367493112 transitions
pins2lts-mc-linux64( 5/ 8), 569.525: [Blue] ~428 levels ~125829120 states ~988412616 transitions
pins2lts-mc-linux64( 2/ 8), 667.616: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 667.655:
pins2lts-mc-linux64( 0/ 8), 667.655: Explored 134449383 states 1007584229 transitions, fanout: 7.494
pins2lts-mc-linux64( 0/ 8), 667.655: Total exploration time 667.600 sec (667.540 sec minimum, 667.575 sec on average)
pins2lts-mc-linux64( 0/ 8), 667.655: States per second: 201392, Transitions per second: 1509264
pins2lts-mc-linux64( 0/ 8), 667.655:
pins2lts-mc-linux64( 0/ 8), 667.655: State space has 134217164 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 667.655: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 667.655: blue states: 134449383 (100.17%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 667.655: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 667.655: all-red states: 5324119 (3.97%), bogus 6222 (0.00%)
pins2lts-mc-linux64( 0/ 8), 667.655:
pins2lts-mc-linux64( 0/ 8), 667.655: Total memory used for local state coloring: 0.2MB
pins2lts-mc-linux64( 0/ 8), 667.655:
pins2lts-mc-linux64( 0/ 8), 667.655: Queue width: 8B, total height: 11374, memory: 0.09MB
pins2lts-mc-linux64( 0/ 8), 667.655: Tree memory: 1044.5MB, 8.2 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 667.655: Tree fill ratio (roots/leafs): 99.0%/8.0%
pins2lts-mc-linux64( 0/ 8), 667.655: Stored 177 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 667.655: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 667.655: Est. total memory use: 1044.6MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12677879124570726164;'/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' '--ltl' '<>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12677879124570726164;'/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' '--ltl' '<>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-22 00:46:40] [INFO ] Applying decomposition
[2024-05-22 00:46:40] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:46:40] [INFO ] Decomposing Gal with order
[2024-05-22 00:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:46:40] [INFO ] Removed a total of 221 redundant transitions.
[2024-05-22 00:46:40] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:46:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 6 ms.
[2024-05-22 00:46:40] [INFO ] Time to serialize gal into /tmp/LTLFireability6124299835493176549.gal : 2 ms
[2024-05-22 00:46:40] [INFO ] Time to serialize properties into /tmp/LTLFireability8236705791134775456.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6124299835493176549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8236705791134775456.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...276
Read 1 LTL properties
Checking formula 0 : !((F(("((u4.p103==0)||(u7.p124==0))")&&(X((!("(((u1.p14==1)&&(u20.p152==1))&&(u21.p154==1))"))U((G(!("(((u1.p14==1)&&(u20.p152==1))&&(...322
Formula 0 simplified : G(!"((u4.p103==0)||(u7.p124==0))" | X((!"((u12.p136==1)&&(u13.p137==1))" R !"(((u1.p22==1)&&(u20.p152==1))&&(u21.p154==1))") U "(((u...199
Detected timeout of ITS tools.
[2024-05-22 01:08:23] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:08:23] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-22 01:08:23] [INFO ] Transformed 233 places.
[2024-05-22 01:08:23] [INFO ] Transformed 177 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:08:23] [INFO ] Time to serialize gal into /tmp/LTLFireability5570611352868332262.gal : 2 ms
[2024-05-22 01:08:23] [INFO ] Time to serialize properties into /tmp/LTLFireability13000479946229973910.ltl : 18 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/LTLFireability5570611352868332262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13000479946229973910.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("((p103==0)||(p124==0))")&&(X((!("(((p14==1)&&(p152==1))&&(p154==1))"))U((G(!("(((p14==1)&&(p152==1))&&(p154==1))")))||((!("(((p...264
Formula 0 simplified : G(!"((p103==0)||(p124==0))" | X((!"((p136==1)&&(p137==1))" R !"(((p22==1)&&(p152==1))&&(p154==1))") U "(((p14==1)&&(p152==1))&&(p154...163
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5497780 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16037612 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="DES-PT-30a"
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 DES-PT-30a, 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 r109-tall-171624208500438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30a.tgz
mv DES-PT-30a 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 ;