Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788700197.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 ShieldIIPt-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788700197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K 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:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 686K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716955129350

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 03:58:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:58:56] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-05-29 03:58:57] [INFO ] Transformed 2803 places.
[2024-05-29 03:58:57] [INFO ] Transformed 2603 transitions.
[2024-05-29 03:58:57] [INFO ] Found NUPN structural information;
[2024-05-29 03:58:57] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 431 places :
Symmetric choice reduction at 0 with 431 rule applications. Total rules 431 place count 2372 transition count 2172
Iterating global reduction 0 with 431 rules applied. Total rules applied 862 place count 2372 transition count 2172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 863 place count 2371 transition count 2171
Iterating global reduction 0 with 1 rules applied. Total rules applied 864 place count 2371 transition count 2171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 865 place count 2370 transition count 2170
Iterating global reduction 0 with 1 rules applied. Total rules applied 866 place count 2370 transition count 2170
Applied a total of 866 rules in 1054 ms. Remains 2370 /2803 variables (removed 433) and now considering 2170/2603 (removed 433) transitions.
// Phase 1: matrix 2170 rows 2370 cols
[2024-05-29 03:58:58] [INFO ] Computed 361 invariants in 40 ms
[2024-05-29 03:58:59] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-05-29 03:58:59] [INFO ] Invariant cache hit.
[2024-05-29 03:59:01] [INFO ] Implicit Places using invariants and state equation in 2159 ms returned []
Implicit Place search using SMT with State Equation took 3117 ms to find 0 implicit places.
[2024-05-29 03:59:01] [INFO ] Invariant cache hit.
[2024-05-29 03:59:02] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2370/2803 places, 2170/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5619 ms. Remains : 2370/2803 places, 2170/2603 transitions.
Support contains 41 out of 2370 places after structural reductions.
[2024-05-29 03:59:03] [INFO ] Flatten gal took : 165 ms
[2024-05-29 03:59:03] [INFO ] Flatten gal took : 86 ms
[2024-05-29 03:59:03] [INFO ] Input system was already deterministic with 2170 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 20) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-29 03:59:04] [INFO ] Invariant cache hit.
[2024-05-29 03:59:05] [INFO ] After 809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-29 03:59:06] [INFO ] [Nat]Absence check using 361 positive place invariants in 139 ms returned sat
[2024-05-29 03:59:09] [INFO ] After 2390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-29 03:59:09] [INFO ] Deduced a trap composed of 23 places in 451 ms of which 7 ms to minimize.
[2024-05-29 03:59:10] [INFO ] Deduced a trap composed of 19 places in 430 ms of which 2 ms to minimize.
[2024-05-29 03:59:10] [INFO ] Deduced a trap composed of 29 places in 448 ms of which 1 ms to minimize.
[2024-05-29 03:59:11] [INFO ] Deduced a trap composed of 28 places in 413 ms of which 2 ms to minimize.
[2024-05-29 03:59:11] [INFO ] Deduced a trap composed of 21 places in 428 ms of which 2 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 20 places in 426 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 20 places in 388 ms of which 1 ms to minimize.
[2024-05-29 03:59:13] [INFO ] Deduced a trap composed of 27 places in 416 ms of which 1 ms to minimize.
[2024-05-29 03:59:13] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 1 ms to minimize.
[2024-05-29 03:59:13] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 1 ms to minimize.
[2024-05-29 03:59:14] [INFO ] Deduced a trap composed of 29 places in 365 ms of which 1 ms to minimize.
[2024-05-29 03:59:14] [INFO ] Deduced a trap composed of 32 places in 372 ms of which 0 ms to minimize.
[2024-05-29 03:59:15] [INFO ] Deduced a trap composed of 25 places in 362 ms of which 1 ms to minimize.
[2024-05-29 03:59:15] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 1 ms to minimize.
[2024-05-29 03:59:16] [INFO ] Deduced a trap composed of 20 places in 358 ms of which 1 ms to minimize.
[2024-05-29 03:59:16] [INFO ] Deduced a trap composed of 28 places in 350 ms of which 1 ms to minimize.
[2024-05-29 03:59:16] [INFO ] Deduced a trap composed of 22 places in 332 ms of which 1 ms to minimize.
[2024-05-29 03:59:17] [INFO ] Deduced a trap composed of 38 places in 325 ms of which 1 ms to minimize.
[2024-05-29 03:59:17] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 41 places in 312 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 0 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 38 places in 335 ms of which 1 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 1 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 1 ms to minimize.
[2024-05-29 03:59:20] [INFO ] Deduced a trap composed of 39 places in 319 ms of which 1 ms to minimize.
[2024-05-29 03:59:20] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 1 ms to minimize.
[2024-05-29 03:59:20] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 1 ms to minimize.
[2024-05-29 03:59:21] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 0 ms to minimize.
[2024-05-29 03:59:21] [INFO ] Deduced a trap composed of 37 places in 309 ms of which 1 ms to minimize.
[2024-05-29 03:59:21] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 1 ms to minimize.
[2024-05-29 03:59:22] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 1 ms to minimize.
[2024-05-29 03:59:22] [INFO ] Deduced a trap composed of 43 places in 279 ms of which 1 ms to minimize.
[2024-05-29 03:59:22] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 1 ms to minimize.
[2024-05-29 03:59:23] [INFO ] Deduced a trap composed of 49 places in 267 ms of which 2 ms to minimize.
[2024-05-29 03:59:23] [INFO ] Deduced a trap composed of 49 places in 261 ms of which 1 ms to minimize.
[2024-05-29 03:59:23] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 1 ms to minimize.
[2024-05-29 03:59:24] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 1 ms to minimize.
[2024-05-29 03:59:24] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 1 ms to minimize.
[2024-05-29 03:59:24] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 1 ms to minimize.
[2024-05-29 03:59:25] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 2 ms to minimize.
[2024-05-29 03:59:25] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 1 ms to minimize.
[2024-05-29 03:59:25] [INFO ] Deduced a trap composed of 55 places in 255 ms of which 1 ms to minimize.
[2024-05-29 03:59:26] [INFO ] Deduced a trap composed of 52 places in 243 ms of which 1 ms to minimize.
[2024-05-29 03:59:26] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 0 ms to minimize.
[2024-05-29 03:59:26] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 1 ms to minimize.
[2024-05-29 03:59:27] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 1 ms to minimize.
[2024-05-29 03:59:27] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 1 ms to minimize.
[2024-05-29 03:59:27] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 0 ms to minimize.
[2024-05-29 03:59:27] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 18724 ms
[2024-05-29 03:59:28] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 1 ms to minimize.
[2024-05-29 03:59:28] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 1 ms to minimize.
[2024-05-29 03:59:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 624 ms
[2024-05-29 03:59:29] [INFO ] Deduced a trap composed of 26 places in 750 ms of which 2 ms to minimize.
[2024-05-29 03:59:30] [INFO ] Deduced a trap composed of 23 places in 631 ms of which 2 ms to minimize.
[2024-05-29 03:59:30] [INFO ] Deduced a trap composed of 22 places in 560 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 03:59:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 03:59:30] [INFO ] After 25521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1252 ms.
Support contains 28 out of 2370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Drop transitions removed 464 transitions
Trivial Post-agglo rules discarded 464 transitions
Performed 464 trivial Post agglomeration. Transition count delta: 464
Iterating post reduction 0 with 464 rules applied. Total rules applied 464 place count 2370 transition count 1706
Reduce places removed 464 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 470 rules applied. Total rules applied 934 place count 1906 transition count 1700
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 940 place count 1900 transition count 1700
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 312 Pre rules applied. Total rules applied 940 place count 1900 transition count 1388
Deduced a syphon composed of 312 places in 2 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1564 place count 1588 transition count 1388
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1566 place count 1586 transition count 1386
Iterating global reduction 3 with 2 rules applied. Total rules applied 1568 place count 1586 transition count 1386
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1568 place count 1586 transition count 1384
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1572 place count 1584 transition count 1384
Performed 671 Post agglomeration using F-continuation condition.Transition count delta: 671
Deduced a syphon composed of 671 places in 2 ms
Reduce places removed 671 places and 0 transitions.
Iterating global reduction 3 with 1342 rules applied. Total rules applied 2914 place count 913 transition count 713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2915 place count 913 transition count 712
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2917 place count 912 transition count 711
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3119 place count 811 transition count 770
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 3141 place count 800 transition count 777
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3142 place count 800 transition count 776
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3144 place count 800 transition count 774
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3146 place count 798 transition count 774
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 3185 place count 798 transition count 774
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3186 place count 797 transition count 773
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3188 place count 795 transition count 773
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3188 place count 795 transition count 772
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3190 place count 794 transition count 772
Applied a total of 3190 rules in 584 ms. Remains 794 /2370 variables (removed 1576) and now considering 772/2170 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 794/2370 places, 772/2170 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 772 rows 794 cols
[2024-05-29 03:59:33] [INFO ] Computed 359 invariants in 4 ms
[2024-05-29 03:59:34] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 03:59:34] [INFO ] [Nat]Absence check using 359 positive place invariants in 62 ms returned sat
[2024-05-29 03:59:35] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 03:59:35] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-05-29 03:59:37] [INFO ] After 2461ms SMT Verify possible using 263 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-29 03:59:38] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-29 03:59:39] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2024-05-29 03:59:40] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 4 ms to minimize.
[2024-05-29 03:59:40] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-29 03:59:40] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-29 03:59:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1874 ms
[2024-05-29 03:59:41] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:59:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-29 03:59:42] [INFO ] After 7705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1963 ms.
[2024-05-29 03:59:44] [INFO ] After 10779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 24 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 772/772 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 794 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 793 transition count 771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 793 transition count 770
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 792 transition count 770
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 789 transition count 767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 788 transition count 768
Applied a total of 12 rules in 76 ms. Remains 788 /794 variables (removed 6) and now considering 768/772 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 788/794 places, 768/772 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 107290 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107290 steps, saw 70890 distinct states, run finished after 3005 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 768 rows 788 cols
[2024-05-29 03:59:49] [INFO ] Computed 359 invariants in 7 ms
[2024-05-29 03:59:49] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 03:59:49] [INFO ] [Nat]Absence check using 359 positive place invariants in 58 ms returned sat
[2024-05-29 03:59:50] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 03:59:50] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-29 03:59:55] [INFO ] After 5360ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-29 03:59:56] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:59:56] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:59:56] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:59:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 866 ms
[2024-05-29 03:59:57] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:59:58] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:59:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 701 ms
[2024-05-29 03:59:58] [INFO ] After 8168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1267 ms.
[2024-05-29 03:59:59] [INFO ] After 10460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 1 properties in 303 ms.
Support contains 22 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 768/768 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 787 transition count 767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 786 transition count 766
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 785 transition count 765
Applied a total of 5 rules in 93 ms. Remains 785 /788 variables (removed 3) and now considering 765/768 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 785/788 places, 765/768 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 113678 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113678 steps, saw 75505 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 765 rows 785 cols
[2024-05-29 04:00:04] [INFO ] Computed 359 invariants in 10 ms
[2024-05-29 04:00:04] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 04:00:04] [INFO ] [Nat]Absence check using 359 positive place invariants in 66 ms returned sat
[2024-05-29 04:00:05] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 04:00:05] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-05-29 04:00:08] [INFO ] After 2818ms SMT Verify possible using 263 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 04:00:08] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:00:09] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:00:09] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:00:09] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-29 04:00:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1019 ms
[2024-05-29 04:00:10] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2024-05-29 04:00:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-29 04:00:10] [INFO ] After 5377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2187 ms.
[2024-05-29 04:00:13] [INFO ] After 8626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 377 ms.
Support contains 22 out of 785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 765/765 transitions.
Applied a total of 0 rules in 17 ms. Remains 785 /785 variables (removed 0) and now considering 765/765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 785/785 places, 765/765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 765/765 transitions.
Applied a total of 0 rules in 16 ms. Remains 785 /785 variables (removed 0) and now considering 765/765 (removed 0) transitions.
[2024-05-29 04:00:13] [INFO ] Invariant cache hit.
[2024-05-29 04:00:14] [INFO ] Implicit Places using invariants in 546 ms returned [774]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 549 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 784/785 places, 765/765 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 783 transition count 764
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 783 transition count 764
Applied a total of 2 rules in 26 ms. Remains 783 /784 variables (removed 1) and now considering 764/765 (removed 1) transitions.
// Phase 1: matrix 764 rows 783 cols
[2024-05-29 04:00:14] [INFO ] Computed 358 invariants in 6 ms
[2024-05-29 04:00:14] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-29 04:00:14] [INFO ] Invariant cache hit.
[2024-05-29 04:00:14] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-29 04:00:17] [INFO ] Implicit Places using invariants and state equation in 2774 ms returned []
Implicit Place search using SMT with State Equation took 3266 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 783/785 places, 764/765 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3858 ms. Remains : 783/785 places, 764/765 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 117518 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117518 steps, saw 77326 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 10 properties.
[2024-05-29 04:00:21] [INFO ] Invariant cache hit.
[2024-05-29 04:00:21] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 04:00:21] [INFO ] [Nat]Absence check using 358 positive place invariants in 63 ms returned sat
[2024-05-29 04:00:22] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 04:00:22] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-29 04:00:26] [INFO ] After 4394ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 04:00:27] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2024-05-29 04:00:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 791 ms
[2024-05-29 04:00:28] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-29 04:00:28] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 04:00:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2024-05-29 04:00:28] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:00:28] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:00:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2024-05-29 04:00:29] [INFO ] After 6592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1561 ms.
[2024-05-29 04:00:30] [INFO ] After 9260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 407 ms.
Support contains 22 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 764/764 transitions.
Applied a total of 0 rules in 20 ms. Remains 783 /783 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 783/783 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 764/764 transitions.
Applied a total of 0 rules in 17 ms. Remains 783 /783 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-05-29 04:00:31] [INFO ] Invariant cache hit.
[2024-05-29 04:00:31] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-29 04:00:31] [INFO ] Invariant cache hit.
[2024-05-29 04:00:31] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-29 04:00:34] [INFO ] Implicit Places using invariants and state equation in 2858 ms returned []
Implicit Place search using SMT with State Equation took 3301 ms to find 0 implicit places.
[2024-05-29 04:00:34] [INFO ] Redundant transitions in 50 ms returned []
[2024-05-29 04:00:34] [INFO ] Invariant cache hit.
[2024-05-29 04:00:34] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3815 ms. Remains : 783/783 places, 764/764 transitions.
Partial Free-agglomeration rule applied 157 times.
Drop transitions removed 157 transitions
Iterating global reduction 0 with 157 rules applied. Total rules applied 157 place count 783 transition count 764
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 159 place count 783 transition count 762
Applied a total of 159 rules in 41 ms. Remains 783 /783 variables (removed 0) and now considering 762/764 (removed 2) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 762 rows 783 cols
[2024-05-29 04:00:34] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:00:35] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 04:00:35] [INFO ] [Nat]Absence check using 358 positive place invariants in 61 ms returned sat
[2024-05-29 04:00:36] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 04:00:36] [INFO ] State equation strengthened by 149 read => feed constraints.
[2024-05-29 04:00:37] [INFO ] After 918ms SMT Verify possible using 149 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 04:00:37] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:00:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-29 04:00:37] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:00:37] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-29 04:00:37] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-29 04:00:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 285 ms
[2024-05-29 04:00:37] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2024-05-29 04:00:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-29 04:00:38] [INFO ] After 2003ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 502 ms.
[2024-05-29 04:00:38] [INFO ] After 3531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Computed a total of 639 stabilizing places and 639 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0) U p1)))))'
Support contains 4 out of 2370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2361 transition count 2161
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2361 transition count 2161
Applied a total of 18 rules in 220 ms. Remains 2361 /2370 variables (removed 9) and now considering 2161/2170 (removed 9) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:00:44] [INFO ] Computed 361 invariants in 18 ms
[2024-05-29 04:00:45] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-29 04:00:45] [INFO ] Invariant cache hit.
[2024-05-29 04:00:47] [INFO ] Implicit Places using invariants and state equation in 2344 ms returned []
Implicit Place search using SMT with State Equation took 3104 ms to find 0 implicit places.
[2024-05-29 04:00:47] [INFO ] Invariant cache hit.
[2024-05-29 04:00:49] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2370 places, 2161/2170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4799 ms. Remains : 2361/2370 places, 2161/2170 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 350 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s313 0) (EQ s606 1)), p0:(AND (NOT (OR (EQ s313 0) (EQ s606 1))) (NOT (OR (EQ s978 0) (EQ s21 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 859 ms.
Product exploration explored 100000 steps with 0 reset in 1085 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1116 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 107137 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107137 steps, saw 68078 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:00:56] [INFO ] Invariant cache hit.
[2024-05-29 04:00:56] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:00:57] [INFO ] [Nat]Absence check using 361 positive place invariants in 129 ms returned sat
[2024-05-29 04:00:58] [INFO ] After 1348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:00:59] [INFO ] Deduced a trap composed of 19 places in 594 ms of which 1 ms to minimize.
[2024-05-29 04:00:59] [INFO ] Deduced a trap composed of 32 places in 565 ms of which 1 ms to minimize.
[2024-05-29 04:01:00] [INFO ] Deduced a trap composed of 22 places in 539 ms of which 2 ms to minimize.
[2024-05-29 04:01:01] [INFO ] Deduced a trap composed of 16 places in 530 ms of which 1 ms to minimize.
[2024-05-29 04:01:01] [INFO ] Deduced a trap composed of 28 places in 587 ms of which 2 ms to minimize.
[2024-05-29 04:01:02] [INFO ] Deduced a trap composed of 27 places in 521 ms of which 3 ms to minimize.
[2024-05-29 04:01:02] [INFO ] Deduced a trap composed of 25 places in 535 ms of which 2 ms to minimize.
[2024-05-29 04:01:03] [INFO ] Deduced a trap composed of 29 places in 510 ms of which 1 ms to minimize.
[2024-05-29 04:01:04] [INFO ] Deduced a trap composed of 40 places in 495 ms of which 1 ms to minimize.
[2024-05-29 04:01:04] [INFO ] Deduced a trap composed of 28 places in 516 ms of which 2 ms to minimize.
[2024-05-29 04:01:05] [INFO ] Deduced a trap composed of 31 places in 511 ms of which 2 ms to minimize.
[2024-05-29 04:01:05] [INFO ] Deduced a trap composed of 32 places in 489 ms of which 2 ms to minimize.
[2024-05-29 04:01:06] [INFO ] Deduced a trap composed of 23 places in 514 ms of which 1 ms to minimize.
[2024-05-29 04:01:07] [INFO ] Deduced a trap composed of 20 places in 491 ms of which 2 ms to minimize.
[2024-05-29 04:01:07] [INFO ] Deduced a trap composed of 19 places in 498 ms of which 1 ms to minimize.
[2024-05-29 04:01:08] [INFO ] Deduced a trap composed of 26 places in 499 ms of which 1 ms to minimize.
[2024-05-29 04:01:08] [INFO ] Deduced a trap composed of 28 places in 470 ms of which 1 ms to minimize.
[2024-05-29 04:01:09] [INFO ] Deduced a trap composed of 42 places in 458 ms of which 1 ms to minimize.
[2024-05-29 04:01:09] [INFO ] Deduced a trap composed of 39 places in 451 ms of which 1 ms to minimize.
[2024-05-29 04:01:10] [INFO ] Deduced a trap composed of 30 places in 451 ms of which 2 ms to minimize.
[2024-05-29 04:01:10] [INFO ] Deduced a trap composed of 34 places in 443 ms of which 2 ms to minimize.
[2024-05-29 04:01:11] [INFO ] Deduced a trap composed of 43 places in 435 ms of which 1 ms to minimize.
[2024-05-29 04:01:11] [INFO ] Deduced a trap composed of 37 places in 432 ms of which 1 ms to minimize.
[2024-05-29 04:01:12] [INFO ] Deduced a trap composed of 32 places in 446 ms of which 2 ms to minimize.
[2024-05-29 04:01:12] [INFO ] Deduced a trap composed of 43 places in 449 ms of which 1 ms to minimize.
[2024-05-29 04:01:13] [INFO ] Deduced a trap composed of 44 places in 424 ms of which 1 ms to minimize.
[2024-05-29 04:01:13] [INFO ] Deduced a trap composed of 34 places in 425 ms of which 2 ms to minimize.
[2024-05-29 04:01:14] [INFO ] Deduced a trap composed of 46 places in 398 ms of which 1 ms to minimize.
[2024-05-29 04:01:14] [INFO ] Deduced a trap composed of 41 places in 376 ms of which 1 ms to minimize.
[2024-05-29 04:01:15] [INFO ] Deduced a trap composed of 38 places in 371 ms of which 1 ms to minimize.
[2024-05-29 04:01:15] [INFO ] Deduced a trap composed of 33 places in 367 ms of which 1 ms to minimize.
[2024-05-29 04:01:16] [INFO ] Deduced a trap composed of 43 places in 384 ms of which 1 ms to minimize.
[2024-05-29 04:01:16] [INFO ] Deduced a trap composed of 47 places in 379 ms of which 1 ms to minimize.
[2024-05-29 04:01:17] [INFO ] Deduced a trap composed of 42 places in 374 ms of which 1 ms to minimize.
[2024-05-29 04:01:17] [INFO ] Deduced a trap composed of 48 places in 362 ms of which 1 ms to minimize.
[2024-05-29 04:01:17] [INFO ] Deduced a trap composed of 43 places in 369 ms of which 1 ms to minimize.
[2024-05-29 04:01:18] [INFO ] Deduced a trap composed of 35 places in 353 ms of which 1 ms to minimize.
[2024-05-29 04:01:18] [INFO ] Deduced a trap composed of 44 places in 344 ms of which 1 ms to minimize.
[2024-05-29 04:01:19] [INFO ] Deduced a trap composed of 29 places in 334 ms of which 1 ms to minimize.
[2024-05-29 04:01:19] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 1 ms to minimize.
[2024-05-29 04:01:19] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 1 ms to minimize.
[2024-05-29 04:01:20] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 1 ms to minimize.
[2024-05-29 04:01:20] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 1 ms to minimize.
[2024-05-29 04:01:21] [INFO ] Deduced a trap composed of 48 places in 300 ms of which 1 ms to minimize.
[2024-05-29 04:01:21] [INFO ] Deduced a trap composed of 50 places in 312 ms of which 1 ms to minimize.
[2024-05-29 04:01:21] [INFO ] Deduced a trap composed of 38 places in 288 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:01:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:01:21] [INFO ] After 25266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 260 ms.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 1683
Reduce places removed 478 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 479 rules applied. Total rules applied 957 place count 1883 transition count 1682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 958 place count 1882 transition count 1682
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 958 place count 1882 transition count 1362
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1598 place count 1562 transition count 1362
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 0 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 2946 place count 888 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2947 place count 888 transition count 687
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2949 place count 887 transition count 686
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3151 place count 786 transition count 752
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3187 place count 768 transition count 765
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3188 place count 768 transition count 764
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3228 place count 768 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3229 place count 767 transition count 763
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3231 place count 765 transition count 763
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3231 place count 765 transition count 762
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3233 place count 764 transition count 762
Applied a total of 3233 rules in 309 ms. Remains 764 /2361 variables (removed 1597) and now considering 762/2161 (removed 1399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 764/2361 places, 762/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 136330 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136330 steps, saw 86705 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 762 rows 764 cols
[2024-05-29 04:01:25] [INFO ] Computed 359 invariants in 4 ms
[2024-05-29 04:01:26] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:01:26] [INFO ] [Nat]Absence check using 359 positive place invariants in 56 ms returned sat
[2024-05-29 04:01:26] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:01:26] [INFO ] State equation strengthened by 180 read => feed constraints.
[2024-05-29 04:01:28] [INFO ] After 2003ms SMT Verify possible using 180 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:01:29] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-29 04:01:29] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-29 04:01:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 594 ms
[2024-05-29 04:01:32] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 04:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-29 04:01:32] [INFO ] After 6254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1586 ms.
[2024-05-29 04:01:34] [INFO ] After 8483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 116 ms.
Support contains 4 out of 764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 762/762 transitions.
Applied a total of 0 rules in 13 ms. Remains 764 /764 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 764/764 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 762/762 transitions.
Applied a total of 0 rules in 13 ms. Remains 764 /764 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 04:01:34] [INFO ] Invariant cache hit.
[2024-05-29 04:01:35] [INFO ] Implicit Places using invariants in 460 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 461 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 763/764 places, 762/762 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 762 transition count 761
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 762 transition count 761
Applied a total of 2 rules in 22 ms. Remains 762 /763 variables (removed 1) and now considering 761/762 (removed 1) transitions.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:01:35] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:01:35] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-29 04:01:35] [INFO ] Invariant cache hit.
[2024-05-29 04:01:36] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:01:37] [INFO ] Implicit Places using invariants and state equation in 2119 ms returned []
Implicit Place search using SMT with State Equation took 2649 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 762/764 places, 761/762 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3146 ms. Remains : 762/764 places, 761/762 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 132691 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132691 steps, saw 85191 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:01:41] [INFO ] Invariant cache hit.
[2024-05-29 04:01:41] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:01:41] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2024-05-29 04:01:41] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:01:41] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:01:42] [INFO ] After 868ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:01:42] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-29 04:01:43] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:01:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 669 ms
[2024-05-29 04:01:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:01:43] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:01:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 552 ms
[2024-05-29 04:01:44] [INFO ] After 2757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1178 ms.
[2024-05-29 04:01:45] [INFO ] After 4606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 185 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 761/761 transitions.
Applied a total of 0 rules in 13 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 762/762 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 761/761 transitions.
Applied a total of 0 rules in 11 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 04:01:46] [INFO ] Invariant cache hit.
[2024-05-29 04:01:46] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-29 04:01:46] [INFO ] Invariant cache hit.
[2024-05-29 04:01:46] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:01:48] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned []
Implicit Place search using SMT with State Equation took 2484 ms to find 0 implicit places.
[2024-05-29 04:01:48] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-29 04:01:48] [INFO ] Invariant cache hit.
[2024-05-29 04:01:49] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2966 ms. Remains : 762/762 places, 761/761 transitions.
Partial Free-agglomeration rule applied 139 times.
Drop transitions removed 139 transitions
Iterating global reduction 0 with 139 rules applied. Total rules applied 139 place count 762 transition count 761
Applied a total of 139 rules in 24 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:01:49] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:01:49] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:01:49] [INFO ] [Nat]Absence check using 358 positive place invariants in 58 ms returned sat
[2024-05-29 04:01:49] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:01:49] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-29 04:01:50] [INFO ] After 242ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:01:50] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-05-29 04:01:50] [INFO ] After 1325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 106 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:01:51] [INFO ] Computed 361 invariants in 17 ms
[2024-05-29 04:01:51] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-05-29 04:01:52] [INFO ] Invariant cache hit.
[2024-05-29 04:01:54] [INFO ] Implicit Places using invariants and state equation in 2334 ms returned []
Implicit Place search using SMT with State Equation took 3121 ms to find 0 implicit places.
[2024-05-29 04:01:54] [INFO ] Invariant cache hit.
[2024-05-29 04:01:55] [INFO ] Dead Transitions using invariants and state equation in 1461 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4689 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 108059 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108059 steps, saw 68519 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:01:59] [INFO ] Invariant cache hit.
[2024-05-29 04:01:59] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:02:00] [INFO ] [Nat]Absence check using 361 positive place invariants in 128 ms returned sat
[2024-05-29 04:02:01] [INFO ] After 1355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:02:02] [INFO ] Deduced a trap composed of 19 places in 558 ms of which 1 ms to minimize.
[2024-05-29 04:02:03] [INFO ] Deduced a trap composed of 32 places in 569 ms of which 1 ms to minimize.
[2024-05-29 04:02:03] [INFO ] Deduced a trap composed of 22 places in 538 ms of which 1 ms to minimize.
[2024-05-29 04:02:04] [INFO ] Deduced a trap composed of 16 places in 526 ms of which 2 ms to minimize.
[2024-05-29 04:02:05] [INFO ] Deduced a trap composed of 28 places in 560 ms of which 2 ms to minimize.
[2024-05-29 04:02:05] [INFO ] Deduced a trap composed of 27 places in 525 ms of which 1 ms to minimize.
[2024-05-29 04:02:06] [INFO ] Deduced a trap composed of 25 places in 539 ms of which 1 ms to minimize.
[2024-05-29 04:02:06] [INFO ] Deduced a trap composed of 29 places in 559 ms of which 1 ms to minimize.
[2024-05-29 04:02:07] [INFO ] Deduced a trap composed of 40 places in 515 ms of which 1 ms to minimize.
[2024-05-29 04:02:08] [INFO ] Deduced a trap composed of 28 places in 507 ms of which 1 ms to minimize.
[2024-05-29 04:02:08] [INFO ] Deduced a trap composed of 31 places in 528 ms of which 2 ms to minimize.
[2024-05-29 04:02:09] [INFO ] Deduced a trap composed of 32 places in 522 ms of which 1 ms to minimize.
[2024-05-29 04:02:09] [INFO ] Deduced a trap composed of 23 places in 500 ms of which 2 ms to minimize.
[2024-05-29 04:02:10] [INFO ] Deduced a trap composed of 20 places in 488 ms of which 2 ms to minimize.
[2024-05-29 04:02:10] [INFO ] Deduced a trap composed of 19 places in 490 ms of which 2 ms to minimize.
[2024-05-29 04:02:11] [INFO ] Deduced a trap composed of 26 places in 455 ms of which 1 ms to minimize.
[2024-05-29 04:02:12] [INFO ] Deduced a trap composed of 28 places in 453 ms of which 1 ms to minimize.
[2024-05-29 04:02:12] [INFO ] Deduced a trap composed of 42 places in 457 ms of which 1 ms to minimize.
[2024-05-29 04:02:13] [INFO ] Deduced a trap composed of 39 places in 458 ms of which 1 ms to minimize.
[2024-05-29 04:02:13] [INFO ] Deduced a trap composed of 30 places in 445 ms of which 2 ms to minimize.
[2024-05-29 04:02:14] [INFO ] Deduced a trap composed of 34 places in 425 ms of which 1 ms to minimize.
[2024-05-29 04:02:14] [INFO ] Deduced a trap composed of 43 places in 442 ms of which 1 ms to minimize.
[2024-05-29 04:02:15] [INFO ] Deduced a trap composed of 37 places in 431 ms of which 1 ms to minimize.
[2024-05-29 04:02:15] [INFO ] Deduced a trap composed of 32 places in 424 ms of which 1 ms to minimize.
[2024-05-29 04:02:16] [INFO ] Deduced a trap composed of 43 places in 424 ms of which 1 ms to minimize.
[2024-05-29 04:02:16] [INFO ] Deduced a trap composed of 44 places in 432 ms of which 1 ms to minimize.
[2024-05-29 04:02:17] [INFO ] Deduced a trap composed of 34 places in 420 ms of which 1 ms to minimize.
[2024-05-29 04:02:17] [INFO ] Deduced a trap composed of 46 places in 377 ms of which 1 ms to minimize.
[2024-05-29 04:02:18] [INFO ] Deduced a trap composed of 41 places in 375 ms of which 1 ms to minimize.
[2024-05-29 04:02:18] [INFO ] Deduced a trap composed of 38 places in 374 ms of which 1 ms to minimize.
[2024-05-29 04:02:18] [INFO ] Deduced a trap composed of 33 places in 374 ms of which 1 ms to minimize.
[2024-05-29 04:02:19] [INFO ] Deduced a trap composed of 43 places in 384 ms of which 1 ms to minimize.
[2024-05-29 04:02:19] [INFO ] Deduced a trap composed of 47 places in 358 ms of which 1 ms to minimize.
[2024-05-29 04:02:20] [INFO ] Deduced a trap composed of 42 places in 364 ms of which 1 ms to minimize.
[2024-05-29 04:02:20] [INFO ] Deduced a trap composed of 48 places in 371 ms of which 1 ms to minimize.
[2024-05-29 04:02:21] [INFO ] Deduced a trap composed of 43 places in 353 ms of which 1 ms to minimize.
[2024-05-29 04:02:21] [INFO ] Deduced a trap composed of 35 places in 353 ms of which 1 ms to minimize.
[2024-05-29 04:02:22] [INFO ] Deduced a trap composed of 44 places in 352 ms of which 1 ms to minimize.
[2024-05-29 04:02:22] [INFO ] Deduced a trap composed of 29 places in 349 ms of which 1 ms to minimize.
[2024-05-29 04:02:22] [INFO ] Deduced a trap composed of 35 places in 326 ms of which 1 ms to minimize.
[2024-05-29 04:02:23] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 1 ms to minimize.
[2024-05-29 04:02:23] [INFO ] Deduced a trap composed of 32 places in 322 ms of which 0 ms to minimize.
[2024-05-29 04:02:24] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 1 ms to minimize.
[2024-05-29 04:02:24] [INFO ] Deduced a trap composed of 48 places in 307 ms of which 1 ms to minimize.
[2024-05-29 04:02:24] [INFO ] Deduced a trap composed of 50 places in 305 ms of which 1 ms to minimize.
[2024-05-29 04:02:25] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:02:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:02:25] [INFO ] After 25203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 264 ms.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 1683
Reduce places removed 478 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 479 rules applied. Total rules applied 957 place count 1883 transition count 1682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 958 place count 1882 transition count 1682
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 958 place count 1882 transition count 1362
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1598 place count 1562 transition count 1362
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 0 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 2946 place count 888 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2947 place count 888 transition count 687
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2949 place count 887 transition count 686
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3151 place count 786 transition count 752
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3187 place count 768 transition count 765
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3188 place count 768 transition count 764
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3228 place count 768 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3229 place count 767 transition count 763
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3231 place count 765 transition count 763
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3231 place count 765 transition count 762
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3233 place count 764 transition count 762
Applied a total of 3233 rules in 239 ms. Remains 764 /2361 variables (removed 1597) and now considering 762/2161 (removed 1399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 764/2361 places, 762/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 139506 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139506 steps, saw 88907 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 762 rows 764 cols
[2024-05-29 04:02:29] [INFO ] Computed 359 invariants in 5 ms
[2024-05-29 04:02:29] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:02:29] [INFO ] [Nat]Absence check using 359 positive place invariants in 57 ms returned sat
[2024-05-29 04:02:29] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:02:29] [INFO ] State equation strengthened by 180 read => feed constraints.
[2024-05-29 04:02:31] [INFO ] After 2001ms SMT Verify possible using 180 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:02:32] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-29 04:02:32] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-29 04:02:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 596 ms
[2024-05-29 04:02:35] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:02:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2024-05-29 04:02:36] [INFO ] After 6199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1532 ms.
[2024-05-29 04:02:37] [INFO ] After 8417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 127 ms.
Support contains 4 out of 764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 762/762 transitions.
Applied a total of 0 rules in 11 ms. Remains 764 /764 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 764/764 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 762/762 transitions.
Applied a total of 0 rules in 11 ms. Remains 764 /764 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 04:02:37] [INFO ] Invariant cache hit.
[2024-05-29 04:02:38] [INFO ] Implicit Places using invariants in 443 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 456 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 763/764 places, 762/762 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 762 transition count 761
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 762 transition count 761
Applied a total of 2 rules in 29 ms. Remains 762 /763 variables (removed 1) and now considering 761/762 (removed 1) transitions.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:02:38] [INFO ] Computed 358 invariants in 5 ms
[2024-05-29 04:02:38] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-29 04:02:38] [INFO ] Invariant cache hit.
[2024-05-29 04:02:39] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:02:40] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2612 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 762/764 places, 761/762 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3109 ms. Remains : 762/764 places, 761/762 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 136298 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136298 steps, saw 87521 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:02:44] [INFO ] Invariant cache hit.
[2024-05-29 04:02:44] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:02:44] [INFO ] [Nat]Absence check using 358 positive place invariants in 57 ms returned sat
[2024-05-29 04:02:45] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:02:45] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:02:45] [INFO ] After 852ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:02:46] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-29 04:02:46] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:02:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 669 ms
[2024-05-29 04:02:46] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 04:02:47] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:02:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 543 ms
[2024-05-29 04:02:47] [INFO ] After 2701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1166 ms.
[2024-05-29 04:02:48] [INFO ] After 4541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 176 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 761/761 transitions.
Applied a total of 0 rules in 14 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 762/762 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 761/761 transitions.
Applied a total of 0 rules in 11 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 04:02:49] [INFO ] Invariant cache hit.
[2024-05-29 04:02:49] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-29 04:02:49] [INFO ] Invariant cache hit.
[2024-05-29 04:02:50] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:02:51] [INFO ] Implicit Places using invariants and state equation in 2138 ms returned []
Implicit Place search using SMT with State Equation took 2596 ms to find 0 implicit places.
[2024-05-29 04:02:51] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 04:02:51] [INFO ] Invariant cache hit.
[2024-05-29 04:02:52] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3039 ms. Remains : 762/762 places, 761/761 transitions.
Partial Free-agglomeration rule applied 139 times.
Drop transitions removed 139 transitions
Iterating global reduction 0 with 139 rules applied. Total rules applied 139 place count 762 transition count 761
Applied a total of 139 rules in 24 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:02:52] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:02:52] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:02:52] [INFO ] [Nat]Absence check using 358 positive place invariants in 55 ms returned sat
[2024-05-29 04:02:53] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:02:53] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-29 04:02:53] [INFO ] After 230ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:02:53] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-05-29 04:02:53] [INFO ] After 1276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 757 ms.
Product exploration explored 100000 steps with 0 reset in 954 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2361 transition count 2161
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 160 Pre rules applied. Total rules applied 479 place count 2361 transition count 2281
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 639 place count 2361 transition count 2281
Performed 795 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1434 places in 2 ms
Iterating global reduction 1 with 795 rules applied. Total rules applied 1434 place count 2361 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1435 place count 2361 transition count 2281
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1754 place count 2042 transition count 1962
Deduced a syphon composed of 1115 places in 3 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 2073 place count 2042 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2074 place count 2042 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2076 place count 2040 transition count 1960
Deduced a syphon composed of 1114 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2078 place count 2040 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 1215 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2179 place count 2040 transition count 2490
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2280 place count 1939 transition count 2288
Deduced a syphon composed of 1114 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2381 place count 1939 transition count 2288
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1171 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2438 place count 1939 transition count 2595
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2495 place count 1882 transition count 2481
Deduced a syphon composed of 1114 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2552 place count 1882 transition count 2481
Deduced a syphon composed of 1114 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2561 place count 1882 transition count 2472
Deduced a syphon composed of 1114 places in 2 ms
Applied a total of 2561 rules in 1554 ms. Remains 1882 /2361 variables (removed 479) and now considering 2472/2161 (removed -311) transitions.
[2024-05-29 04:02:58] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 2472 rows 1882 cols
[2024-05-29 04:02:58] [INFO ] Computed 361 invariants in 17 ms
[2024-05-29 04:02:59] [INFO ] Dead Transitions using invariants and state equation in 1369 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1882/2361 places, 2472/2161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2977 ms. Remains : 1882/2361 places, 2472/2161 transitions.
Built C files in :
/tmp/ltsmin17859567054702242886
[2024-05-29 04:02:59] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17859567054702242886
Running compilation step : cd /tmp/ltsmin17859567054702242886;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17859567054702242886;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17859567054702242886;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 132 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:03:07] [INFO ] Computed 361 invariants in 14 ms
[2024-05-29 04:03:08] [INFO ] Implicit Places using invariants in 801 ms returned []
[2024-05-29 04:03:08] [INFO ] Invariant cache hit.
[2024-05-29 04:03:10] [INFO ] Implicit Places using invariants and state equation in 2440 ms returned []
Implicit Place search using SMT with State Equation took 3244 ms to find 0 implicit places.
[2024-05-29 04:03:10] [INFO ] Invariant cache hit.
[2024-05-29 04:03:11] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4850 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Built C files in :
/tmp/ltsmin5694221543606945775
[2024-05-29 04:03:12] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5694221543606945775
Running compilation step : cd /tmp/ltsmin5694221543606945775;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5694221543606945775;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5694221543606945775;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 04:03:15] [INFO ] Flatten gal took : 69 ms
[2024-05-29 04:03:15] [INFO ] Flatten gal took : 64 ms
[2024-05-29 04:03:15] [INFO ] Time to serialize gal into /tmp/LTL15063930369181406211.gal : 15 ms
[2024-05-29 04:03:15] [INFO ] Time to serialize properties into /tmp/LTL10232856406527351593.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/LTL15063930369181406211.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6772258130440582175.hoa' '-atoms' '/tmp/LTL10232856406527351593.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/LTL10232856406527351593.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6772258130440582175.hoa
Detected timeout of ITS tools.
[2024-05-29 04:03:30] [INFO ] Flatten gal took : 53 ms
[2024-05-29 04:03:30] [INFO ] Flatten gal took : 51 ms
[2024-05-29 04:03:30] [INFO ] Time to serialize gal into /tmp/LTL3014239870317657531.gal : 8 ms
[2024-05-29 04:03:33] [INFO ] Time to serialize properties into /tmp/LTL15485783885300840508.ltl : 2755 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/LTL3014239870317657531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15485783885300840508.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G("((!((p361==0)||(p710==1)))&&(!((p1154==0)||(p21==1))))"))U("((p361==0)||(p710==1))"))))))
Formula 0 simplified : XXF(F!"((!((p361==0)||(p710==1)))&&(!((p1154==0)||(p21==1))))" R !"((p361==0)||(p710==1))")
Detected timeout of ITS tools.
[2024-05-29 04:03:48] [INFO ] Flatten gal took : 61 ms
[2024-05-29 04:03:48] [INFO ] Applying decomposition
[2024-05-29 04:03:48] [INFO ] Flatten gal took : 50 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/graph824719181922941070.txt' '-o' '/tmp/graph824719181922941070.bin' '-w' '/tmp/graph824719181922941070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph824719181922941070.bin' '-l' '-1' '-v' '-w' '/tmp/graph824719181922941070.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:03:48] [INFO ] Decomposing Gal with order
[2024-05-29 04:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:03:49] [INFO ] Removed a total of 403 redundant transitions.
[2024-05-29 04:03:49] [INFO ] Flatten gal took : 171 ms
[2024-05-29 04:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 04:03:49] [INFO ] Time to serialize gal into /tmp/LTL99738461697857678.gal : 22 ms
[2024-05-29 04:03:49] [INFO ] Time to serialize properties into /tmp/LTL5994124395192820629.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/LTL99738461697857678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5994124395192820629.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...252
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G("((!((i4.u116.p361==0)||(i9.u228.p710==1)))&&(!((i16.u366.p1154==0)||(i18.u9.p21==1))))"))U("((i4.u116.p361==0)||(i9.u228....171
Formula 0 simplified : XXF(F!"((!((i4.u116.p361==0)||(i9.u228.p710==1)))&&(!((i16.u366.p1154==0)||(i18.u9.p21==1))))" R !"((i4.u116.p361==0)||(i9.u228.p710...162
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13065230635686337086
[2024-05-29 04:04:04] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13065230635686337086
Running compilation step : cd /tmp/ltsmin13065230635686337086;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13065230635686337086;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13065230635686337086;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-00 finished in 208432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2362 transition count 2162
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2362 transition count 2162
Applied a total of 16 rules in 237 ms. Remains 2362 /2370 variables (removed 8) and now considering 2162/2170 (removed 8) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2024-05-29 04:04:07] [INFO ] Computed 361 invariants in 13 ms
[2024-05-29 04:04:08] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-29 04:04:08] [INFO ] Invariant cache hit.
[2024-05-29 04:04:10] [INFO ] Implicit Places using invariants and state equation in 2423 ms returned []
Implicit Place search using SMT with State Equation took 3281 ms to find 0 implicit places.
[2024-05-29 04:04:10] [INFO ] Invariant cache hit.
[2024-05-29 04:04:12] [INFO ] Dead Transitions using invariants and state equation in 1460 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2370 places, 2162/2170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4981 ms. Remains : 2362/2370 places, 2162/2170 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1875 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1243 ms.
Product exploration explored 100000 steps with 50000 reset in 1218 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-01 finished in 7596 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)))'
Support contains 2 out of 2370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2369 transition count 1690
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1890 transition count 1690
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 958 place count 1890 transition count 1375
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1588 place count 1575 transition count 1375
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1594 place count 1569 transition count 1369
Iterating global reduction 2 with 6 rules applied. Total rules applied 1600 place count 1569 transition count 1369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1600 place count 1569 transition count 1363
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1612 place count 1563 transition count 1363
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 1 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 2 with 1354 rules applied. Total rules applied 2966 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2967 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2969 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3171 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3207 place count 766 transition count 763
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3209 place count 764 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3211 place count 762 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3211 place count 762 transition count 760
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3213 place count 761 transition count 760
Applied a total of 3213 rules in 499 ms. Remains 761 /2370 variables (removed 1609) and now considering 760/2170 (removed 1410) transitions.
// Phase 1: matrix 760 rows 761 cols
[2024-05-29 04:04:15] [INFO ] Computed 359 invariants in 5 ms
[2024-05-29 04:04:15] [INFO ] Implicit Places using invariants in 427 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 429 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/2370 places, 760/2170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 759 transition count 759
Applied a total of 2 rules in 24 ms. Remains 759 /760 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 759 cols
[2024-05-29 04:04:15] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:04:16] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-29 04:04:16] [INFO ] Invariant cache hit.
[2024-05-29 04:04:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 04:04:17] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 759/2370 places, 759/2170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2310 ms. Remains : 759/2370 places, 759/2170 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s628 0) (EQ s421 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-04 finished in 2367 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(p1))||p0)))'
Support contains 4 out of 2370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2362 transition count 2162
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2362 transition count 2162
Applied a total of 16 rules in 262 ms. Remains 2362 /2370 variables (removed 8) and now considering 2162/2170 (removed 8) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2024-05-29 04:04:17] [INFO ] Computed 361 invariants in 15 ms
[2024-05-29 04:04:18] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-29 04:04:18] [INFO ] Invariant cache hit.
[2024-05-29 04:04:20] [INFO ] Implicit Places using invariants and state equation in 2354 ms returned []
Implicit Place search using SMT with State Equation took 3201 ms to find 0 implicit places.
[2024-05-29 04:04:20] [INFO ] Invariant cache hit.
[2024-05-29 04:04:22] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2370 places, 2162/2170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4942 ms. Remains : 2362/2370 places, 2162/2170 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s98 0) (EQ s1626 1)), p1:(OR (EQ s33 0) (EQ s444 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1193 ms.
Product exploration explored 100000 steps with 50000 reset in 1212 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-05 finished in 7564 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))&&((!p1||G(p2)) U p3)))'
Support contains 7 out of 2370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2362 transition count 2162
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2362 transition count 2162
Applied a total of 16 rules in 264 ms. Remains 2362 /2370 variables (removed 8) and now considering 2162/2170 (removed 8) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2024-05-29 04:04:25] [INFO ] Computed 361 invariants in 13 ms
[2024-05-29 04:04:25] [INFO ] Implicit Places using invariants in 839 ms returned []
[2024-05-29 04:04:25] [INFO ] Invariant cache hit.
[2024-05-29 04:04:28] [INFO ] Implicit Places using invariants and state equation in 2228 ms returned []
Implicit Place search using SMT with State Equation took 3072 ms to find 0 implicit places.
[2024-05-29 04:04:28] [INFO ] Invariant cache hit.
[2024-05-29 04:04:29] [INFO ] Dead Transitions using invariants and state equation in 1427 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2370 places, 2162/2170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4768 ms. Remains : 2362/2370 places, 2162/2170 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p3), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p1 p2), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}]], initial=0, aps=[p3:(EQ s118 1), p1:(OR (EQ s1754 0) (EQ s2348 1)), p2:(OR (EQ s1520 0) (EQ s1990 1)), p0:(OR (EQ s1798 0) (EQ s1849 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5363 steps with 3 reset in 42 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-07 finished in 5044 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(p0)))'
Support contains 5 out of 2370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2369 transition count 1694
Reduce places removed 475 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 478 rules applied. Total rules applied 953 place count 1894 transition count 1691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 956 place count 1891 transition count 1691
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 956 place count 1891 transition count 1376
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1586 place count 1576 transition count 1376
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1592 place count 1570 transition count 1370
Iterating global reduction 3 with 6 rules applied. Total rules applied 1598 place count 1570 transition count 1370
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1598 place count 1570 transition count 1364
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1610 place count 1564 transition count 1364
Performed 675 Post agglomeration using F-continuation condition.Transition count delta: 675
Deduced a syphon composed of 675 places in 1 ms
Reduce places removed 675 places and 0 transitions.
Iterating global reduction 3 with 1350 rules applied. Total rules applied 2960 place count 889 transition count 689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2961 place count 889 transition count 688
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2963 place count 888 transition count 687
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3165 place count 787 transition count 753
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 3197 place count 771 transition count 764
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3199 place count 769 transition count 762
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3201 place count 767 transition count 762
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3201 place count 767 transition count 761
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3203 place count 766 transition count 761
Applied a total of 3203 rules in 352 ms. Remains 766 /2370 variables (removed 1604) and now considering 761/2170 (removed 1409) transitions.
// Phase 1: matrix 761 rows 766 cols
[2024-05-29 04:04:30] [INFO ] Computed 359 invariants in 2 ms
[2024-05-29 04:04:30] [INFO ] Implicit Places using invariants in 486 ms returned [755]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 490 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 765/2370 places, 761/2170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 764 transition count 760
Applied a total of 2 rules in 24 ms. Remains 764 /765 variables (removed 1) and now considering 760/761 (removed 1) transitions.
// Phase 1: matrix 760 rows 764 cols
[2024-05-29 04:04:30] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:04:31] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-29 04:04:31] [INFO ] Invariant cache hit.
[2024-05-29 04:04:31] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-29 04:04:34] [INFO ] Implicit Places using invariants and state equation in 3411 ms returned []
Implicit Place search using SMT with State Equation took 3877 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 764/2370 places, 760/2170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4744 ms. Remains : 764/2370 places, 760/2170 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s327 0) (EQ s599 1) (AND (EQ s408 0) (OR (EQ s232 0) (EQ s83 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 733 ms.
Product exploration explored 100000 steps with 0 reset in 874 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 244512 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244512 steps, saw 149957 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:04:39] [INFO ] Invariant cache hit.
[2024-05-29 04:04:39] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:04:39] [INFO ] [Nat]Absence check using 358 positive place invariants in 57 ms returned sat
[2024-05-29 04:04:40] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:04:40] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-29 04:04:49] [INFO ] After 9038ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-29 04:04:49] [INFO ] After 9602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 29 ms.
Support contains 5 out of 764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 760/760 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 764 transition count 759
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 764 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 763 transition count 758
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 35 place count 763 transition count 758
Applied a total of 35 rules in 38 ms. Remains 763 /764 variables (removed 1) and now considering 758/760 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 763/764 places, 758/760 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 248805 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248805 steps, saw 157000 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 758 rows 763 cols
[2024-05-29 04:04:52] [INFO ] Computed 358 invariants in 5 ms
[2024-05-29 04:04:52] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:04:52] [INFO ] [Nat]Absence check using 358 positive place invariants in 57 ms returned sat
[2024-05-29 04:04:53] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:04:53] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-29 04:05:02] [INFO ] After 9074ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-29 04:05:02] [INFO ] After 9623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 758/758 transitions.
Applied a total of 0 rules in 12 ms. Remains 763 /763 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 763/763 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 758/758 transitions.
Applied a total of 0 rules in 23 ms. Remains 763 /763 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-29 04:05:02] [INFO ] Invariant cache hit.
[2024-05-29 04:05:02] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-29 04:05:02] [INFO ] Invariant cache hit.
[2024-05-29 04:05:03] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-29 04:05:05] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned []
Implicit Place search using SMT with State Equation took 3126 ms to find 0 implicit places.
[2024-05-29 04:05:05] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 04:05:05] [INFO ] Invariant cache hit.
[2024-05-29 04:05:06] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3644 ms. Remains : 763/763 places, 758/758 transitions.
Partial Free-agglomeration rule applied 172 times.
Drop transitions removed 172 transitions
Iterating global reduction 0 with 172 rules applied. Total rules applied 172 place count 763 transition count 758
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 173 place count 763 transition count 757
Applied a total of 173 rules in 42 ms. Remains 763 /763 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 763 cols
[2024-05-29 04:05:06] [INFO ] Computed 358 invariants in 5 ms
[2024-05-29 04:05:06] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:05:06] [INFO ] [Nat]Absence check using 358 positive place invariants in 54 ms returned sat
[2024-05-29 04:05:06] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:05:06] [INFO ] State equation strengthened by 153 read => feed constraints.
[2024-05-29 04:05:07] [INFO ] After 579ms SMT Verify possible using 153 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:05:07] [INFO ] After 708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 297 ms.
[2024-05-29 04:05:07] [INFO ] After 1517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 764 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 760/760 transitions.
Applied a total of 0 rules in 22 ms. Remains 764 /764 variables (removed 0) and now considering 760/760 (removed 0) transitions.
// Phase 1: matrix 760 rows 764 cols
[2024-05-29 04:05:08] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:05:08] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-29 04:05:08] [INFO ] Invariant cache hit.
[2024-05-29 04:05:08] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-29 04:05:11] [INFO ] Implicit Places using invariants and state equation in 3107 ms returned []
Implicit Place search using SMT with State Equation took 3565 ms to find 0 implicit places.
[2024-05-29 04:05:11] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 04:05:11] [INFO ] Invariant cache hit.
[2024-05-29 04:05:12] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4036 ms. Remains : 764/764 places, 760/760 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251481 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251481 steps, saw 154309 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:05:15] [INFO ] Invariant cache hit.
[2024-05-29 04:05:15] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:05:15] [INFO ] [Nat]Absence check using 358 positive place invariants in 58 ms returned sat
[2024-05-29 04:05:16] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:05:16] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-29 04:05:25] [INFO ] After 9042ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-29 04:05:25] [INFO ] After 9617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 760/760 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 764 transition count 759
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 764 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 763 transition count 758
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 35 place count 763 transition count 758
Applied a total of 35 rules in 40 ms. Remains 763 /764 variables (removed 1) and now considering 758/760 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 763/764 places, 758/760 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251529 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251529 steps, saw 158818 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 758 rows 763 cols
[2024-05-29 04:05:28] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:05:28] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:05:28] [INFO ] [Nat]Absence check using 358 positive place invariants in 60 ms returned sat
[2024-05-29 04:05:28] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:05:28] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-29 04:05:37] [INFO ] After 9046ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-29 04:05:37] [INFO ] After 9567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 65 ms.
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 758/758 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 763/763 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 758/758 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-29 04:05:38] [INFO ] Invariant cache hit.
[2024-05-29 04:05:38] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-29 04:05:38] [INFO ] Invariant cache hit.
[2024-05-29 04:05:38] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-29 04:05:41] [INFO ] Implicit Places using invariants and state equation in 2752 ms returned []
Implicit Place search using SMT with State Equation took 3227 ms to find 0 implicit places.
[2024-05-29 04:05:41] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 04:05:41] [INFO ] Invariant cache hit.
[2024-05-29 04:05:41] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3680 ms. Remains : 763/763 places, 758/758 transitions.
Partial Free-agglomeration rule applied 172 times.
Drop transitions removed 172 transitions
Iterating global reduction 0 with 172 rules applied. Total rules applied 172 place count 763 transition count 758
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 173 place count 763 transition count 757
Applied a total of 173 rules in 45 ms. Remains 763 /763 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 763 cols
[2024-05-29 04:05:41] [INFO ] Computed 358 invariants in 5 ms
[2024-05-29 04:05:41] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:05:42] [INFO ] [Nat]Absence check using 358 positive place invariants in 56 ms returned sat
[2024-05-29 04:05:42] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:05:42] [INFO ] State equation strengthened by 153 read => feed constraints.
[2024-05-29 04:05:43] [INFO ] After 564ms SMT Verify possible using 153 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:05:43] [INFO ] After 690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 295 ms.
[2024-05-29 04:05:43] [INFO ] After 1515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 662 ms.
Product exploration explored 100000 steps with 0 reset in 852 ms.
Built C files in :
/tmp/ltsmin378944039811930743
[2024-05-29 04:05:45] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 04:05:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:05:45] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 04:05:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:05:45] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 04:05:45] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:05:45] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin378944039811930743
Running compilation step : cd /tmp/ltsmin378944039811930743;'/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 2026 ms.
Running link step : cd /tmp/ltsmin378944039811930743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin378944039811930743;'/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/stateBased8521052526686356409.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 764 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 760/760 transitions.
Applied a total of 0 rules in 22 ms. Remains 764 /764 variables (removed 0) and now considering 760/760 (removed 0) transitions.
// Phase 1: matrix 760 rows 764 cols
[2024-05-29 04:06:00] [INFO ] Computed 358 invariants in 5 ms
[2024-05-29 04:06:00] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-29 04:06:00] [INFO ] Invariant cache hit.
[2024-05-29 04:06:01] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-29 04:06:04] [INFO ] Implicit Places using invariants and state equation in 3216 ms returned []
Implicit Place search using SMT with State Equation took 3660 ms to find 0 implicit places.
[2024-05-29 04:06:04] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 04:06:04] [INFO ] Invariant cache hit.
[2024-05-29 04:06:04] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4150 ms. Remains : 764/764 places, 760/760 transitions.
Built C files in :
/tmp/ltsmin2127217779721040966
[2024-05-29 04:06:04] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 04:06:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:06:04] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 04:06:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:06:04] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 04:06:04] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:06:04] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2127217779721040966
Running compilation step : cd /tmp/ltsmin2127217779721040966;'/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 2030 ms.
Running link step : cd /tmp/ltsmin2127217779721040966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2127217779721040966;'/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/stateBased3050029598069757987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:06:19] [INFO ] Flatten gal took : 26 ms
[2024-05-29 04:06:19] [INFO ] Flatten gal took : 26 ms
[2024-05-29 04:06:19] [INFO ] Time to serialize gal into /tmp/LTL18356547131657682471.gal : 4 ms
[2024-05-29 04:06:19] [INFO ] Time to serialize properties into /tmp/LTL5282032614035123189.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18356547131657682471.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7501693113049668371.hoa' '-atoms' '/tmp/LTL5282032614035123189.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/LTL5282032614035123189.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7501693113049668371.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1588
Computing Next relation with stutter on 1.60065e+49 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1100 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.0928,285920,1,0,1399,1.66039e+06,1549,506,28551,999688,1545
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-08 finished in 122348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 4 out of 2370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2369 transition count 1690
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1890 transition count 1690
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 958 place count 1890 transition count 1376
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1586 place count 1576 transition count 1376
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1591 place count 1571 transition count 1371
Iterating global reduction 2 with 5 rules applied. Total rules applied 1596 place count 1571 transition count 1371
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1596 place count 1571 transition count 1366
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1606 place count 1566 transition count 1366
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 0 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2968 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2969 place count 885 transition count 684
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2971 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3173 place count 783 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3207 place count 766 transition count 760
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3209 place count 764 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3211 place count 762 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3211 place count 762 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3213 place count 761 transition count 757
Applied a total of 3213 rules in 335 ms. Remains 761 /2370 variables (removed 1609) and now considering 757/2170 (removed 1413) transitions.
// Phase 1: matrix 757 rows 761 cols
[2024-05-29 04:06:32] [INFO ] Computed 359 invariants in 2 ms
[2024-05-29 04:06:33] [INFO ] Implicit Places using invariants in 493 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 523 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/2370 places, 757/2170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 759 transition count 756
Applied a total of 2 rules in 23 ms. Remains 759 /760 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 759 cols
[2024-05-29 04:06:33] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:06:33] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-29 04:06:33] [INFO ] Invariant cache hit.
[2024-05-29 04:06:34] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 759/2370 places, 756/2170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2192 ms. Remains : 759/2370 places, 756/2170 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NEQ s215 0) (NEQ s689 1)), p0:(OR (EQ s143 0) (EQ s420 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 612 ms.
Product exploration explored 100000 steps with 0 reset in 817 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 113 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 255279 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255279 steps, saw 158671 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:06:39] [INFO ] Invariant cache hit.
[2024-05-29 04:06:39] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:06:39] [INFO ] [Nat]Absence check using 358 positive place invariants in 56 ms returned sat
[2024-05-29 04:06:39] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:06:39] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-29 04:06:39] [INFO ] After 550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 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 759 transition count 755
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 758 transition count 754
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 757 transition count 754
Applied a total of 5 rules in 31 ms. Remains 757 /759 variables (removed 2) and now considering 754/756 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 757/759 places, 754/756 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 263015 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263015 steps, saw 165141 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2024-05-29 04:06:43] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:06:43] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:06:43] [INFO ] [Nat]Absence check using 358 positive place invariants in 55 ms returned sat
[2024-05-29 04:06:43] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:06:43] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 04:06:43] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 13 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 13 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2024-05-29 04:06:43] [INFO ] Invariant cache hit.
[2024-05-29 04:06:44] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-29 04:06:44] [INFO ] Invariant cache hit.
[2024-05-29 04:06:45] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2024-05-29 04:06:45] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 04:06:45] [INFO ] Invariant cache hit.
[2024-05-29 04:06:45] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1728 ms. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 757 transition count 754
Applied a total of 79 rules in 24 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2024-05-29 04:06:45] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:06:45] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:06:45] [INFO ] [Nat]Absence check using 358 positive place invariants in 57 ms returned sat
[2024-05-29 04:06:46] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:06:46] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 04:06:46] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Support contains 2 out of 759 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 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 20 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
// Phase 1: matrix 756 rows 759 cols
[2024-05-29 04:06:46] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:06:46] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-29 04:06:46] [INFO ] Invariant cache hit.
[2024-05-29 04:06:47] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
[2024-05-29 04:06:47] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 04:06:47] [INFO ] Invariant cache hit.
[2024-05-29 04:06:48] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1818 ms. Remains : 759/759 places, 756/756 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267084 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 267084 steps, saw 167093 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:06:51] [INFO ] Invariant cache hit.
[2024-05-29 04:06:51] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:06:51] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2024-05-29 04:06:52] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:06:52] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-29 04:06:52] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 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 759 transition count 755
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 758 transition count 754
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 757 transition count 754
Applied a total of 5 rules in 31 ms. Remains 757 /759 variables (removed 2) and now considering 754/756 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 757/759 places, 754/756 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267163 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267163 steps, saw 167596 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2024-05-29 04:06:55] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:06:55] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:06:55] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2024-05-29 04:06:55] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:06:56] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 04:06:56] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 11 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 11 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2024-05-29 04:06:56] [INFO ] Invariant cache hit.
[2024-05-29 04:06:56] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-29 04:06:56] [INFO ] Invariant cache hit.
[2024-05-29 04:06:57] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2024-05-29 04:06:57] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 04:06:57] [INFO ] Invariant cache hit.
[2024-05-29 04:06:57] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1785 ms. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 757 transition count 754
Applied a total of 79 rules in 22 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2024-05-29 04:06:57] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:06:57] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:06:58] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2024-05-29 04:06:58] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:06:58] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 04:06:58] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 642 ms.
Product exploration explored 100000 steps with 0 reset in 872 ms.
Built C files in :
/tmp/ltsmin15004085658665360887
[2024-05-29 04:07:00] [INFO ] Computing symmetric may disable matrix : 756 transitions.
[2024-05-29 04:07:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:07:00] [INFO ] Computing symmetric may enable matrix : 756 transitions.
[2024-05-29 04:07:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:07:00] [INFO ] Computing Do-Not-Accords matrix : 756 transitions.
[2024-05-29 04:07:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:07:00] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15004085658665360887
Running compilation step : cd /tmp/ltsmin15004085658665360887;'/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 2986 ms.
Running link step : cd /tmp/ltsmin15004085658665360887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15004085658665360887;'/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/stateBased2269911543670767533.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 759/759 places, 756/756 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 755
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 757 transition count 755
Applied a total of 4 rules in 37 ms. Remains 757 /759 variables (removed 2) and now considering 755/756 (removed 1) transitions.
// Phase 1: matrix 755 rows 757 cols
[2024-05-29 04:07:15] [INFO ] Computed 358 invariants in 6 ms
[2024-05-29 04:07:15] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-29 04:07:15] [INFO ] Invariant cache hit.
[2024-05-29 04:07:16] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-29 04:07:16] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 04:07:16] [INFO ] Invariant cache hit.
[2024-05-29 04:07:17] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 757/759 places, 755/756 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1815 ms. Remains : 757/759 places, 755/756 transitions.
Built C files in :
/tmp/ltsmin7896166242360501399
[2024-05-29 04:07:17] [INFO ] Computing symmetric may disable matrix : 755 transitions.
[2024-05-29 04:07:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:07:17] [INFO ] Computing symmetric may enable matrix : 755 transitions.
[2024-05-29 04:07:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:07:17] [INFO ] Computing Do-Not-Accords matrix : 755 transitions.
[2024-05-29 04:07:17] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:07:17] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7896166242360501399
Running compilation step : cd /tmp/ltsmin7896166242360501399;'/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 1954 ms.
Running link step : cd /tmp/ltsmin7896166242360501399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7896166242360501399;'/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/stateBased3797442241984823537.hoa' '--buchi-type=spotba'
LTSmin run took 12719 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-11 finished in 59738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 4 out of 2370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2361 transition count 2161
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2361 transition count 2161
Applied a total of 18 rules in 292 ms. Remains 2361 /2370 variables (removed 9) and now considering 2161/2170 (removed 9) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:07:32] [INFO ] Computed 361 invariants in 15 ms
[2024-05-29 04:07:33] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-29 04:07:33] [INFO ] Invariant cache hit.
[2024-05-29 04:07:35] [INFO ] Implicit Places using invariants and state equation in 2416 ms returned []
Implicit Place search using SMT with State Equation took 3229 ms to find 0 implicit places.
[2024-05-29 04:07:35] [INFO ] Invariant cache hit.
[2024-05-29 04:07:36] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2370 places, 2161/2170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4934 ms. Remains : 2361/2370 places, 2161/2170 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s788 0) (EQ s703 1) (EQ s1627 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 678 ms.
Product exploration explored 100000 steps with 25000 reset in 673 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 645 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=129 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 125 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
[2024-05-29 04:07:39] [INFO ] Invariant cache hit.
[2024-05-29 04:07:40] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-05-29 04:07:40] [INFO ] Invariant cache hit.
[2024-05-29 04:07:42] [INFO ] Implicit Places using invariants and state equation in 2385 ms returned []
Implicit Place search using SMT with State Equation took 3220 ms to find 0 implicit places.
[2024-05-29 04:07:42] [INFO ] Invariant cache hit.
[2024-05-29 04:07:43] [INFO ] Dead Transitions using invariants and state equation in 1408 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4754 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 533 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 718 ms.
Product exploration explored 100000 steps with 25000 reset in 724 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 2161
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 478 place count 2361 transition count 2282
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 639 place count 2361 transition count 2282
Performed 794 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1433 places in 2 ms
Iterating global reduction 1 with 794 rules applied. Total rules applied 1433 place count 2361 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1434 place count 2361 transition count 2281
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1753 place count 2042 transition count 1962
Deduced a syphon composed of 1114 places in 1 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 2072 place count 2042 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1115 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2073 place count 2042 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2075 place count 2040 transition count 1960
Deduced a syphon composed of 1113 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2077 place count 2040 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 1214 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2178 place count 2040 transition count 2490
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2279 place count 1939 transition count 2288
Deduced a syphon composed of 1113 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2380 place count 1939 transition count 2288
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -309
Deduced a syphon composed of 1171 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2438 place count 1939 transition count 2597
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2496 place count 1881 transition count 2481
Deduced a syphon composed of 1113 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2554 place count 1881 transition count 2481
Deduced a syphon composed of 1113 places in 3 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2563 place count 1881 transition count 2472
Deduced a syphon composed of 1113 places in 2 ms
Applied a total of 2563 rules in 844 ms. Remains 1881 /2361 variables (removed 480) and now considering 2472/2161 (removed -311) transitions.
[2024-05-29 04:07:48] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 2472 rows 1881 cols
[2024-05-29 04:07:48] [INFO ] Computed 361 invariants in 21 ms
[2024-05-29 04:07:50] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1881/2361 places, 2472/2161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2352 ms. Remains : 1881/2361 places, 2472/2161 transitions.
Built C files in :
/tmp/ltsmin1665323199588065635
[2024-05-29 04:07:50] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1665323199588065635
Running compilation step : cd /tmp/ltsmin1665323199588065635;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1665323199588065635;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1665323199588065635;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 129 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:07:53] [INFO ] Computed 361 invariants in 12 ms
[2024-05-29 04:07:54] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-29 04:07:54] [INFO ] Invariant cache hit.
[2024-05-29 04:07:56] [INFO ] Implicit Places using invariants and state equation in 2384 ms returned []
Implicit Place search using SMT with State Equation took 3211 ms to find 0 implicit places.
[2024-05-29 04:07:56] [INFO ] Invariant cache hit.
[2024-05-29 04:07:58] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4863 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Built C files in :
/tmp/ltsmin9715320381615800971
[2024-05-29 04:07:58] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9715320381615800971
Running compilation step : cd /tmp/ltsmin9715320381615800971;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9715320381615800971;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9715320381615800971;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 04:08:01] [INFO ] Flatten gal took : 43 ms
[2024-05-29 04:08:01] [INFO ] Flatten gal took : 43 ms
[2024-05-29 04:08:01] [INFO ] Time to serialize gal into /tmp/LTL15628677036491807590.gal : 8 ms
[2024-05-29 04:08:01] [INFO ] Time to serialize properties into /tmp/LTL14589911145128843982.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/LTL15628677036491807590.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3908203428004977040.hoa' '-atoms' '/tmp/LTL14589911145128843982.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/LTL14589911145128843982.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3908203428004977040.hoa
Detected timeout of ITS tools.
[2024-05-29 04:08:16] [INFO ] Flatten gal took : 39 ms
[2024-05-29 04:08:16] [INFO ] Flatten gal took : 39 ms
[2024-05-29 04:08:16] [INFO ] Time to serialize gal into /tmp/LTL16686588229242712797.gal : 8 ms
[2024-05-29 04:08:16] [INFO ] Time to serialize properties into /tmp/LTL17069033464364019902.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/LTL16686588229242712797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17069033464364019902.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((p928==0)||(p824==1))||((p1924==0)||(p9==1)))"))))))
Formula 0 simplified : XXXG!"(((p928==0)||(p824==1))||((p1924==0)||(p9==1)))"
Detected timeout of ITS tools.
[2024-05-29 04:08:31] [INFO ] Flatten gal took : 39 ms
[2024-05-29 04:08:31] [INFO ] Applying decomposition
[2024-05-29 04:08:31] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4808029190631168467.txt' '-o' '/tmp/graph4808029190631168467.bin' '-w' '/tmp/graph4808029190631168467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4808029190631168467.bin' '-l' '-1' '-v' '-w' '/tmp/graph4808029190631168467.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:08:31] [INFO ] Decomposing Gal with order
[2024-05-29 04:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:08:31] [INFO ] Removed a total of 396 redundant transitions.
[2024-05-29 04:08:31] [INFO ] Flatten gal took : 89 ms
[2024-05-29 04:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 04:08:31] [INFO ] Time to serialize gal into /tmp/LTL16233703927325000036.gal : 14 ms
[2024-05-29 04:08:31] [INFO ] Time to serialize properties into /tmp/LTL9674401453235020892.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/LTL16233703927325000036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9674401453235020892.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((i13.u292.p928==0)||(i12.u262.p824==1))||((i28.u609.p1924==0)||(i31.u4.p9==1)))"))))))
Formula 0 simplified : XXXG!"(((i13.u292.p928==0)||(i12.u262.p824==1))||((i28.u609.p1924==0)||(i31.u4.p9==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5655391697867290266
[2024-05-29 04:08:47] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5655391697867290266
Running compilation step : cd /tmp/ltsmin5655391697867290266;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5655391697867290266;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5655391697867290266;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-13 finished in 78086 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(!p1)||p0) U !p2)))'
Support contains 6 out of 2370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2362 transition count 2162
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2362 transition count 2162
Applied a total of 16 rules in 257 ms. Remains 2362 /2370 variables (removed 8) and now considering 2162/2170 (removed 8) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2024-05-29 04:08:50] [INFO ] Computed 361 invariants in 12 ms
[2024-05-29 04:08:51] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-29 04:08:51] [INFO ] Invariant cache hit.
[2024-05-29 04:08:53] [INFO ] Implicit Places using invariants and state equation in 2396 ms returned []
Implicit Place search using SMT with State Equation took 3224 ms to find 0 implicit places.
[2024-05-29 04:08:53] [INFO ] Invariant cache hit.
[2024-05-29 04:08:55] [INFO ] Dead Transitions using invariants and state equation in 1507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2370 places, 2162/2170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4989 ms. Remains : 2362/2370 places, 2162/2170 transitions.
Stuttering acceptance computed with spot in 174 ms :[p2, p2, true, p1]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 p0) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s484 0) (EQ s2026 1)), p0:(OR (EQ s331 0) (EQ s674 1)), p1:(OR (EQ s730 0) (EQ s2102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 702 ms.
Stack based approach found an accepted trace after 2737 steps with 0 reset with depth 2738 and stack size 2738 in 32 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-14 finished in 5925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p1))&&G(p2)&&p0)))'
Support contains 4 out of 2370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2364 transition count 2164
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2364 transition count 2164
Applied a total of 12 rules in 259 ms. Remains 2364 /2370 variables (removed 6) and now considering 2164/2170 (removed 6) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2024-05-29 04:08:56] [INFO ] Computed 361 invariants in 11 ms
[2024-05-29 04:08:57] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-29 04:08:57] [INFO ] Invariant cache hit.
[2024-05-29 04:08:59] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned []
Implicit Place search using SMT with State Equation took 3083 ms to find 0 implicit places.
[2024-05-29 04:08:59] [INFO ] Invariant cache hit.
[2024-05-29 04:09:00] [INFO ] Dead Transitions using invariants and state equation in 1542 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2364/2370 places, 2164/2170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4885 ms. Remains : 2364/2370 places, 2164/2170 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (OR (EQ s2049 0) (EQ s624 1)) (OR (EQ s1293 0) (EQ s385 1))), p2:(OR (EQ s1293 0) (EQ s385 1)), p1:(OR (EQ s2049 0) (EQ s624 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 707 ms.
Product exploration explored 100000 steps with 0 reset in 869 ms.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2364 stabilizing places and 639/2164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:09:03] [INFO ] Invariant cache hit.
[2024-05-29 04:09:03] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:09:03] [INFO ] [Nat]Absence check using 361 positive place invariants in 127 ms returned sat
[2024-05-29 04:09:04] [INFO ] After 1005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:09:05] [INFO ] Deduced a trap composed of 24 places in 476 ms of which 2 ms to minimize.
[2024-05-29 04:09:06] [INFO ] Deduced a trap composed of 20 places in 531 ms of which 2 ms to minimize.
[2024-05-29 04:09:06] [INFO ] Deduced a trap composed of 21 places in 527 ms of which 2 ms to minimize.
[2024-05-29 04:09:07] [INFO ] Deduced a trap composed of 21 places in 520 ms of which 2 ms to minimize.
[2024-05-29 04:09:07] [INFO ] Deduced a trap composed of 29 places in 522 ms of which 2 ms to minimize.
[2024-05-29 04:09:08] [INFO ] Deduced a trap composed of 27 places in 514 ms of which 2 ms to minimize.
[2024-05-29 04:09:09] [INFO ] Deduced a trap composed of 29 places in 506 ms of which 1 ms to minimize.
[2024-05-29 04:09:09] [INFO ] Deduced a trap composed of 22 places in 444 ms of which 1 ms to minimize.
[2024-05-29 04:09:10] [INFO ] Deduced a trap composed of 25 places in 469 ms of which 1 ms to minimize.
[2024-05-29 04:09:10] [INFO ] Deduced a trap composed of 23 places in 451 ms of which 2 ms to minimize.
[2024-05-29 04:09:11] [INFO ] Deduced a trap composed of 19 places in 462 ms of which 1 ms to minimize.
[2024-05-29 04:09:11] [INFO ] Deduced a trap composed of 17 places in 439 ms of which 2 ms to minimize.
[2024-05-29 04:09:12] [INFO ] Deduced a trap composed of 23 places in 491 ms of which 2 ms to minimize.
[2024-05-29 04:09:12] [INFO ] Deduced a trap composed of 20 places in 428 ms of which 1 ms to minimize.
[2024-05-29 04:09:13] [INFO ] Deduced a trap composed of 33 places in 415 ms of which 1 ms to minimize.
[2024-05-29 04:09:13] [INFO ] Deduced a trap composed of 32 places in 408 ms of which 1 ms to minimize.
[2024-05-29 04:09:14] [INFO ] Deduced a trap composed of 28 places in 413 ms of which 1 ms to minimize.
[2024-05-29 04:09:14] [INFO ] Deduced a trap composed of 37 places in 404 ms of which 1 ms to minimize.
[2024-05-29 04:09:15] [INFO ] Deduced a trap composed of 37 places in 404 ms of which 1 ms to minimize.
[2024-05-29 04:09:15] [INFO ] Deduced a trap composed of 34 places in 380 ms of which 1 ms to minimize.
[2024-05-29 04:09:16] [INFO ] Deduced a trap composed of 27 places in 385 ms of which 2 ms to minimize.
[2024-05-29 04:09:16] [INFO ] Deduced a trap composed of 33 places in 379 ms of which 1 ms to minimize.
[2024-05-29 04:09:16] [INFO ] Deduced a trap composed of 28 places in 373 ms of which 1 ms to minimize.
[2024-05-29 04:09:17] [INFO ] Deduced a trap composed of 44 places in 372 ms of which 1 ms to minimize.
[2024-05-29 04:09:17] [INFO ] Deduced a trap composed of 37 places in 361 ms of which 1 ms to minimize.
[2024-05-29 04:09:18] [INFO ] Deduced a trap composed of 20 places in 356 ms of which 2 ms to minimize.
[2024-05-29 04:09:18] [INFO ] Deduced a trap composed of 40 places in 369 ms of which 1 ms to minimize.
[2024-05-29 04:09:19] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 1 ms to minimize.
[2024-05-29 04:09:19] [INFO ] Deduced a trap composed of 36 places in 348 ms of which 1 ms to minimize.
[2024-05-29 04:09:19] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 1 ms to minimize.
[2024-05-29 04:09:20] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 1 ms to minimize.
[2024-05-29 04:09:20] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 1 ms to minimize.
[2024-05-29 04:09:21] [INFO ] Deduced a trap composed of 41 places in 336 ms of which 0 ms to minimize.
[2024-05-29 04:09:21] [INFO ] Deduced a trap composed of 37 places in 319 ms of which 0 ms to minimize.
[2024-05-29 04:09:21] [INFO ] Deduced a trap composed of 35 places in 329 ms of which 1 ms to minimize.
[2024-05-29 04:09:22] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 1 ms to minimize.
[2024-05-29 04:09:22] [INFO ] Deduced a trap composed of 40 places in 329 ms of which 1 ms to minimize.
[2024-05-29 04:09:23] [INFO ] Deduced a trap composed of 38 places in 325 ms of which 1 ms to minimize.
[2024-05-29 04:09:23] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 1 ms to minimize.
[2024-05-29 04:09:23] [INFO ] Deduced a trap composed of 34 places in 296 ms of which 1 ms to minimize.
[2024-05-29 04:09:24] [INFO ] Deduced a trap composed of 35 places in 285 ms of which 1 ms to minimize.
[2024-05-29 04:09:24] [INFO ] Deduced a trap composed of 49 places in 306 ms of which 1 ms to minimize.
[2024-05-29 04:09:25] [INFO ] Deduced a trap composed of 37 places in 292 ms of which 1 ms to minimize.
[2024-05-29 04:09:25] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 1 ms to minimize.
[2024-05-29 04:09:25] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 1 ms to minimize.
[2024-05-29 04:09:26] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 1 ms to minimize.
[2024-05-29 04:09:26] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 1 ms to minimize.
[2024-05-29 04:09:26] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 1 ms to minimize.
[2024-05-29 04:09:27] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 1 ms to minimize.
[2024-05-29 04:09:27] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 2 ms to minimize.
[2024-05-29 04:09:27] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 1 ms to minimize.
[2024-05-29 04:09:27] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 2 ms to minimize.
[2024-05-29 04:09:28] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 1 ms to minimize.
[2024-05-29 04:09:28] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:09:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:09:28] [INFO ] After 25106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1885 transition count 1366
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1566 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1597 place count 1565 transition count 1365
Iterating global reduction 2 with 1 rules applied. Total rules applied 1598 place count 1565 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1598 place count 1565 transition count 1364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1600 place count 1564 transition count 1364
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2962 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 883 transition count 682
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2965 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3167 place count 781 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3201 place count 764 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3202 place count 764 transition count 756
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3203 place count 764 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3204 place count 763 transition count 755
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3244 place count 763 transition count 755
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3245 place count 762 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3247 place count 760 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3247 place count 760 transition count 753
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3249 place count 759 transition count 753
Applied a total of 3249 rules in 333 ms. Remains 759 /2364 variables (removed 1605) and now considering 753/2164 (removed 1411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 759/2364 places, 753/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 242183 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242183 steps, saw 154612 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2024-05-29 04:09:32] [INFO ] Computed 359 invariants in 3 ms
[2024-05-29 04:09:32] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:09:32] [INFO ] [Nat]Absence check using 359 positive place invariants in 52 ms returned sat
[2024-05-29 04:09:32] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:09:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:09:32] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:09:32] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 04:09:32] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 622 steps, including 199 resets, run visited all 1 properties in 5 ms. (steps per millisecond=124 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1))), (F (OR (NOT p2) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-15 finished in 36959 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((G(p0) U p1)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040B-LTLCardinality-00
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 4 out of 2370 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2369 transition count 1690
Reduce places removed 479 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 480 rules applied. Total rules applied 959 place count 1890 transition count 1689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 960 place count 1889 transition count 1689
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 314 Pre rules applied. Total rules applied 960 place count 1889 transition count 1375
Deduced a syphon composed of 314 places in 2 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1588 place count 1575 transition count 1375
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1594 place count 1569 transition count 1369
Iterating global reduction 3 with 6 rules applied. Total rules applied 1600 place count 1569 transition count 1369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1600 place count 1569 transition count 1363
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1612 place count 1563 transition count 1363
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 0 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 2960 place count 889 transition count 689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2961 place count 889 transition count 688
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2963 place count 888 transition count 687
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3165 place count 787 transition count 753
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3201 place count 769 transition count 766
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3203 place count 767 transition count 764
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3205 place count 765 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3205 place count 765 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3207 place count 764 transition count 763
Applied a total of 3207 rules in 354 ms. Remains 764 /2370 variables (removed 1606) and now considering 763/2170 (removed 1407) transitions.
// Phase 1: matrix 763 rows 764 cols
[2024-05-29 04:09:33] [INFO ] Computed 359 invariants in 4 ms
[2024-05-29 04:09:34] [INFO ] Implicit Places using invariants in 428 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 763/2370 places, 763/2170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 762
Applied a total of 2 rules in 24 ms. Remains 762 /763 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 762 cols
[2024-05-29 04:09:34] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:09:34] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-29 04:09:34] [INFO ] Invariant cache hit.
[2024-05-29 04:09:34] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:09:36] [INFO ] Implicit Places using invariants and state equation in 2291 ms returned []
Implicit Place search using SMT with State Equation took 2742 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 762/2370 places, 762/2170 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3566 ms. Remains : 762/2370 places, 762/2170 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s95 0) (EQ s192 1)), p0:(AND (NOT (OR (EQ s95 0) (EQ s192 1))) (NOT (OR (EQ s312 0) (EQ s1 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 620 ms.
Product exploration explored 100000 steps with 0 reset in 824 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 161467 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161467 steps, saw 98027 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:09:42] [INFO ] Invariant cache hit.
[2024-05-29 04:09:42] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:09:42] [INFO ] [Nat]Absence check using 358 positive place invariants in 58 ms returned sat
[2024-05-29 04:09:42] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:09:42] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:09:49] [INFO ] After 6415ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:09:51] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 04:09:51] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-29 04:09:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2024-05-29 04:09:52] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 04:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 632 ms
[2024-05-29 04:10:05] [INFO ] After 22818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1526 ms.
[2024-05-29 04:10:07] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 185 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 762/762 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 762 transition count 761
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 21 place count 762 transition count 761
Applied a total of 21 rules in 33 ms. Remains 762 /762 variables (removed 0) and now considering 761/762 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 762/762 places, 761/762 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 164999 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 164999 steps, saw 100258 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:10:10] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:10:10] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:10:11] [INFO ] [Nat]Absence check using 358 positive place invariants in 54 ms returned sat
[2024-05-29 04:10:11] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:10:11] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:10:15] [INFO ] After 3771ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:10:16] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:10:17] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-29 04:10:17] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:10:17] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:10:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 04:10:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 605 ms
[2024-05-29 04:10:18] [INFO ] After 6601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1443 ms.
[2024-05-29 04:10:19] [INFO ] After 8613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 89 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 762/762 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 761/761 transitions.
Applied a total of 0 rules in 12 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 04:10:19] [INFO ] Invariant cache hit.
[2024-05-29 04:10:20] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-29 04:10:20] [INFO ] Invariant cache hit.
[2024-05-29 04:10:20] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:10:22] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
[2024-05-29 04:10:22] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 04:10:22] [INFO ] Invariant cache hit.
[2024-05-29 04:10:22] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3147 ms. Remains : 762/762 places, 761/761 transitions.
Partial Free-agglomeration rule applied 139 times.
Drop transitions removed 139 transitions
Iterating global reduction 0 with 139 rules applied. Total rules applied 139 place count 762 transition count 761
Applied a total of 139 rules in 27 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:10:22] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:10:22] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:10:23] [INFO ] [Nat]Absence check using 358 positive place invariants in 54 ms returned sat
[2024-05-29 04:10:23] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:10:23] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:10:23] [INFO ] After 158ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:10:23] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:10:23] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 04:10:23] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:10:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2024-05-29 04:10:23] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2024-05-29 04:10:24] [INFO ] After 1162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 762/762 places, 762/762 transitions.
Applied a total of 0 rules in 8 ms. Remains 762 /762 variables (removed 0) and now considering 762/762 (removed 0) transitions.
// Phase 1: matrix 762 rows 762 cols
[2024-05-29 04:10:24] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:10:25] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-29 04:10:25] [INFO ] Invariant cache hit.
[2024-05-29 04:10:25] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:10:27] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 2625 ms to find 0 implicit places.
[2024-05-29 04:10:27] [INFO ] Invariant cache hit.
[2024-05-29 04:10:27] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3030 ms. Remains : 762/762 places, 762/762 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 130999 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130999 steps, saw 79689 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:10:31] [INFO ] Invariant cache hit.
[2024-05-29 04:10:31] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:10:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 56 ms returned sat
[2024-05-29 04:10:32] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:10:32] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:10:38] [INFO ] After 6669ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:10:40] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:10:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-29 04:10:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 595 ms
[2024-05-29 04:10:42] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 630 ms
[2024-05-29 04:10:55] [INFO ] After 23636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 705 ms.
[2024-05-29 04:10:56] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 164 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 762/762 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 762 transition count 761
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 21 place count 762 transition count 761
Applied a total of 21 rules in 25 ms. Remains 762 /762 variables (removed 0) and now considering 761/762 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 762/762 places, 761/762 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 164143 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 164143 steps, saw 99699 distinct states, run finished after 3005 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:11:00] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:11:00] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:11:00] [INFO ] [Nat]Absence check using 358 positive place invariants in 58 ms returned sat
[2024-05-29 04:11:00] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:11:00] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:11:04] [INFO ] After 3670ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:11:06] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-29 04:11:06] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-29 04:11:06] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 04:11:06] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-29 04:11:06] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 04:11:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 686 ms
[2024-05-29 04:11:07] [INFO ] After 6528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1445 ms.
[2024-05-29 04:11:08] [INFO ] After 8543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 88 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 761/761 transitions.
Applied a total of 0 rules in 12 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 762/762 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 761/761 transitions.
Applied a total of 0 rules in 12 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 04:11:08] [INFO ] Invariant cache hit.
[2024-05-29 04:11:09] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-29 04:11:09] [INFO ] Invariant cache hit.
[2024-05-29 04:11:09] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:11:11] [INFO ] Implicit Places using invariants and state equation in 2149 ms returned []
Implicit Place search using SMT with State Equation took 2590 ms to find 0 implicit places.
[2024-05-29 04:11:11] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 04:11:11] [INFO ] Invariant cache hit.
[2024-05-29 04:11:11] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3042 ms. Remains : 762/762 places, 761/761 transitions.
Partial Free-agglomeration rule applied 139 times.
Drop transitions removed 139 transitions
Iterating global reduction 0 with 139 rules applied. Total rules applied 139 place count 762 transition count 761
Applied a total of 139 rules in 23 ms. Remains 762 /762 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:11:11] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:11:12] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:11:12] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2024-05-29 04:11:12] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:11:12] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:11:12] [INFO ] After 157ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:11:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:11:12] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:11:13] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-29 04:11:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 249 ms
[2024-05-29 04:11:13] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-29 04:11:13] [INFO ] After 1172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 641 ms.
Product exploration explored 100000 steps with 0 reset in 887 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 762/762 places, 762/762 transitions.
Applied a total of 0 rules in 17 ms. Remains 762 /762 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 04:11:15] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 762 rows 762 cols
[2024-05-29 04:11:15] [INFO ] Computed 358 invariants in 1 ms
[2024-05-29 04:11:16] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 762/762 places, 762/762 transitions.
Built C files in :
/tmp/ltsmin6306623953409434754
[2024-05-29 04:11:16] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6306623953409434754
Running compilation step : cd /tmp/ltsmin6306623953409434754;'/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 1440 ms.
Running link step : cd /tmp/ltsmin6306623953409434754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6306623953409434754;'/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/stateBased6539194347683561308.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 762/762 places, 762/762 transitions.
Applied a total of 0 rules in 8 ms. Remains 762 /762 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 04:11:31] [INFO ] Invariant cache hit.
[2024-05-29 04:11:31] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-29 04:11:31] [INFO ] Invariant cache hit.
[2024-05-29 04:11:32] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 04:11:34] [INFO ] Implicit Places using invariants and state equation in 2292 ms returned []
Implicit Place search using SMT with State Equation took 2771 ms to find 0 implicit places.
[2024-05-29 04:11:34] [INFO ] Invariant cache hit.
[2024-05-29 04:11:34] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3182 ms. Remains : 762/762 places, 762/762 transitions.
Built C files in :
/tmp/ltsmin9748438453616850989
[2024-05-29 04:11:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9748438453616850989
Running compilation step : cd /tmp/ltsmin9748438453616850989;'/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 1395 ms.
Running link step : cd /tmp/ltsmin9748438453616850989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9748438453616850989;'/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/stateBased6482120155104745742.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:11:49] [INFO ] Flatten gal took : 19 ms
[2024-05-29 04:11:49] [INFO ] Flatten gal took : 20 ms
[2024-05-29 04:11:49] [INFO ] Time to serialize gal into /tmp/LTL134893414066716239.gal : 4 ms
[2024-05-29 04:11:49] [INFO ] Time to serialize properties into /tmp/LTL4418436920140678431.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL134893414066716239.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12042504785137478659.hoa' '-atoms' '/tmp/LTL4418436920140678431.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4418436920140678431.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12042504785137478659.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t40, t41, t160, t483, t488, t493, t498, t504, t509, t...850
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:12:04] [INFO ] Flatten gal took : 20 ms
[2024-05-29 04:12:04] [INFO ] Flatten gal took : 21 ms
[2024-05-29 04:12:04] [INFO ] Time to serialize gal into /tmp/LTL2497741610383708713.gal : 5 ms
[2024-05-29 04:12:04] [INFO ] Time to serialize properties into /tmp/LTL2666326367121591664.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/LTL2497741610383708713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2666326367121591664.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G("((!((p361==0)||(p710==1)))&&(!((p1154==0)||(p21==1))))"))U("((p361==0)||(p710==1))"))))))
Formula 0 simplified : XXF(F!"((!((p361==0)||(p710==1)))&&(!((p1154==0)||(p21==1))))" R !"((p361==0)||(p710==1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t40, t41, t160, t483, t488, t493, t498, t504, t509, t...850
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:12:20] [INFO ] Flatten gal took : 45 ms
[2024-05-29 04:12:20] [INFO ] Applying decomposition
[2024-05-29 04:12:20] [INFO ] Flatten gal took : 29 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/graph15686133703697023805.txt' '-o' '/tmp/graph15686133703697023805.bin' '-w' '/tmp/graph15686133703697023805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15686133703697023805.bin' '-l' '-1' '-v' '-w' '/tmp/graph15686133703697023805.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:12:20] [INFO ] Decomposing Gal with order
[2024-05-29 04:12:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:12:20] [INFO ] Removed a total of 868 redundant transitions.
[2024-05-29 04:12:20] [INFO ] Flatten gal took : 43 ms
[2024-05-29 04:12:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 40 ms.
[2024-05-29 04:12:20] [INFO ] Time to serialize gal into /tmp/LTL4990836703139909609.gal : 10 ms
[2024-05-29 04:12:20] [INFO ] Time to serialize properties into /tmp/LTL9280123593330443035.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/LTL4990836703139909609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9280123593330443035.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G("((!((i3.u39.p361==0)||(i6.u80.p710==1)))&&(!((i10.u130.p1154==0)||(i12.u155.p21==1))))"))U("((i3.u39.p361==0)||(i6.u80.p7...169
Formula 0 simplified : XXF(F!"((!((i3.u39.p361==0)||(i6.u80.p710==1)))&&(!((i10.u130.p1154==0)||(i12.u155.p21==1))))" R !"((i3.u39.p361==0)||(i6.u80.p710==...160
Reverse transition relation is NOT exact ! Due to transitions t578, i0.t481_t165_t167, i0.t480_t162_t167, i0.t0, i0.u1.t483, i1.i0.t1, i1.i0.t486_t173_t176...964
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8222551231040509108
[2024-05-29 04:12:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8222551231040509108
Running compilation step : cd /tmp/ltsmin8222551231040509108;'/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 1354 ms.
Running link step : cd /tmp/ltsmin8222551231040509108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin8222551231040509108;'/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(X([](([]((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-00 finished in 197712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ShieldIIPt-PT-040B-LTLCardinality-13
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 2370 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2370/2370 places, 2170/2170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2369 transition count 1690
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1890 transition count 1690
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 958 place count 1890 transition count 1375
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1588 place count 1575 transition count 1375
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1594 place count 1569 transition count 1369
Iterating global reduction 2 with 6 rules applied. Total rules applied 1600 place count 1569 transition count 1369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1600 place count 1569 transition count 1363
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1612 place count 1563 transition count 1363
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 1 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 2 with 1348 rules applied. Total rules applied 2960 place count 889 transition count 689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2961 place count 889 transition count 688
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2963 place count 888 transition count 687
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3165 place count 787 transition count 753
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3201 place count 769 transition count 766
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3203 place count 767 transition count 764
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3205 place count 765 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3205 place count 765 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3207 place count 764 transition count 763
Applied a total of 3207 rules in 328 ms. Remains 764 /2370 variables (removed 1606) and now considering 763/2170 (removed 1407) transitions.
// Phase 1: matrix 763 rows 764 cols
[2024-05-29 04:12:51] [INFO ] Computed 359 invariants in 5 ms
[2024-05-29 04:12:51] [INFO ] Implicit Places using invariants in 434 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 437 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 763/2370 places, 763/2170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 762
Applied a total of 2 rules in 22 ms. Remains 762 /763 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 762 cols
[2024-05-29 04:12:51] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:12:52] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-29 04:12:52] [INFO ] Invariant cache hit.
[2024-05-29 04:12:52] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 04:12:55] [INFO ] Implicit Places using invariants and state equation in 2912 ms returned []
Implicit Place search using SMT with State Equation took 3407 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 762/2370 places, 762/2170 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4195 ms. Remains : 762/2370 places, 762/2170 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s251 0) (EQ s223 1) (EQ s528 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 854 ms.
Product exploration explored 100000 steps with 25000 reset in 836 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 762/762 places, 762/762 transitions.
Applied a total of 0 rules in 11 ms. Remains 762 /762 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 04:12:57] [INFO ] Invariant cache hit.
[2024-05-29 04:12:57] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-29 04:12:57] [INFO ] Invariant cache hit.
[2024-05-29 04:12:58] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 04:13:01] [INFO ] Implicit Places using invariants and state equation in 3077 ms returned []
Implicit Place search using SMT with State Equation took 3563 ms to find 0 implicit places.
[2024-05-29 04:13:01] [INFO ] Invariant cache hit.
[2024-05-29 04:13:01] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3997 ms. Remains : 762/762 places, 762/762 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 760 ms.
Product exploration explored 100000 steps with 25000 reset in 814 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 762/762 places, 762/762 transitions.
Applied a total of 0 rules in 18 ms. Remains 762 /762 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 04:13:04] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 04:13:04] [INFO ] Invariant cache hit.
[2024-05-29 04:13:04] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 762/762 places, 762/762 transitions.
Built C files in :
/tmp/ltsmin17996148621353152103
[2024-05-29 04:13:04] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17996148621353152103
Running compilation step : cd /tmp/ltsmin17996148621353152103;'/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 1397 ms.
Running link step : cd /tmp/ltsmin17996148621353152103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17996148621353152103;'/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/stateBased16333138627255623049.hoa' '--buchi-type=spotba'
LTSmin run took 357 ms.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-13 finished in 15625 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-13 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-29 04:13:06] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9857559488430749141
[2024-05-29 04:13:06] [INFO ] Too many transitions (2170) to apply POR reductions. Disabling POR matrices.
[2024-05-29 04:13:06] [INFO ] Applying decomposition
[2024-05-29 04:13:06] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9857559488430749141
Running compilation step : cd /tmp/ltsmin9857559488430749141;'/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'
[2024-05-29 04:13:06] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9550245154020732102.txt' '-o' '/tmp/graph9550245154020732102.bin' '-w' '/tmp/graph9550245154020732102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9550245154020732102.bin' '-l' '-1' '-v' '-w' '/tmp/graph9550245154020732102.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:13:06] [INFO ] Decomposing Gal with order
[2024-05-29 04:13:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:13:06] [INFO ] Removed a total of 393 redundant transitions.
[2024-05-29 04:13:07] [INFO ] Flatten gal took : 150 ms
[2024-05-29 04:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-29 04:13:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality9572740448877908795.gal : 35 ms
[2024-05-29 04:13:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality4400058653618698443.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/LTLCardinality9572740448877908795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4400058653618698443.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 : !((X(X(G((G("((!((i4.u119.p361==0)||(i9.u233.p710==1)))&&(!((i16.u370.p1154==0)||(i17.u10.p21==1))))"))U("((i4.u119.p361==0)||(i9.u233...172
Formula 0 simplified : XXF(F!"((!((i4.u119.p361==0)||(i9.u233.p710==1)))&&(!((i16.u370.p1154==0)||(i17.u10.p21==1))))" R !"((i4.u119.p361==0)||(i9.u233.p71...163
Compilation finished in 4494 ms.
Running link step : cd /tmp/ltsmin9857559488430749141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9857559488430749141;'/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(X([](([]((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 04:38:07] [INFO ] Applying decomposition
[2024-05-29 04:38:07] [INFO ] Flatten gal took : 451 ms
[2024-05-29 04:38:08] [INFO ] Decomposing Gal with order
[2024-05-29 04:38:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:38:10] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-29 04:38:10] [INFO ] Flatten gal took : 495 ms
[2024-05-29 04:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2024-05-29 04:38:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality14315688369523975598.gal : 103 ms
[2024-05-29 04:38:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality3698585812617972247.ltl : 12 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/LTLCardinality14315688369523975598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3698585812617972247.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 : !((X(X(G((G("((!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u1...726
Formula 0 simplified : XXF(F!"((!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u123.p...717
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: LTL layer: formula: X(X([](([]((LTLAPp0==true)) U (LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.016: "X(X([](([]((LTLAPp0==true)) U (LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.017: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.390: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 3.318: DFS-FIFO for weak LTL, using special progress label 2174
pins2lts-mc-linux64( 0/ 8), 3.318: There are 2175 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.318: State length is 2371, there are 2183 groups
pins2lts-mc-linux64( 0/ 8), 3.318: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.318: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.318: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 3.318: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 4.435: ~1 levels ~960 states ~5952 transitions
pins2lts-mc-linux64( 5/ 8), 5.002: ~1 levels ~1920 states ~12912 transitions
pins2lts-mc-linux64( 5/ 8), 6.705: ~1 levels ~3840 states ~27848 transitions
pins2lts-mc-linux64( 3/ 8), 9.236: ~1 levels ~7680 states ~61200 transitions
pins2lts-mc-linux64( 3/ 8), 14.867: ~1 levels ~15360 states ~130176 transitions
pins2lts-mc-linux64( 3/ 8), 27.177: ~1 levels ~30720 states ~268376 transitions
pins2lts-mc-linux64( 1/ 8), 54.986: ~1 levels ~61440 states ~540320 transitions
pins2lts-mc-linux64( 3/ 8), 91.324: ~1 levels ~122880 states ~1165256 transitions
pins2lts-mc-linux64( 3/ 8), 165.458: ~1 levels ~245760 states ~2492424 transitions
pins2lts-mc-linux64( 1/ 8), 275.794: ~1 levels ~491520 states ~5225320 transitions
pins2lts-mc-linux64( 3/ 8), 402.994: ~1 levels ~983040 states ~10716064 transitions
pins2lts-mc-linux64( 3/ 8), 605.076: ~1 levels ~1966080 states ~23319688 transitions
pins2lts-mc-linux64( 3/ 8), 1154.885: ~1 levels ~3932160 states ~46439336 transitions
pins2lts-mc-linux64( 2/ 8), 1949.563: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1949.688:
pins2lts-mc-linux64( 0/ 8), 1949.688: mean standard work distribution: 10.3% (states) 11.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1949.688:
pins2lts-mc-linux64( 0/ 8), 1949.688: Explored 6092290 states 75741999 transitions, fanout: 12.432
pins2lts-mc-linux64( 0/ 8), 1949.688: Total exploration time 1946.350 sec (1946.250 sec minimum, 1946.289 sec on average)
pins2lts-mc-linux64( 0/ 8), 1949.688: States per second: 3130, Transitions per second: 38915
pins2lts-mc-linux64( 0/ 8), 1949.688:
pins2lts-mc-linux64( 0/ 8), 1949.688: Progress states detected: 14941630
pins2lts-mc-linux64( 0/ 8), 1949.688: Redundant explorations: -59.2263
pins2lts-mc-linux64( 0/ 8), 1949.688:
pins2lts-mc-linux64( 0/ 8), 1949.688: Queue width: 8B, total height: 14209783, memory: 108.41MB
pins2lts-mc-linux64( 0/ 8), 1949.688: Tree memory: 370.0MB, 26.0 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1949.688: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1949.743: Stored 2270 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1949.787: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1949.800: Est. total memory use: 478.4MB (~1132.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9857559488430749141;'/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(X([](([]((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9857559488430749141;'/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(X([](([]((LTLAPp0==true)) U (LTLAPp1==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)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 163620 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14877952 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldIIPt-PT-040B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788700197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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