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.r263-tall-171654372000088.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 MultiCrashLeafsetExtension-PT-S24C12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372000088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20M 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 MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716652273011

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:51:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:51:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:51:15] [INFO ] Load time of PNML (sax parser for PT used): 638 ms
[2024-05-25 15:51:15] [INFO ] Transformed 20612 places.
[2024-05-25 15:51:15] [INFO ] Transformed 29875 transitions.
[2024-05-25 15:51:15] [INFO ] Parsed PT model containing 20612 places and 29875 transitions and 109334 arcs in 822 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 20612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20612/20612 places, 29875/29875 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 20560 transition count 29875
Applied a total of 52 rules in 872 ms. Remains 20560 /20612 variables (removed 52) and now considering 29875/29875 (removed 0) transitions.
[2024-05-25 15:51:16] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2024-05-25 15:51:19] [INFO ] Computed 1301 invariants in 2841 ms
[2024-05-25 15:51:21] [INFO ] Implicit Places using invariants in 4798 ms returned []
Implicit Place search using SMT only with invariants took 4945 ms to find 0 implicit places.
[2024-05-25 15:51:21] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2024-05-25 15:51:21] [INFO ] Invariant cache hit.
[2024-05-25 15:51:23] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20560/20612 places, 29875/29875 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7653 ms. Remains : 20560/20612 places, 29875/29875 transitions.
Support contains 62 out of 20560 places after structural reductions.
[2024-05-25 15:51:24] [INFO ] Flatten gal took : 1096 ms
[2024-05-25 15:51:25] [INFO ] Flatten gal took : 782 ms
[2024-05-25 15:51:27] [INFO ] Input system was already deterministic with 29875 transitions.
Support contains 61 out of 20560 places (down from 62) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 804 ms. (steps per millisecond=12 ) properties (out of 34) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2024-05-25 15:51:28] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2024-05-25 15:51:28] [INFO ] Invariant cache hit.
[2024-05-25 15:51:37] [INFO ] [Real]Absence check using 47 positive place invariants in 288 ms returned sat
[2024-05-25 15:51:38] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 974 ms returned sat
[2024-05-25 15:51:45] [INFO ] After 16459ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:25
[2024-05-25 15:51:53] [INFO ] [Nat]Absence check using 47 positive place invariants in 262 ms returned sat
[2024-05-25 15:51:54] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 916 ms returned sat
[2024-05-25 15:52:10] [INFO ] After 9608ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :24
[2024-05-25 15:52:10] [INFO ] State equation strengthened by 9202 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
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-25 15:52:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:52:10] [INFO ] After 25145ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:25
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 44 out of 20560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7122 transitions
Trivial Post-agglo rules discarded 7122 transitions
Performed 7122 trivial Post agglomeration. Transition count delta: 7122
Iterating post reduction 0 with 7122 rules applied. Total rules applied 7122 place count 20560 transition count 22753
Reduce places removed 7122 places and 0 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Iterating post reduction 1 with 7194 rules applied. Total rules applied 14316 place count 13438 transition count 22681
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 14388 place count 13366 transition count 22681
Performed 594 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 594 Pre rules applied. Total rules applied 14388 place count 13366 transition count 22087
Deduced a syphon composed of 594 places in 26 ms
Reduce places removed 594 places and 0 transitions.
Iterating global reduction 3 with 1188 rules applied. Total rules applied 15576 place count 12772 transition count 22087
Discarding 6588 places :
Symmetric choice reduction at 3 with 6588 rule applications. Total rules 22164 place count 6184 transition count 15499
Iterating global reduction 3 with 6588 rules applied. Total rules applied 28752 place count 6184 transition count 15499
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 28752 place count 6184 transition count 15486
Deduced a syphon composed of 13 places in 19 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 28778 place count 6171 transition count 15486
Discarding 534 places :
Symmetric choice reduction at 3 with 534 rule applications. Total rules 29312 place count 5637 transition count 9078
Iterating global reduction 3 with 534 rules applied. Total rules applied 29846 place count 5637 transition count 9078
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 29894 place count 5613 transition count 9054
Free-agglomeration rule (complex) applied 343 times.
Iterating global reduction 3 with 343 rules applied. Total rules applied 30237 place count 5613 transition count 14585
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 3 with 343 rules applied. Total rules applied 30580 place count 5270 transition count 14585
Partial Free-agglomeration rule applied 269 times.
Drop transitions removed 269 transitions
Iterating global reduction 4 with 269 rules applied. Total rules applied 30849 place count 5270 transition count 14585
Applied a total of 30849 rules in 6978 ms. Remains 5270 /20560 variables (removed 15290) and now considering 14585/29875 (removed 15290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6982 ms. Remains : 5270/20560 places, 14585/29875 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 833 ms. (steps per millisecond=12 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 21440 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{2=1}
Probabilistic random walk after 21440 steps, saw 10099 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :1
Running SMT prover for 23 properties.
[2024-05-25 15:52:21] [INFO ] Flow matrix only has 13704 transitions (discarded 881 similar events)
// Phase 1: matrix 13704 rows 5270 cols
[2024-05-25 15:52:21] [INFO ] Computed 1301 invariants in 388 ms
[2024-05-25 15:52:23] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 15:52:24] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 336 ms returned sat
[2024-05-25 15:52:26] [INFO ] After 4100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-25 15:52:27] [INFO ] [Nat]Absence check using 49 positive place invariants in 86 ms returned sat
[2024-05-25 15:52:28] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 357 ms returned sat
[2024-05-25 15:52:51] [INFO ] After 21024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-25 15:52:51] [INFO ] State equation strengthened by 9202 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
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-25 15:52:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:52:51] [INFO ] After 25168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 140 ms.
Support contains 41 out of 5270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5270/5270 places, 14585/14585 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 5270 transition count 14584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5269 transition count 14584
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 5269 transition count 14582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 5267 transition count 14582
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 5266 transition count 14581
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 5266 transition count 14581
Applied a total of 8 rules in 2215 ms. Remains 5266 /5270 variables (removed 4) and now considering 14581/14585 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2215 ms. Remains : 5266/5270 places, 14581/14585 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 815 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 21082 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21082 steps, saw 9922 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 23 properties.
[2024-05-25 15:52:57] [INFO ] Flow matrix only has 13700 transitions (discarded 881 similar events)
// Phase 1: matrix 13700 rows 5266 cols
[2024-05-25 15:52:58] [INFO ] Computed 1301 invariants in 400 ms
[2024-05-25 15:53:00] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-05-25 15:53:00] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 328 ms returned sat
[2024-05-25 15:53:18] [INFO ] After 16555ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:15
[2024-05-25 15:53:18] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 15:53:23] [INFO ] After 4272ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :7 real:16
[2024-05-25 15:53:23] [INFO ] After 4274ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7 real:16
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 15:53:23] [INFO ] After 25058ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :7 real:16
[2024-05-25 15:53:25] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 15:53:25] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 351 ms returned sat
[2024-05-25 15:53:45] [INFO ] After 18665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2024-05-25 15:53:48] [INFO ] After 2351ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2024-05-25 15:53:48] [INFO ] After 2352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 15:53:48] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 254 ms.
Support contains 41 out of 5266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5266/5266 places, 14581/14581 transitions.
Applied a total of 0 rules in 899 ms. Remains 5266 /5266 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 899 ms. Remains : 5266/5266 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5266/5266 places, 14581/14581 transitions.
Applied a total of 0 rules in 891 ms. Remains 5266 /5266 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2024-05-25 15:53:50] [INFO ] Flow matrix only has 13700 transitions (discarded 881 similar events)
[2024-05-25 15:53:50] [INFO ] Invariant cache hit.
[2024-05-25 15:53:56] [INFO ] Implicit Places using invariants in 6576 ms returned []
Implicit Place search using SMT only with invariants took 6580 ms to find 0 implicit places.
[2024-05-25 15:53:56] [INFO ] Flow matrix only has 13700 transitions (discarded 881 similar events)
[2024-05-25 15:53:56] [INFO ] Invariant cache hit.
[2024-05-25 15:54:05] [INFO ] Dead Transitions using invariants and state equation in 8489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15963 ms. Remains : 5266/5266 places, 14581/14581 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17936 stabilizing places and 24674 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((F(p1)&&p0)) U (p2||G(!p3))))'
Support contains 5 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 632 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2024-05-25 15:54:06] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2024-05-25 15:54:08] [INFO ] Computed 1301 invariants in 2644 ms
[2024-05-25 15:54:10] [INFO ] Implicit Places using invariants in 4281 ms returned []
Implicit Place search using SMT only with invariants took 4283 ms to find 0 implicit places.
[2024-05-25 15:54:10] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2024-05-25 15:54:10] [INFO ] Invariant cache hit.
[2024-05-25 15:54:12] [INFO ] Dead Transitions using invariants and state equation in 1641 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6560 ms. Remains : 20560/20560 places, 29875/29875 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 365 ms :[(AND (NOT p2) p3), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), true, (NOT p1), p3, (AND (NOT p1) p3)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 3}, { cond=(NOT p3), acceptance={} source=5 dest: 5}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s14290 1) (GEQ s20265 1)), p3:(OR (AND (GEQ s14290 1) (GEQ s20265 1)) (AND (GEQ s7761 1) (GEQ s8157 1))), p0:(AND (GEQ s7761 1) (GEQ s8157 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12161 steps with 98 reset in 266 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-01 finished in 7344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22076
Deduced a syphon composed of 600 places in 21 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 2 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 2 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 14 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29391 place count 5590 transition count 8866
Iterating global reduction 2 with 549 rules applied. Total rules applied 29940 place count 5590 transition count 8866
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 29990 place count 5565 transition count 8841
Applied a total of 29990 rules in 3954 ms. Remains 5565 /20560 variables (removed 14995) and now considering 8841/29875 (removed 21034) transitions.
[2024-05-25 15:54:16] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2024-05-25 15:54:17] [INFO ] Computed 1301 invariants in 230 ms
[2024-05-25 15:54:22] [INFO ] Implicit Places using invariants in 6020 ms returned [2916]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6029 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5564/20560 places, 8841/29875 transitions.
Applied a total of 0 rules in 584 ms. Remains 5564 /5564 variables (removed 0) and now considering 8841/8841 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10568 ms. Remains : 5564/20560 places, 8841/29875 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2764 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-02 finished in 10647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F((p1||G(p2))))||p0))))'
Support contains 6 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7176 transitions
Trivial Post-agglo rules discarded 7176 transitions
Performed 7176 trivial Post agglomeration. Transition count delta: 7176
Iterating post reduction 0 with 7176 rules applied. Total rules applied 7176 place count 20560 transition count 22699
Reduce places removed 7176 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14376 place count 13384 transition count 22675
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 598 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 598 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22077
Deduced a syphon composed of 598 places in 20 ms
Reduce places removed 598 places and 0 transitions.
Iterating global reduction 3 with 1196 rules applied. Total rules applied 15596 place count 12762 transition count 22077
Discarding 6598 places :
Symmetric choice reduction at 3 with 6598 rule applications. Total rules 22194 place count 6164 transition count 15479
Iterating global reduction 3 with 6598 rules applied. Total rules applied 28792 place count 6164 transition count 15479
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 28792 place count 6164 transition count 15457
Deduced a syphon composed of 22 places in 12 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 28836 place count 6142 transition count 15457
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 29384 place count 5594 transition count 8881
Iterating global reduction 3 with 548 rules applied. Total rules applied 29932 place count 5594 transition count 8881
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29982 place count 5569 transition count 8856
Applied a total of 29982 rules in 4005 ms. Remains 5569 /20560 variables (removed 14991) and now considering 8856/29875 (removed 21019) transitions.
[2024-05-25 15:54:27] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
// Phase 1: matrix 8256 rows 5569 cols
[2024-05-25 15:54:27] [INFO ] Computed 1301 invariants in 228 ms
[2024-05-25 15:54:32] [INFO ] Implicit Places using invariants in 4607 ms returned []
[2024-05-25 15:54:32] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 15:54:32] [INFO ] Invariant cache hit.
[2024-05-25 15:54:38] [INFO ] Implicit Places using invariants and state equation in 5792 ms returned []
Implicit Place search using SMT with State Equation took 10401 ms to find 0 implicit places.
[2024-05-25 15:54:39] [INFO ] Redundant transitions in 1312 ms returned []
[2024-05-25 15:54:39] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 15:54:39] [INFO ] Invariant cache hit.
[2024-05-25 15:54:45] [INFO ] Dead Transitions using invariants and state equation in 5930 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5569/20560 places, 8856/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21663 ms. Remains : 5569/20560 places, 8856/29875 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s1538 1) (GEQ s1641 1)), p1:(AND (GEQ s942 1) (GEQ s965 1)), p0:(OR (LT s4186 1) (LT s4213 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1139 reset in 1196 ms.
Product exploration explored 100000 steps with 1138 reset in 1226 ms.
Computed a total of 2970 stabilizing places and 3680 stable transitions
Computed a total of 2970 stabilizing places and 3680 stable transitions
Detected a total of 2970/5569 stabilizing places and 3680/8856 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 27327 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 27327 steps, saw 12971 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:54:51] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 15:54:51] [INFO ] Invariant cache hit.
[2024-05-25 15:54:52] [INFO ] [Real]Absence check using 47 positive place invariants in 43 ms returned sat
[2024-05-25 15:54:52] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 389 ms returned sat
[2024-05-25 15:54:52] [INFO ] After 1109ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-25 15:54:53] [INFO ] [Nat]Absence check using 47 positive place invariants in 42 ms returned sat
[2024-05-25 15:54:53] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 396 ms returned sat
[2024-05-25 15:54:58] [INFO ] After 4933ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 15:54:58] [INFO ] State equation strengthened by 3174 read => feed constraints.
[2024-05-25 15:55:00] [INFO ] After 2240ms SMT Verify possible using 3174 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-25 15:55:07] [INFO ] Deduced a trap composed of 548 places in 6450 ms of which 7 ms to minimize.
[2024-05-25 15:55:15] [INFO ] Deduced a trap composed of 544 places in 6617 ms of which 5 ms to minimize.
[2024-05-25 15:55:22] [INFO ] Deduced a trap composed of 730 places in 6422 ms of which 5 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-25 15:55:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:55:22] [INFO ] After 30253ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 5569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5569/5569 places, 8856/8856 transitions.
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 338 place count 5569 transition count 14546
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 676 place count 5231 transition count 14546
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 724 place count 5231 transition count 14546
Applied a total of 724 rules in 2509 ms. Remains 5231 /5569 variables (removed 338) and now considering 14546/8856 (removed -5690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2510 ms. Remains : 5231/5569 places, 14546/8856 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23043 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23043 steps, saw 10808 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:55:29] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
// Phase 1: matrix 13660 rows 5231 cols
[2024-05-25 15:55:29] [INFO ] Computed 1301 invariants in 364 ms
[2024-05-25 15:55:29] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 15:55:30] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 342 ms returned sat
[2024-05-25 15:55:30] [INFO ] After 972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:55:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 84 ms returned sat
[2024-05-25 15:55:31] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 352 ms returned sat
[2024-05-25 15:55:38] [INFO ] After 7244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:55:38] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 15:55:45] [INFO ] After 6863ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:55:55] [INFO ] Deduced a trap composed of 353 places in 8210 ms of which 5 ms to minimize.
[2024-05-25 15:55:55] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 8717 ms
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.refineResultsWithTraps(DeadlockTester.java:772)
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-25 15:55:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:55:55] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 5231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 886 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 886 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 868 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
[2024-05-25 15:55:57] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 15:55:57] [INFO ] Invariant cache hit.
[2024-05-25 15:56:04] [INFO ] Implicit Places using invariants in 7796 ms returned []
Implicit Place search using SMT only with invariants took 7799 ms to find 0 implicit places.
[2024-05-25 15:56:05] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 15:56:05] [INFO ] Invariant cache hit.
[2024-05-25 15:56:14] [INFO ] Dead Transitions using invariants and state equation in 9056 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17727 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Graph (trivial) has 3627 edges and 5231 vertex of which 25 / 5231 are part of one of the 1 SCC in 6 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55759 edges and 5207 vertex of which 5186 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.8 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 242 rules applied. Total rules applied 244 place count 4800 transition count 12818
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 239 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 720 rules applied. Total rules applied 964 place count 4559 transition count 12339
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1642 place count 4319 transition count 11901
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2277 place count 4080 transition count 11505
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 4 with 557 rules applied. Total rules applied 2834 place count 3881 transition count 11147
Ensure Unique test removed 36 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 161 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 5 with 517 rules applied. Total rules applied 3351 place count 3684 transition count 10827
Ensure Unique test removed 2 places
Reduce places removed 161 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 159 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 6 with 447 rules applied. Total rules applied 3798 place count 3523 transition count 10541
Ensure Unique test removed 32 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 7 with 411 rules applied. Total rules applied 4209 place count 3364 transition count 10289
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 8 with 349 rules applied. Total rules applied 4558 place count 3237 transition count 10067
Ensure Unique test removed 28 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 9 with 317 rules applied. Total rules applied 4875 place count 3112 transition count 9875
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 263 rules applied. Total rules applied 5138 place count 3015 transition count 9709
Ensure Unique test removed 24 places
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 236 rules applied. Total rules applied 5374 place count 2920 transition count 9568
Ensure Unique test removed 1 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 191 rules applied. Total rules applied 5565 place count 2849 transition count 9448
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5733 place count 2779 transition count 9350
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5863 place count 2729 transition count 9270
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 5973 place count 2681 transition count 9208
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6053 place count 2649 transition count 9160
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6117 place count 2619 transition count 9126
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6159 place count 2601 transition count 9102
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6189 place count 2585 transition count 9088
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6205 place count 2577 transition count 9080
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6214 place count 2571 transition count 9077
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6218 place count 2568 transition count 9076
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6218 place count 2568 transition count 8476
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 598 places
Reduce places removed 1198 places and 0 transitions.
Iterating global reduction 23 with 1798 rules applied. Total rules applied 8016 place count 1370 transition count 8476
Discarding 598 places :
Symmetric choice reduction at 23 with 598 rule applications. Total rules 8614 place count 772 transition count 7878
Iterating global reduction 23 with 598 rules applied. Total rules applied 9212 place count 772 transition count 7878
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9212 place count 772 transition count 7877
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9214 place count 771 transition count 7877
Discarding 527 places :
Symmetric choice reduction at 23 with 527 rule applications. Total rules 9741 place count 244 transition count 1553
Iterating global reduction 23 with 527 rules applied. Total rules applied 10268 place count 244 transition count 1553
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Iterating post reduction 23 with 527 rules applied. Total rules applied 10795 place count 244 transition count 1026
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 24 with 67 rules applied. Total rules applied 10862 place count 210 transition count 993
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 24 with 8 rules applied. Total rules applied 10870 place count 210 transition count 985
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 25 with 1 rules applied. Total rules applied 10871 place count 210 transition count 984
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 25 with 25 rules applied. Total rules applied 10896 place count 210 transition count 959
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 25 with 25 rules applied. Total rules applied 10921 place count 185 transition count 959
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10943 place count 163 transition count 695
Ensure Unique test removed 11 places
Iterating global reduction 26 with 33 rules applied. Total rules applied 10976 place count 152 transition count 695
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 10998 place count 152 transition count 673
Discarding 11 places :
Symmetric choice reduction at 27 with 11 rule applications. Total rules 11009 place count 141 transition count 541
Iterating global reduction 27 with 11 rules applied. Total rules applied 11020 place count 141 transition count 541
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11030 place count 131 transition count 531
Iterating global reduction 27 with 10 rules applied. Total rules applied 11040 place count 131 transition count 531
Applied a total of 11040 rules in 10039 ms. Remains 131 /5231 variables (removed 5100) and now considering 531/14546 (removed 14015) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 531 rows 131 cols
[2024-05-25 15:56:24] [INFO ] Computed 44 invariants in 11 ms
[2024-05-25 15:56:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 15:56:24] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 6 ms returned sat
[2024-05-25 15:56:24] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:56:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 15:56:24] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 7 ms returned sat
[2024-05-25 15:56:24] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:56:24] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-25 15:56:24] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5569 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 : 5569/5569 places, 8856/8856 transitions.
Applied a total of 0 rules in 565 ms. Remains 5569 /5569 variables (removed 0) and now considering 8856/8856 (removed 0) transitions.
[2024-05-25 15:56:25] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
// Phase 1: matrix 8256 rows 5569 cols
[2024-05-25 15:56:25] [INFO ] Computed 1301 invariants in 248 ms
[2024-05-25 15:56:29] [INFO ] Implicit Places using invariants in 4647 ms returned []
[2024-05-25 15:56:29] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 15:56:29] [INFO ] Invariant cache hit.
[2024-05-25 15:56:35] [INFO ] Implicit Places using invariants and state equation in 5737 ms returned []
Implicit Place search using SMT with State Equation took 10388 ms to find 0 implicit places.
[2024-05-25 15:56:36] [INFO ] Redundant transitions in 786 ms returned []
[2024-05-25 15:56:36] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 15:56:36] [INFO ] Invariant cache hit.
[2024-05-25 15:56:42] [INFO ] Dead Transitions using invariants and state equation in 5884 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17633 ms. Remains : 5569/5569 places, 8856/8856 transitions.
Computed a total of 2970 stabilizing places and 3680 stable transitions
Computed a total of 2970 stabilizing places and 3680 stable transitions
Detected a total of 2970/5569 stabilizing places and 3680/8856 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 28883 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 28883 steps, saw 13669 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:56:45] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 15:56:45] [INFO ] Invariant cache hit.
[2024-05-25 15:56:46] [INFO ] [Real]Absence check using 47 positive place invariants in 49 ms returned sat
[2024-05-25 15:56:46] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 407 ms returned sat
[2024-05-25 15:56:51] [INFO ] After 5898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:56:52] [INFO ] [Nat]Absence check using 47 positive place invariants in 42 ms returned sat
[2024-05-25 15:56:52] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 396 ms returned sat
[2024-05-25 15:56:57] [INFO ] After 4951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:56:57] [INFO ] State equation strengthened by 3174 read => feed constraints.
[2024-05-25 15:56:59] [INFO ] After 1403ms SMT Verify possible using 3174 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:57:05] [INFO ] Deduced a trap composed of 674 places in 6113 ms of which 5 ms to minimize.
[2024-05-25 15:57:13] [INFO ] Deduced a trap composed of 681 places in 6537 ms of which 6 ms to minimize.
[2024-05-25 15:57:20] [INFO ] Deduced a trap composed of 834 places in 6249 ms of which 6 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-25 15:57:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:57:20] [INFO ] After 29059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 5569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5569/5569 places, 8856/8856 transitions.
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 338 place count 5569 transition count 14546
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 676 place count 5231 transition count 14546
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 724 place count 5231 transition count 14546
Applied a total of 724 rules in 2451 ms. Remains 5231 /5569 variables (removed 338) and now considering 14546/8856 (removed -5690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2451 ms. Remains : 5231/5569 places, 14546/8856 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22481 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22481 steps, saw 10547 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:57:26] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
// Phase 1: matrix 13660 rows 5231 cols
[2024-05-25 15:57:27] [INFO ] Computed 1301 invariants in 366 ms
[2024-05-25 15:57:27] [INFO ] [Real]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 15:57:28] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 338 ms returned sat
[2024-05-25 15:57:28] [INFO ] After 971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:57:28] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 15:57:29] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 367 ms returned sat
[2024-05-25 15:57:37] [INFO ] After 7719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:57:37] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 15:57:40] [INFO ] After 3168ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:57:41] [INFO ] After 3907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 441 ms.
[2024-05-25 15:57:41] [INFO ] After 13158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 5231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 873 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 866 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
[2024-05-25 15:57:43] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 15:57:43] [INFO ] Invariant cache hit.
[2024-05-25 15:57:51] [INFO ] Implicit Places using invariants in 7984 ms returned []
Implicit Place search using SMT only with invariants took 7985 ms to find 0 implicit places.
[2024-05-25 15:57:51] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 15:57:51] [INFO ] Invariant cache hit.
[2024-05-25 15:58:00] [INFO ] Dead Transitions using invariants and state equation in 8897 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17753 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Graph (trivial) has 3629 edges and 5231 vertex of which 25 / 5231 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55759 edges and 5207 vertex of which 5185 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4799 transition count 12817
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4557 transition count 12336
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4316 transition count 11896
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 4076 transition count 11498
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3876 transition count 11138
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3678 transition count 10816
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3516 transition count 10528
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3356 transition count 10274
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3228 transition count 10050
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 3102 transition count 9856
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 3004 transition count 9688
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2908 transition count 9546
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2836 transition count 9426
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2766 transition count 9328
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2716 transition count 9248
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2668 transition count 9186
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2636 transition count 9138
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2606 transition count 9104
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2588 transition count 9080
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2572 transition count 9066
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2564 transition count 9058
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2557 transition count 9056
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2555 transition count 9056
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2555 transition count 8456
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 598 places
Reduce places removed 1198 places and 0 transitions.
Iterating global reduction 23 with 1798 rules applied. Total rules applied 8048 place count 1357 transition count 8456
Discarding 598 places :
Symmetric choice reduction at 23 with 598 rule applications. Total rules 8646 place count 759 transition count 7858
Iterating global reduction 23 with 598 rules applied. Total rules applied 9244 place count 759 transition count 7858
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9244 place count 759 transition count 7857
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9246 place count 758 transition count 7857
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 9774 place count 230 transition count 1521
Iterating global reduction 23 with 528 rules applied. Total rules applied 10302 place count 230 transition count 1521
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 10830 place count 230 transition count 993
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10881 place count 204 transition count 968
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 24 with 24 rules applied. Total rules applied 10905 place count 204 transition count 944
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 24 with 24 rules applied. Total rules applied 10929 place count 180 transition count 944
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10951 place count 158 transition count 680
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10984 place count 147 transition count 680
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 11006 place count 147 transition count 658
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11017 place count 136 transition count 526
Iterating global reduction 26 with 11 rules applied. Total rules applied 11028 place count 136 transition count 526
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11039 place count 125 transition count 515
Iterating global reduction 26 with 11 rules applied. Total rules applied 11050 place count 125 transition count 515
Applied a total of 11050 rules in 9829 ms. Remains 125 /5231 variables (removed 5106) and now considering 515/14546 (removed 14031) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 125 cols
[2024-05-25 15:58:09] [INFO ] Computed 41 invariants in 13 ms
[2024-05-25 15:58:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 15:58:10] [INFO ] [Real]Absence check using 3 positive and 38 generalized place invariants in 6 ms returned sat
[2024-05-25 15:58:10] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:58:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 15:58:10] [INFO ] [Nat]Absence check using 3 positive and 38 generalized place invariants in 5 ms returned sat
[2024-05-25 15:58:10] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:58:10] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-25 15:58:10] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1139 reset in 1106 ms.
Product exploration explored 100000 steps with 1138 reset in 1139 ms.
Built C files in :
/tmp/ltsmin9577757800083306559
[2024-05-25 15:58:12] [INFO ] Too many transitions (8856) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:58:12] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9577757800083306559
Running compilation step : cd /tmp/ltsmin9577757800083306559;'/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/ltsmin9577757800083306559;'/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/ltsmin9577757800083306559;'/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 5569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5569/5569 places, 8856/8856 transitions.
Applied a total of 0 rules in 584 ms. Remains 5569 /5569 variables (removed 0) and now considering 8856/8856 (removed 0) transitions.
[2024-05-25 15:58:16] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
// Phase 1: matrix 8256 rows 5569 cols
[2024-05-25 15:58:16] [INFO ] Computed 1301 invariants in 232 ms
[2024-05-25 15:58:21] [INFO ] Implicit Places using invariants in 4619 ms returned []
[2024-05-25 15:58:21] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 15:58:21] [INFO ] Invariant cache hit.
[2024-05-25 15:58:27] [INFO ] Implicit Places using invariants and state equation in 5802 ms returned []
Implicit Place search using SMT with State Equation took 10423 ms to find 0 implicit places.
[2024-05-25 15:58:28] [INFO ] Redundant transitions in 1051 ms returned []
[2024-05-25 15:58:28] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 15:58:28] [INFO ] Invariant cache hit.
[2024-05-25 15:58:33] [INFO ] Dead Transitions using invariants and state equation in 5775 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17839 ms. Remains : 5569/5569 places, 8856/8856 transitions.
Built C files in :
/tmp/ltsmin15498317684883999473
[2024-05-25 15:58:33] [INFO ] Too many transitions (8856) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:58:33] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15498317684883999473
Running compilation step : cd /tmp/ltsmin15498317684883999473;'/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/ltsmin15498317684883999473;'/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/ltsmin15498317684883999473;'/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-25 15:58:38] [INFO ] Flatten gal took : 251 ms
[2024-05-25 15:58:38] [INFO ] Flatten gal took : 226 ms
[2024-05-25 15:58:38] [INFO ] Time to serialize gal into /tmp/LTL6837782317312016722.gal : 72 ms
[2024-05-25 15:58:38] [INFO ] Time to serialize properties into /tmp/LTL15521424307744735989.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/LTL6837782317312016722.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1630484936840035943.hoa' '-atoms' '/tmp/LTL15521424307744735989.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/LTL15521424307744735989.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1630484936840035943.hoa
Detected timeout of ITS tools.
[2024-05-25 15:58:53] [INFO ] Flatten gal took : 214 ms
[2024-05-25 15:58:54] [INFO ] Flatten gal took : 222 ms
[2024-05-25 15:58:54] [INFO ] Time to serialize gal into /tmp/LTL9614219567894786009.gal : 43 ms
[2024-05-25 15:58:54] [INFO ] Time to serialize properties into /tmp/LTL13743636513719746744.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9614219567894786009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13743636513719746744.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 : !((G(F(("((Node22HasAskedItsLeafSetToRx6ToReplaceNode19<1)||(LeafSetOfRx6IsSentToNode22<1))")||(G(F(("((Node2HasAskedItsLeafSetToRx3To...319
Formula 0 simplified : G(F!"((Node5ThinksNode6ShouldBeNodeMasterToReplaceNode12>=1)&&(NodesCanDetectThatNode6HasCrashed>=1))" & FG(!"((Node2HasAskedItsLeaf...306
Detected timeout of ITS tools.
[2024-05-25 15:59:09] [INFO ] Flatten gal took : 212 ms
[2024-05-25 15:59:09] [INFO ] Applying decomposition
[2024-05-25 15:59:09] [INFO ] Flatten gal took : 216 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/graph6943083195757362602.txt' '-o' '/tmp/graph6943083195757362602.bin' '-w' '/tmp/graph6943083195757362602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6943083195757362602.bin' '-l' '-1' '-v' '-w' '/tmp/graph6943083195757362602.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:59:10] [INFO ] Decomposing Gal with order
[2024-05-25 15:59:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:59:12] [INFO ] Removed a total of 7509 redundant transitions.
[2024-05-25 15:59:12] [INFO ] Flatten gal took : 1827 ms
[2024-05-25 15:59:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4804 labels/synchronizations in 545 ms.
[2024-05-25 15:59:14] [INFO ] Time to serialize gal into /tmp/LTL13233832462008891417.gal : 87 ms
[2024-05-25 15:59:14] [INFO ] Time to serialize properties into /tmp/LTL6371814100678730077.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/LTL13233832462008891417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6371814100678730077.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 : !((G(F(("((i21.u423.Node22HasAskedItsLeafSetToRx6ToReplaceNode19<1)||(i21.u336.LeafSetOfRx6IsSentToNode22<1))")||(G(F(("((i19.u422.Nod...372
Formula 0 simplified : G(F!"((i9.u134.Node5ThinksNode6ShouldBeNodeMasterToReplaceNode12>=1)&&(i15.u257.NodesCanDetectThatNode6HasCrashed>=1))" & FG(!"((i19...359
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6038003834202075197
[2024-05-25 15:59:29] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6038003834202075197
Running compilation step : cd /tmp/ltsmin6038003834202075197;'/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/ltsmin6038003834202075197;'/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/ltsmin6038003834202075197;'/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 MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-03 finished in 308533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7200 transitions
Trivial Post-agglo rules discarded 7200 transitions
Performed 7200 trivial Post agglomeration. Transition count delta: 7200
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 22675
Reduce places removed 7200 places and 0 transitions.
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 20 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6600 places :
Symmetric choice reduction at 2 with 6600 rule applications. Total rules 22200 place count 6160 transition count 15475
Iterating global reduction 2 with 6600 rules applied. Total rules applied 28800 place count 6160 transition count 15475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28800 place count 6160 transition count 15451
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 28848 place count 6136 transition count 15451
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 29398 place count 5586 transition count 8851
Iterating global reduction 2 with 550 rules applied. Total rules applied 29948 place count 5586 transition count 8851
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 29998 place count 5561 transition count 8826
Applied a total of 29998 rules in 3483 ms. Remains 5561 /20560 variables (removed 14999) and now considering 8826/29875 (removed 21049) transitions.
[2024-05-25 15:59:35] [INFO ] Flow matrix only has 8226 transitions (discarded 600 similar events)
// Phase 1: matrix 8226 rows 5561 cols
[2024-05-25 15:59:35] [INFO ] Computed 1301 invariants in 238 ms
[2024-05-25 15:59:40] [INFO ] Implicit Places using invariants in 4530 ms returned []
[2024-05-25 15:59:40] [INFO ] Flow matrix only has 8226 transitions (discarded 600 similar events)
[2024-05-25 15:59:40] [INFO ] Invariant cache hit.
[2024-05-25 15:59:44] [INFO ] Implicit Places using invariants and state equation in 4310 ms returned []
Implicit Place search using SMT with State Equation took 8840 ms to find 0 implicit places.
[2024-05-25 15:59:45] [INFO ] Redundant transitions in 1199 ms returned []
[2024-05-25 15:59:45] [INFO ] Flow matrix only has 8226 transitions (discarded 600 similar events)
[2024-05-25 15:59:45] [INFO ] Invariant cache hit.
[2024-05-25 15:59:51] [INFO ] Dead Transitions using invariants and state equation in 5426 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5561/20560 places, 8826/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18955 ms. Remains : 5561/20560 places, 8826/29875 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3116 1) (GEQ s4755 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-04 finished in 19045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((F(p0)&&F(p2)&&p1))))))'
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 622 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2024-05-25 15:59:51] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2024-05-25 15:59:54] [INFO ] Computed 1301 invariants in 2641 ms
[2024-05-25 15:59:56] [INFO ] Implicit Places using invariants in 4276 ms returned []
Implicit Place search using SMT only with invariants took 4277 ms to find 0 implicit places.
[2024-05-25 15:59:56] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2024-05-25 15:59:56] [INFO ] Invariant cache hit.
[2024-05-25 15:59:57] [INFO ] Dead Transitions using invariants and state equation in 1570 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6471 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s16979 1), p1:(AND (GEQ s17998 1) (GEQ s19722 1)), p2:(OR (LT s17998 1) (LT s19722 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-05 finished in 6775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(F(G(!p2))&&p1))))'
Support contains 6 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7176 transitions
Trivial Post-agglo rules discarded 7176 transitions
Performed 7176 trivial Post agglomeration. Transition count delta: 7176
Iterating post reduction 0 with 7176 rules applied. Total rules applied 7176 place count 20560 transition count 22699
Reduce places removed 7176 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14376 place count 13384 transition count 22675
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 598 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 598 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22077
Deduced a syphon composed of 598 places in 18 ms
Reduce places removed 598 places and 0 transitions.
Iterating global reduction 3 with 1196 rules applied. Total rules applied 15596 place count 12762 transition count 22077
Discarding 6598 places :
Symmetric choice reduction at 3 with 6598 rule applications. Total rules 22194 place count 6164 transition count 15479
Iterating global reduction 3 with 6598 rules applied. Total rules applied 28792 place count 6164 transition count 15479
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 28792 place count 6164 transition count 15457
Deduced a syphon composed of 22 places in 11 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 28836 place count 6142 transition count 15457
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 29383 place count 5595 transition count 8893
Iterating global reduction 3 with 547 rules applied. Total rules applied 29930 place count 5595 transition count 8893
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29980 place count 5570 transition count 8868
Applied a total of 29980 rules in 3566 ms. Remains 5570 /20560 variables (removed 14990) and now considering 8868/29875 (removed 21007) transitions.
[2024-05-25 16:00:01] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
// Phase 1: matrix 8268 rows 5570 cols
[2024-05-25 16:00:01] [INFO ] Computed 1301 invariants in 249 ms
[2024-05-25 16:00:06] [INFO ] Implicit Places using invariants in 4585 ms returned []
[2024-05-25 16:00:06] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
[2024-05-25 16:00:06] [INFO ] Invariant cache hit.
[2024-05-25 16:00:10] [INFO ] Implicit Places using invariants and state equation in 4347 ms returned []
Implicit Place search using SMT with State Equation took 8936 ms to find 0 implicit places.
[2024-05-25 16:00:11] [INFO ] Redundant transitions in 1025 ms returned []
[2024-05-25 16:00:11] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
[2024-05-25 16:00:11] [INFO ] Invariant cache hit.
[2024-05-25 16:00:17] [INFO ] Dead Transitions using invariants and state equation in 5523 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5570/20560 places, 8868/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19057 ms. Remains : 5570/20560 places, 8868/29875 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), true, p2, (AND p2 p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (OR (AND (GEQ s1915 1) (GEQ s1946 1)) (AND (GEQ s3124 1) (GEQ s5135 1)))) (NOT (AND (GEQ s3526 1) (GEQ s3681 1)))), p0:(AND (GEQ s3526 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1154 reset in 1122 ms.
Product exploration explored 100000 steps with 1155 reset in 1202 ms.
Computed a total of 2971 stabilizing places and 3692 stable transitions
Computed a total of 2971 stabilizing places and 3692 stable transitions
Detected a total of 2971/5570 stabilizing places and 3692/8868 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 834 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p2), p2]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 27142 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 27142 steps, saw 12889 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 16:00:23] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
[2024-05-25 16:00:23] [INFO ] Invariant cache hit.
[2024-05-25 16:00:24] [INFO ] [Real]Absence check using 47 positive place invariants in 41 ms returned sat
[2024-05-25 16:00:24] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 396 ms returned sat
[2024-05-25 16:00:30] [INFO ] After 6759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:00:31] [INFO ] [Nat]Absence check using 47 positive place invariants in 42 ms returned sat
[2024-05-25 16:00:31] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 403 ms returned sat
[2024-05-25 16:00:37] [INFO ] After 5733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:00:37] [INFO ] State equation strengthened by 3185 read => feed constraints.
[2024-05-25 16:00:40] [INFO ] After 3141ms SMT Verify possible using 3185 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 16:00:50] [INFO ] Deduced a trap composed of 928 places in 6421 ms of which 7 ms to minimize.
[2024-05-25 16:00:57] [INFO ] Deduced a trap composed of 503 places in 6375 ms of which 6 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-25 16:00:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:00:57] [INFO ] After 26842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 5570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5570/5570 places, 8868/8868 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5569 transition count 8856
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5569 transition count 8856
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 340 place count 5569 transition count 14546
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 678 place count 5231 transition count 14546
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 726 place count 5231 transition count 14546
Applied a total of 726 rules in 2915 ms. Remains 5231 /5570 variables (removed 339) and now considering 14546/8868 (removed -5678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2915 ms. Remains : 5231/5570 places, 14546/8868 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 723 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 21266 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21266 steps, saw 10019 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 16:01:04] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
// Phase 1: matrix 13660 rows 5231 cols
[2024-05-25 16:01:04] [INFO ] Computed 1301 invariants in 369 ms
[2024-05-25 16:01:05] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 16:01:05] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 340 ms returned sat
[2024-05-25 16:01:12] [INFO ] After 6860ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 16:01:12] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 16:01:17] [INFO ] After 4739ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:01:17] [INFO ] After 12851ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:01:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 87 ms returned sat
[2024-05-25 16:01:18] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 329 ms returned sat
[2024-05-25 16:01:25] [INFO ] After 6596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:01:37] [INFO ] After 12723ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:01:42] [INFO ] After 17338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-25 16:01:42] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 5231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 875 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 875 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 865 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
[2024-05-25 16:01:44] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 16:01:44] [INFO ] Invariant cache hit.
[2024-05-25 16:01:49] [INFO ] Implicit Places using invariants in 5119 ms returned []
Implicit Place search using SMT only with invariants took 5119 ms to find 0 implicit places.
[2024-05-25 16:01:49] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 16:01:49] [INFO ] Invariant cache hit.
[2024-05-25 16:01:57] [INFO ] Dead Transitions using invariants and state equation in 8474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14462 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Graph (trivial) has 3629 edges and 5231 vertex of which 25 / 5231 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55760 edges and 5207 vertex of which 5185 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4799 transition count 12817
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4557 transition count 12336
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4316 transition count 11896
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 4076 transition count 11498
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3876 transition count 11138
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3678 transition count 10816
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3516 transition count 10528
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3356 transition count 10274
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3228 transition count 10050
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 3102 transition count 9856
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 3004 transition count 9688
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2908 transition count 9546
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2836 transition count 9426
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2766 transition count 9328
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2716 transition count 9248
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2668 transition count 9186
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2636 transition count 9138
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2606 transition count 9104
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2588 transition count 9080
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2572 transition count 9066
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2564 transition count 9058
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2557 transition count 9056
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2555 transition count 9056
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2555 transition count 8456
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 598 places
Reduce places removed 1198 places and 0 transitions.
Iterating global reduction 23 with 1798 rules applied. Total rules applied 8048 place count 1357 transition count 8456
Discarding 598 places :
Symmetric choice reduction at 23 with 598 rule applications. Total rules 8646 place count 759 transition count 7858
Iterating global reduction 23 with 598 rules applied. Total rules applied 9244 place count 759 transition count 7858
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9244 place count 759 transition count 7857
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9246 place count 758 transition count 7857
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 9774 place count 230 transition count 1521
Iterating global reduction 23 with 528 rules applied. Total rules applied 10302 place count 230 transition count 1521
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 10830 place count 230 transition count 993
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10880 place count 205 transition count 968
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 24 with 24 rules applied. Total rules applied 10904 place count 205 transition count 944
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 24 with 24 rules applied. Total rules applied 10928 place count 181 transition count 944
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10950 place count 159 transition count 680
Iterating global reduction 25 with 22 rules applied. Total rules applied 10972 place count 159 transition count 680
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10994 place count 159 transition count 658
Applied a total of 10994 rules in 9670 ms. Remains 159 /5231 variables (removed 5072) and now considering 658/14546 (removed 13888) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 658 rows 159 cols
[2024-05-25 16:02:07] [INFO ] Computed 53 invariants in 13 ms
[2024-05-25 16:02:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 16:02:07] [INFO ] [Real]Absence check using 3 positive and 50 generalized place invariants in 6 ms returned sat
[2024-05-25 16:02:07] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 16:02:07] [INFO ] After 193ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-25 16:02:07] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 835 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p2), p2]
Stuttering acceptance computed with spot in 61 ms :[(AND p0 p2), p2]
Support contains 4 out of 5570 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 : 5570/5570 places, 8868/8868 transitions.
Applied a total of 0 rules in 601 ms. Remains 5570 /5570 variables (removed 0) and now considering 8868/8868 (removed 0) transitions.
[2024-05-25 16:02:09] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
// Phase 1: matrix 8268 rows 5570 cols
[2024-05-25 16:02:09] [INFO ] Computed 1301 invariants in 234 ms
[2024-05-25 16:02:14] [INFO ] Implicit Places using invariants in 4611 ms returned []
[2024-05-25 16:02:14] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
[2024-05-25 16:02:14] [INFO ] Invariant cache hit.
[2024-05-25 16:02:18] [INFO ] Implicit Places using invariants and state equation in 4382 ms returned []
Implicit Place search using SMT with State Equation took 8994 ms to find 0 implicit places.
[2024-05-25 16:02:19] [INFO ] Redundant transitions in 1053 ms returned []
[2024-05-25 16:02:19] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
[2024-05-25 16:02:19] [INFO ] Invariant cache hit.
[2024-05-25 16:02:25] [INFO ] Dead Transitions using invariants and state equation in 5481 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16137 ms. Remains : 5570/5570 places, 8868/8868 transitions.
Computed a total of 2971 stabilizing places and 3692 stable transitions
Computed a total of 2971 stabilizing places and 3692 stable transitions
Detected a total of 2971/5570 stabilizing places and 3692/8868 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND p0 p2), p2]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 26962 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26962 steps, saw 12809 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 16:02:28] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
[2024-05-25 16:02:28] [INFO ] Invariant cache hit.
[2024-05-25 16:02:29] [INFO ] [Real]Absence check using 47 positive place invariants in 41 ms returned sat
[2024-05-25 16:02:29] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 360 ms returned sat
[2024-05-25 16:02:35] [INFO ] After 6799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:02:36] [INFO ] [Nat]Absence check using 47 positive place invariants in 55 ms returned sat
[2024-05-25 16:02:36] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 394 ms returned sat
[2024-05-25 16:02:42] [INFO ] After 5653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:02:42] [INFO ] State equation strengthened by 3185 read => feed constraints.
[2024-05-25 16:02:45] [INFO ] After 3218ms SMT Verify possible using 3185 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 16:02:55] [INFO ] Deduced a trap composed of 928 places in 6339 ms of which 5 ms to minimize.
[2024-05-25 16:03:02] [INFO ] Deduced a trap composed of 503 places in 6523 ms of which 6 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-25 16:03:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:03:02] [INFO ] After 27010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 5570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5570/5570 places, 8868/8868 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5569 transition count 8856
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5569 transition count 8856
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 340 place count 5569 transition count 14546
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 678 place count 5231 transition count 14546
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 726 place count 5231 transition count 14546
Applied a total of 726 rules in 2891 ms. Remains 5231 /5570 variables (removed 339) and now considering 14546/8868 (removed -5678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2892 ms. Remains : 5231/5570 places, 14546/8868 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 21600 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21600 steps, saw 10165 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 16:03:09] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
// Phase 1: matrix 13660 rows 5231 cols
[2024-05-25 16:03:09] [INFO ] Computed 1301 invariants in 378 ms
[2024-05-25 16:03:10] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 16:03:10] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 339 ms returned sat
[2024-05-25 16:03:17] [INFO ] After 7002ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 16:03:17] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 16:03:22] [INFO ] After 4891ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:03:22] [INFO ] After 13129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:03:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 16:03:23] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 348 ms returned sat
[2024-05-25 16:03:30] [INFO ] After 7017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:03:43] [INFO ] After 12849ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:03:47] [INFO ] After 16907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-25 16:03:47] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 5231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 881 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 881 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 886 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
[2024-05-25 16:03:49] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 16:03:49] [INFO ] Invariant cache hit.
[2024-05-25 16:03:54] [INFO ] Implicit Places using invariants in 5156 ms returned []
Implicit Place search using SMT only with invariants took 5158 ms to find 0 implicit places.
[2024-05-25 16:03:54] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 16:03:54] [INFO ] Invariant cache hit.
[2024-05-25 16:04:03] [INFO ] Dead Transitions using invariants and state equation in 8654 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14701 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Graph (trivial) has 3629 edges and 5231 vertex of which 25 / 5231 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55760 edges and 5207 vertex of which 5185 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4799 transition count 12817
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4557 transition count 12336
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4316 transition count 11896
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 4076 transition count 11498
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3876 transition count 11138
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3678 transition count 10816
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3516 transition count 10528
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3356 transition count 10274
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3228 transition count 10050
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 3102 transition count 9856
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 3004 transition count 9688
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2908 transition count 9546
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2836 transition count 9426
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2766 transition count 9328
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2716 transition count 9248
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2668 transition count 9186
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2636 transition count 9138
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2606 transition count 9104
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2588 transition count 9080
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2572 transition count 9066
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2564 transition count 9058
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2557 transition count 9056
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2555 transition count 9056
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2555 transition count 8456
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 598 places
Reduce places removed 1198 places and 0 transitions.
Iterating global reduction 23 with 1798 rules applied. Total rules applied 8048 place count 1357 transition count 8456
Discarding 598 places :
Symmetric choice reduction at 23 with 598 rule applications. Total rules 8646 place count 759 transition count 7858
Iterating global reduction 23 with 598 rules applied. Total rules applied 9244 place count 759 transition count 7858
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9244 place count 759 transition count 7857
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9246 place count 758 transition count 7857
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 9774 place count 230 transition count 1521
Iterating global reduction 23 with 528 rules applied. Total rules applied 10302 place count 230 transition count 1521
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 10830 place count 230 transition count 993
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10880 place count 205 transition count 968
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 24 with 24 rules applied. Total rules applied 10904 place count 205 transition count 944
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 24 with 24 rules applied. Total rules applied 10928 place count 181 transition count 944
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10950 place count 159 transition count 680
Iterating global reduction 25 with 22 rules applied. Total rules applied 10972 place count 159 transition count 680
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10994 place count 159 transition count 658
Applied a total of 10994 rules in 10193 ms. Remains 159 /5231 variables (removed 5072) and now considering 658/14546 (removed 13888) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 658 rows 159 cols
[2024-05-25 16:04:13] [INFO ] Computed 53 invariants in 11 ms
[2024-05-25 16:04:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 16:04:13] [INFO ] [Real]Absence check using 3 positive and 50 generalized place invariants in 10 ms returned sat
[2024-05-25 16:04:13] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 16:04:13] [INFO ] After 200ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-25 16:04:13] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 p2), p2]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 p2), p2]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 p2), p2]
Product exploration explored 100000 steps with 1155 reset in 1164 ms.
Product exploration explored 100000 steps with 1155 reset in 1204 ms.
Built C files in :
/tmp/ltsmin1949170655549898298
[2024-05-25 16:04:16] [INFO ] Too many transitions (8868) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:04:16] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1949170655549898298
Running compilation step : cd /tmp/ltsmin1949170655549898298;'/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/ltsmin1949170655549898298;'/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/ltsmin1949170655549898298;'/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 5570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5570/5570 places, 8868/8868 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5569 transition count 8856
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5569 transition count 8856
Applied a total of 2 rules in 1068 ms. Remains 5569 /5570 variables (removed 1) and now considering 8856/8868 (removed 12) transitions.
[2024-05-25 16:04:20] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
// Phase 1: matrix 8256 rows 5569 cols
[2024-05-25 16:04:21] [INFO ] Computed 1301 invariants in 237 ms
[2024-05-25 16:04:27] [INFO ] Implicit Places using invariants in 6212 ms returned []
[2024-05-25 16:04:27] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:04:27] [INFO ] Invariant cache hit.
[2024-05-25 16:04:31] [INFO ] Implicit Places using invariants and state equation in 4407 ms returned []
Implicit Place search using SMT with State Equation took 10642 ms to find 0 implicit places.
[2024-05-25 16:04:32] [INFO ] Redundant transitions in 1016 ms returned []
[2024-05-25 16:04:32] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:04:32] [INFO ] Invariant cache hit.
[2024-05-25 16:04:38] [INFO ] Dead Transitions using invariants and state equation in 5458 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5569/5570 places, 8856/8868 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18190 ms. Remains : 5569/5570 places, 8856/8868 transitions.
Built C files in :
/tmp/ltsmin15404919705966689074
[2024-05-25 16:04:38] [INFO ] Too many transitions (8856) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:04:38] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15404919705966689074
Running compilation step : cd /tmp/ltsmin15404919705966689074;'/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/ltsmin15404919705966689074;'/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/ltsmin15404919705966689074;'/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-25 16:04:41] [INFO ] Flatten gal took : 221 ms
[2024-05-25 16:04:41] [INFO ] Flatten gal took : 227 ms
[2024-05-25 16:04:42] [INFO ] Time to serialize gal into /tmp/LTL12429282207783163655.gal : 42 ms
[2024-05-25 16:04:42] [INFO ] Time to serialize properties into /tmp/LTL6152757707714639111.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/LTL12429282207783163655.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17278242290002837535.hoa' '-atoms' '/tmp/LTL6152757707714639111.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/LTL6152757707714639111.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17278242290002837535.hoa
Detected timeout of ITS tools.
[2024-05-25 16:04:57] [INFO ] Flatten gal took : 412 ms
[2024-05-25 16:04:58] [INFO ] Flatten gal took : 229 ms
[2024-05-25 16:04:58] [INFO ] Time to serialize gal into /tmp/LTL11031208792330545314.gal : 39 ms
[2024-05-25 16:04:58] [INFO ] Time to serialize properties into /tmp/LTL10553848854445777402.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11031208792330545314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10553848854445777402.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 : !(((!("((Node20HasAskedItsLeafSetToLx7ToReplaceNode8>=1)&&(LeafSetOfLx7IsSentToNode20>=1))"))U((G(!("((Node20HasAskedItsLeafSetToLx7To...576
Formula 0 simplified : "((Node20HasAskedItsLeafSetToLx7ToReplaceNode8>=1)&&(LeafSetOfLx7IsSentToNode20>=1))" M (!"((!(((Node7HasAskedItsLeafSetToRx11ToRepl...464
Detected timeout of ITS tools.
[2024-05-25 16:05:13] [INFO ] Flatten gal took : 219 ms
[2024-05-25 16:05:13] [INFO ] Applying decomposition
[2024-05-25 16:05:13] [INFO ] Flatten gal took : 226 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/graph8241972542226769825.txt' '-o' '/tmp/graph8241972542226769825.bin' '-w' '/tmp/graph8241972542226769825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8241972542226769825.bin' '-l' '-1' '-v' '-w' '/tmp/graph8241972542226769825.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:05:14] [INFO ] Decomposing Gal with order
[2024-05-25 16:05:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:05:15] [INFO ] Removed a total of 7734 redundant transitions.
[2024-05-25 16:05:15] [INFO ] Flatten gal took : 1157 ms
[2024-05-25 16:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 5734 labels/synchronizations in 482 ms.
[2024-05-25 16:05:16] [INFO ] Time to serialize gal into /tmp/LTL5148246356859784628.gal : 75 ms
[2024-05-25 16:05:16] [INFO ] Time to serialize properties into /tmp/LTL13821585059678056653.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/LTL5148246356859784628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13821585059678056653.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 : !(((!("((i17.u427.Node20HasAskedItsLeafSetToLx7ToReplaceNode8>=1)&&(i17.u281.LeafSetOfLx7IsSentToNode20>=1))"))U((G(!("((i17.u427.Node...696
Formula 0 simplified : "((i17.u427.Node20HasAskedItsLeafSetToLx7ToReplaceNode8>=1)&&(i17.u281.LeafSetOfLx7IsSentToNode20>=1))" M (!"((!(((i19.i1.u428.Node7...566
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16754531476729073935
[2024-05-25 16:05:31] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16754531476729073935
Running compilation step : cd /tmp/ltsmin16754531476729073935;'/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/ltsmin16754531476729073935;'/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/ltsmin16754531476729073935;'/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 MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-06 finished in 337011 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||G((X(p0)&&p1))))))'
Support contains 2 out of 20560 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 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7188 transitions
Trivial Post-agglo rules discarded 7188 transitions
Performed 7188 trivial Post agglomeration. Transition count delta: 7188
Iterating post reduction 0 with 7188 rules applied. Total rules applied 7188 place count 20560 transition count 22687
Reduce places removed 7188 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14388 place count 13372 transition count 22675
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 599 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 599 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22076
Deduced a syphon composed of 599 places in 20 ms
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 3 with 1198 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 3 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 3 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 11 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 29390 place count 5591 transition count 8878
Iterating global reduction 3 with 548 rules applied. Total rules applied 29938 place count 5591 transition count 8878
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29988 place count 5566 transition count 8853
Applied a total of 29988 rules in 3676 ms. Remains 5566 /20560 variables (removed 14994) and now considering 8853/29875 (removed 21022) transitions.
[2024-05-25 16:05:38] [INFO ] Flow matrix only has 8253 transitions (discarded 600 similar events)
// Phase 1: matrix 8253 rows 5566 cols
[2024-05-25 16:05:38] [INFO ] Computed 1301 invariants in 228 ms
[2024-05-25 16:05:44] [INFO ] Implicit Places using invariants in 5953 ms returned []
[2024-05-25 16:05:44] [INFO ] Flow matrix only has 8253 transitions (discarded 600 similar events)
[2024-05-25 16:05:44] [INFO ] Invariant cache hit.
[2024-05-25 16:05:49] [INFO ] Implicit Places using invariants and state equation in 4418 ms returned []
Implicit Place search using SMT with State Equation took 10384 ms to find 0 implicit places.
[2024-05-25 16:05:50] [INFO ] Redundant transitions in 1014 ms returned []
[2024-05-25 16:05:50] [INFO ] Flow matrix only has 8253 transitions (discarded 600 similar events)
[2024-05-25 16:05:50] [INFO ] Invariant cache hit.
[2024-05-25 16:05:55] [INFO ] Dead Transitions using invariants and state equation in 5558 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5566/20560 places, 8853/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20644 ms. Remains : 5566/20560 places, 8853/29875 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-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:(AND (GEQ s1511 1) (GEQ s5105 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]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-08 finished in 20766 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 U (p1||G(!p0))))))'
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7187 transitions
Trivial Post-agglo rules discarded 7187 transitions
Performed 7187 trivial Post agglomeration. Transition count delta: 7187
Iterating post reduction 0 with 7187 rules applied. Total rules applied 7187 place count 20560 transition count 22688
Reduce places removed 7187 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14386 place count 13373 transition count 22676
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 599 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 599 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22077
Deduced a syphon composed of 599 places in 27 ms
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 3 with 1198 rules applied. Total rules applied 15596 place count 12762 transition count 22077
Discarding 6598 places :
Symmetric choice reduction at 3 with 6598 rule applications. Total rules 22194 place count 6164 transition count 15479
Iterating global reduction 3 with 6598 rules applied. Total rules applied 28792 place count 6164 transition count 15479
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 28792 place count 6164 transition count 15457
Deduced a syphon composed of 22 places in 16 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 28836 place count 6142 transition count 15457
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 29384 place count 5594 transition count 8881
Iterating global reduction 3 with 548 rules applied. Total rules applied 29932 place count 5594 transition count 8881
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29982 place count 5569 transition count 8856
Applied a total of 29982 rules in 4001 ms. Remains 5569 /20560 variables (removed 14991) and now considering 8856/29875 (removed 21019) transitions.
[2024-05-25 16:05:59] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
// Phase 1: matrix 8256 rows 5569 cols
[2024-05-25 16:06:00] [INFO ] Computed 1301 invariants in 235 ms
[2024-05-25 16:06:05] [INFO ] Implicit Places using invariants in 5308 ms returned []
[2024-05-25 16:06:05] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:06:05] [INFO ] Invariant cache hit.
[2024-05-25 16:06:09] [INFO ] Implicit Places using invariants and state equation in 4337 ms returned []
Implicit Place search using SMT with State Equation took 9647 ms to find 0 implicit places.
[2024-05-25 16:06:10] [INFO ] Redundant transitions in 978 ms returned []
[2024-05-25 16:06:10] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:06:10] [INFO ] Invariant cache hit.
[2024-05-25 16:06:15] [INFO ] Dead Transitions using invariants and state equation in 5519 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5569/20560 places, 8856/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20156 ms. Remains : 5569/20560 places, 8856/29875 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s2586 1) (NOT (AND (GEQ s1609 1) (GEQ s1620 1)))), p0:(AND (GEQ s1609 1) (GEQ s1620 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1144 reset in 1159 ms.
Product exploration explored 100000 steps with 1144 reset in 1191 ms.
Computed a total of 2970 stabilizing places and 3680 stable transitions
Computed a total of 2970 stabilizing places and 3680 stable transitions
Detected a total of 2970/5569 stabilizing places and 3680/8856 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 27582 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 27582 steps, saw 13081 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 16:06:21] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:06:21] [INFO ] Invariant cache hit.
[2024-05-25 16:06:22] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-05-25 16:06:22] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 374 ms returned sat
[2024-05-25 16:06:28] [INFO ] After 5325ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 16:06:28] [INFO ] State equation strengthened by 3174 read => feed constraints.
[2024-05-25 16:06:28] [INFO ] After 527ms SMT Verify possible using 3174 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:06:28] [INFO ] After 7010ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:06:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 16:06:29] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 373 ms returned sat
[2024-05-25 16:06:35] [INFO ] After 5546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:06:37] [INFO ] After 1873ms SMT Verify possible using 3174 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 16:06:44] [INFO ] Deduced a trap composed of 636 places in 6177 ms of which 5 ms to minimize.
[2024-05-25 16:06:50] [INFO ] Deduced a trap composed of 845 places in 6429 ms of which 4 ms to minimize.
[2024-05-25 16:06:58] [INFO ] Deduced a trap composed of 506 places in 6431 ms of which 5 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-25 16:06:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:06:58] [INFO ] After 29124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 5569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5569/5569 places, 8856/8856 transitions.
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 338 place count 5569 transition count 14546
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 676 place count 5231 transition count 14546
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 1 with 49 rules applied. Total rules applied 725 place count 5231 transition count 14546
Applied a total of 725 rules in 2509 ms. Remains 5231 /5569 variables (removed 338) and now considering 14546/8856 (removed -5690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2509 ms. Remains : 5231/5569 places, 14546/8856 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 787 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 21522 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21522 steps, saw 10130 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 16:07:04] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
// Phase 1: matrix 13660 rows 5231 cols
[2024-05-25 16:07:05] [INFO ] Computed 1301 invariants in 378 ms
[2024-05-25 16:07:05] [INFO ] [Real]Absence check using 49 positive place invariants in 92 ms returned sat
[2024-05-25 16:07:06] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 347 ms returned sat
[2024-05-25 16:07:13] [INFO ] After 8787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:07:14] [INFO ] [Nat]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 16:07:14] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 352 ms returned sat
[2024-05-25 16:07:22] [INFO ] After 7605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:07:22] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 16:07:33] [INFO ] After 10375ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 16:07:38] [INFO ] After 16196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-25 16:07:38] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 5231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 862 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 863 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 896 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
[2024-05-25 16:07:40] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 16:07:40] [INFO ] Invariant cache hit.
[2024-05-25 16:07:45] [INFO ] Implicit Places using invariants in 5201 ms returned []
Implicit Place search using SMT only with invariants took 5201 ms to find 0 implicit places.
[2024-05-25 16:07:45] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 16:07:45] [INFO ] Invariant cache hit.
[2024-05-25 16:07:54] [INFO ] Dead Transitions using invariants and state equation in 8666 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14767 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Graph (trivial) has 3629 edges and 5231 vertex of which 25 / 5231 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55761 edges and 5207 vertex of which 5185 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4799 transition count 12817
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4557 transition count 12336
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4316 transition count 11896
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 4076 transition count 11498
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3876 transition count 11138
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3678 transition count 10816
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3516 transition count 10528
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3356 transition count 10274
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3228 transition count 10050
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 3102 transition count 9856
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 3004 transition count 9688
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2908 transition count 9546
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2836 transition count 9426
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2766 transition count 9328
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2716 transition count 9248
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2668 transition count 9186
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2636 transition count 9138
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2606 transition count 9104
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2588 transition count 9080
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2572 transition count 9066
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2564 transition count 9058
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2557 transition count 9056
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2555 transition count 9056
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2555 transition count 8456
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 598 places
Reduce places removed 1198 places and 0 transitions.
Iterating global reduction 23 with 1798 rules applied. Total rules applied 8048 place count 1357 transition count 8456
Discarding 598 places :
Symmetric choice reduction at 23 with 598 rule applications. Total rules 8646 place count 759 transition count 7858
Iterating global reduction 23 with 598 rules applied. Total rules applied 9244 place count 759 transition count 7858
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9244 place count 759 transition count 7857
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9246 place count 758 transition count 7857
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 9774 place count 230 transition count 1521
Iterating global reduction 23 with 528 rules applied. Total rules applied 10302 place count 230 transition count 1521
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 10830 place count 230 transition count 993
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10881 place count 204 transition count 968
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 24 with 24 rules applied. Total rules applied 10905 place count 204 transition count 944
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 24 with 24 rules applied. Total rules applied 10929 place count 180 transition count 944
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10951 place count 158 transition count 680
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10984 place count 147 transition count 680
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 11006 place count 147 transition count 658
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11017 place count 136 transition count 526
Iterating global reduction 26 with 11 rules applied. Total rules applied 11028 place count 136 transition count 526
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11039 place count 125 transition count 515
Iterating global reduction 26 with 11 rules applied. Total rules applied 11050 place count 125 transition count 515
Applied a total of 11050 rules in 10025 ms. Remains 125 /5231 variables (removed 5106) and now considering 515/14546 (removed 14031) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 515 rows 125 cols
[2024-05-25 16:08:04] [INFO ] Computed 41 invariants in 13 ms
[2024-05-25 16:08:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 16:08:04] [INFO ] [Real]Absence check using 3 positive and 38 generalized place invariants in 5 ms returned sat
[2024-05-25 16:08:04] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:08:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 16:08:04] [INFO ] [Nat]Absence check using 3 positive and 38 generalized place invariants in 5 ms returned sat
[2024-05-25 16:08:04] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:08:04] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-25 16:08:04] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 5569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5569/5569 places, 8856/8856 transitions.
Applied a total of 0 rules in 586 ms. Remains 5569 /5569 variables (removed 0) and now considering 8856/8856 (removed 0) transitions.
[2024-05-25 16:08:05] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
// Phase 1: matrix 8256 rows 5569 cols
[2024-05-25 16:08:05] [INFO ] Computed 1301 invariants in 238 ms
[2024-05-25 16:08:10] [INFO ] Implicit Places using invariants in 5032 ms returned []
[2024-05-25 16:08:10] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:08:10] [INFO ] Invariant cache hit.
[2024-05-25 16:08:15] [INFO ] Implicit Places using invariants and state equation in 4454 ms returned []
Implicit Place search using SMT with State Equation took 9488 ms to find 0 implicit places.
[2024-05-25 16:08:16] [INFO ] Redundant transitions in 820 ms returned []
[2024-05-25 16:08:16] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:08:16] [INFO ] Invariant cache hit.
[2024-05-25 16:08:21] [INFO ] Dead Transitions using invariants and state equation in 5534 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16439 ms. Remains : 5569/5569 places, 8856/8856 transitions.
Computed a total of 2970 stabilizing places and 3680 stable transitions
Computed a total of 2970 stabilizing places and 3680 stable transitions
Detected a total of 2970/5569 stabilizing places and 3680/8856 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 2497 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:08:24] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:08:24] [INFO ] Invariant cache hit.
[2024-05-25 16:08:25] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2024-05-25 16:08:25] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 372 ms returned sat
[2024-05-25 16:08:30] [INFO ] After 5525ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 16:08:31] [INFO ] State equation strengthened by 3174 read => feed constraints.
[2024-05-25 16:08:31] [INFO ] After 639ms SMT Verify possible using 3174 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:08:31] [INFO ] After 7261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:08:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 16:08:32] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 358 ms returned sat
[2024-05-25 16:08:38] [INFO ] After 5595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:08:39] [INFO ] After 1098ms SMT Verify possible using 3174 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:08:45] [INFO ] Deduced a trap composed of 728 places in 6092 ms of which 5 ms to minimize.
[2024-05-25 16:08:53] [INFO ] Deduced a trap composed of 981 places in 6419 ms of which 12 ms to minimize.
[2024-05-25 16:08:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 14507 ms
[2024-05-25 16:08:54] [INFO ] After 15796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 267 ms.
[2024-05-25 16:08:54] [INFO ] After 22709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 5569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5569/5569 places, 8856/8856 transitions.
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 338 place count 5569 transition count 14546
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 676 place count 5231 transition count 14546
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 1 with 49 rules applied. Total rules applied 725 place count 5231 transition count 14546
Applied a total of 725 rules in 2474 ms. Remains 5231 /5569 variables (removed 338) and now considering 14546/8856 (removed -5690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2475 ms. Remains : 5231/5569 places, 14546/8856 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23486 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23486 steps, saw 10998 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:09:00] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
// Phase 1: matrix 13660 rows 5231 cols
[2024-05-25 16:09:01] [INFO ] Computed 1301 invariants in 391 ms
[2024-05-25 16:09:01] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 16:09:01] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 348 ms returned sat
[2024-05-25 16:09:09] [INFO ] After 8604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:09:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 16:09:10] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 345 ms returned sat
[2024-05-25 16:09:19] [INFO ] After 9097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:09:19] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 16:09:24] [INFO ] After 5081ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:09:32] [INFO ] Deduced a trap composed of 541 places in 7639 ms of which 6 ms to minimize.
[2024-05-25 16:09:34] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9638 ms
[2024-05-25 16:09:34] [INFO ] After 14847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-25 16:09:34] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 5231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 884 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 884 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5231/5231 places, 14546/14546 transitions.
Applied a total of 0 rules in 902 ms. Remains 5231 /5231 variables (removed 0) and now considering 14546/14546 (removed 0) transitions.
[2024-05-25 16:09:36] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 16:09:36] [INFO ] Invariant cache hit.
[2024-05-25 16:09:41] [INFO ] Implicit Places using invariants in 5249 ms returned []
Implicit Place search using SMT only with invariants took 5249 ms to find 0 implicit places.
[2024-05-25 16:09:41] [INFO ] Flow matrix only has 13660 transitions (discarded 886 similar events)
[2024-05-25 16:09:41] [INFO ] Invariant cache hit.
[2024-05-25 16:09:50] [INFO ] Dead Transitions using invariants and state equation in 8520 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14673 ms. Remains : 5231/5231 places, 14546/14546 transitions.
Graph (trivial) has 3629 edges and 5231 vertex of which 25 / 5231 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55761 edges and 5207 vertex of which 5185 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4799 transition count 12817
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4557 transition count 12336
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4316 transition count 11896
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 4076 transition count 11498
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3876 transition count 11138
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3678 transition count 10816
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3516 transition count 10528
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3356 transition count 10274
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3228 transition count 10050
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 3102 transition count 9856
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 3004 transition count 9688
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2908 transition count 9546
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2836 transition count 9426
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2766 transition count 9328
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2716 transition count 9248
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2668 transition count 9186
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2636 transition count 9138
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2606 transition count 9104
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2588 transition count 9080
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2572 transition count 9066
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2564 transition count 9058
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2557 transition count 9056
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2555 transition count 9056
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2555 transition count 8456
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 598 places
Reduce places removed 1198 places and 0 transitions.
Iterating global reduction 23 with 1798 rules applied. Total rules applied 8048 place count 1357 transition count 8456
Discarding 598 places :
Symmetric choice reduction at 23 with 598 rule applications. Total rules 8646 place count 759 transition count 7858
Iterating global reduction 23 with 598 rules applied. Total rules applied 9244 place count 759 transition count 7858
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9244 place count 759 transition count 7857
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9246 place count 758 transition count 7857
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 9774 place count 230 transition count 1521
Iterating global reduction 23 with 528 rules applied. Total rules applied 10302 place count 230 transition count 1521
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 10830 place count 230 transition count 993
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10881 place count 204 transition count 968
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 24 with 24 rules applied. Total rules applied 10905 place count 204 transition count 944
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 24 with 24 rules applied. Total rules applied 10929 place count 180 transition count 944
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10951 place count 158 transition count 680
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10984 place count 147 transition count 680
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 11006 place count 147 transition count 658
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11017 place count 136 transition count 526
Iterating global reduction 26 with 11 rules applied. Total rules applied 11028 place count 136 transition count 526
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11039 place count 125 transition count 515
Iterating global reduction 26 with 11 rules applied. Total rules applied 11050 place count 125 transition count 515
Applied a total of 11050 rules in 9825 ms. Remains 125 /5231 variables (removed 5106) and now considering 515/14546 (removed 14031) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 125 cols
[2024-05-25 16:10:00] [INFO ] Computed 41 invariants in 12 ms
[2024-05-25 16:10:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 16:10:00] [INFO ] [Real]Absence check using 3 positive and 38 generalized place invariants in 5 ms returned sat
[2024-05-25 16:10:00] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:10:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 16:10:00] [INFO ] [Nat]Absence check using 3 positive and 38 generalized place invariants in 5 ms returned sat
[2024-05-25 16:10:00] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:10:00] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-25 16:10:00] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1143 reset in 1129 ms.
Product exploration explored 100000 steps with 1143 reset in 1150 ms.
Built C files in :
/tmp/ltsmin9406230369411845419
[2024-05-25 16:10:03] [INFO ] Too many transitions (8856) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:10:03] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9406230369411845419
Running compilation step : cd /tmp/ltsmin9406230369411845419;'/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/ltsmin9406230369411845419;'/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/ltsmin9406230369411845419;'/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 3 out of 5569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5569/5569 places, 8856/8856 transitions.
Applied a total of 0 rules in 579 ms. Remains 5569 /5569 variables (removed 0) and now considering 8856/8856 (removed 0) transitions.
[2024-05-25 16:10:06] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
// Phase 1: matrix 8256 rows 5569 cols
[2024-05-25 16:10:07] [INFO ] Computed 1301 invariants in 232 ms
[2024-05-25 16:10:12] [INFO ] Implicit Places using invariants in 5279 ms returned []
[2024-05-25 16:10:12] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:10:12] [INFO ] Invariant cache hit.
[2024-05-25 16:10:16] [INFO ] Implicit Places using invariants and state equation in 4467 ms returned []
Implicit Place search using SMT with State Equation took 9746 ms to find 0 implicit places.
[2024-05-25 16:10:17] [INFO ] Redundant transitions in 820 ms returned []
[2024-05-25 16:10:17] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2024-05-25 16:10:17] [INFO ] Invariant cache hit.
[2024-05-25 16:10:22] [INFO ] Dead Transitions using invariants and state equation in 5633 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16787 ms. Remains : 5569/5569 places, 8856/8856 transitions.
Built C files in :
/tmp/ltsmin7129374675952493111
[2024-05-25 16:10:23] [INFO ] Too many transitions (8856) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:10:23] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7129374675952493111
Running compilation step : cd /tmp/ltsmin7129374675952493111;'/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/ltsmin7129374675952493111;'/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/ltsmin7129374675952493111;'/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-25 16:10:26] [INFO ] Flatten gal took : 214 ms
[2024-05-25 16:10:26] [INFO ] Flatten gal took : 221 ms
[2024-05-25 16:10:26] [INFO ] Time to serialize gal into /tmp/LTL3761045120648034336.gal : 40 ms
[2024-05-25 16:10:26] [INFO ] Time to serialize properties into /tmp/LTL1356448730608662681.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/LTL3761045120648034336.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5738997672000194434.hoa' '-atoms' '/tmp/LTL1356448730608662681.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/LTL1356448730608662681.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5738997672000194434.hoa
Detected timeout of ITS tools.
[2024-05-25 16:10:42] [INFO ] Flatten gal took : 319 ms
[2024-05-25 16:10:42] [INFO ] Flatten gal took : 221 ms
[2024-05-25 16:10:42] [INFO ] Time to serialize gal into /tmp/LTL15855285122131544993.gal : 43 ms
[2024-05-25 16:10:42] [INFO ] Time to serialize properties into /tmp/LTL17273849715279820598.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15855285122131544993.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17273849715279820598.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 : !((G(F((!("((Node5HasAskedItsLeafSetToRx3ToReplaceNode23>=1)&&(LeafSetOfRx3IsSentToNode5>=1))"))U((G(!("((Node5HasAskedItsLeafSetToRx3...355
Formula 0 simplified : FG("((Node5HasAskedItsLeafSetToRx3ToReplaceNode23>=1)&&(LeafSetOfRx3IsSentToNode5>=1))" M !"((Node13HasTheLeafSetOfRx11ToReplaceNode...250
Detected timeout of ITS tools.
[2024-05-25 16:10:58] [INFO ] Flatten gal took : 221 ms
[2024-05-25 16:10:58] [INFO ] Applying decomposition
[2024-05-25 16:10:58] [INFO ] Flatten gal took : 229 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/graph414054078904016229.txt' '-o' '/tmp/graph414054078904016229.bin' '-w' '/tmp/graph414054078904016229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph414054078904016229.bin' '-l' '-1' '-v' '-w' '/tmp/graph414054078904016229.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:10:59] [INFO ] Decomposing Gal with order
[2024-05-25 16:10:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:11:00] [INFO ] Removed a total of 7685 redundant transitions.
[2024-05-25 16:11:00] [INFO ] Flatten gal took : 1165 ms
[2024-05-25 16:11:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 5691 labels/synchronizations in 457 ms.
[2024-05-25 16:11:01] [INFO ] Time to serialize gal into /tmp/LTL13600589966934823301.gal : 65 ms
[2024-05-25 16:11:01] [INFO ] Time to serialize properties into /tmp/LTL4015768855982651173.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/LTL13600589966934823301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4015768855982651173.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 : !((G(F((!("((i15.i1.u426.Node5HasAskedItsLeafSetToRx3ToReplaceNode23>=1)&&(i15.i1.u135.LeafSetOfRx3IsSentToNode5>=1))"))U((G(!("((i15....439
Formula 0 simplified : FG("((i15.i1.u426.Node5HasAskedItsLeafSetToRx3ToReplaceNode23>=1)&&(i15.i1.u135.LeafSetOfRx3IsSentToNode5>=1))" M !"((i16.i2.u427.No...310
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18364328285756042795
[2024-05-25 16:11:16] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18364328285756042795
Running compilation step : cd /tmp/ltsmin18364328285756042795;'/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/ltsmin18364328285756042795;'/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/ltsmin18364328285756042795;'/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 MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-09 finished in 323981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(G((!p0||X(G(p1)))))) U G(p2)))'
Support contains 5 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 653 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2024-05-25 16:11:20] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2024-05-25 16:11:23] [INFO ] Computed 1301 invariants in 2613 ms
[2024-05-25 16:11:24] [INFO ] Implicit Places using invariants in 4257 ms returned []
Implicit Place search using SMT only with invariants took 4259 ms to find 0 implicit places.
[2024-05-25 16:11:24] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2024-05-25 16:11:24] [INFO ] Invariant cache hit.
[2024-05-25 16:11:26] [INFO ] Dead Transitions using invariants and state equation in 1644 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6558 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), true, (AND p0 (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s13154 1) (GEQ s19239 1) (LT s17267 1)), p0:(AND (GEQ s1896 1) (GEQ s19487 1)), p1:(LT s17267 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33369 reset in 8323 ms.
Product exploration explored 100000 steps with 33321 reset in 8467 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Detected a total of 17936/20560 stabilizing places and 24674/29875 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p2 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 202 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), true, (AND p0 (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 10591 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10591 steps, saw 5426 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-25 16:11:48] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2024-05-25 16:11:48] [INFO ] Invariant cache hit.
[2024-05-25 16:11:52] [INFO ] [Real]Absence check using 47 positive place invariants in 267 ms returned sat
[2024-05-25 16:11:53] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 1094 ms returned sat
[2024-05-25 16:12:13] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 16:12:16] [INFO ] [Nat]Absence check using 47 positive place invariants in 251 ms returned sat
[2024-05-25 16:12:17] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 931 ms returned sat
[2024-05-25 16:12:38] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 20560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22076
Deduced a syphon composed of 600 places in 22 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 2 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 2 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 13 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29391 place count 5590 transition count 8866
Iterating global reduction 2 with 549 rules applied. Total rules applied 29940 place count 5590 transition count 8866
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 29990 place count 5565 transition count 8841
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 30327 place count 5565 transition count 14543
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 30664 place count 5228 transition count 14543
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 30689 place count 5228 transition count 14543
Applied a total of 30689 rules in 5576 ms. Remains 5228 /20560 variables (removed 15332) and now considering 14543/29875 (removed 15332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5579 ms. Remains : 5228/20560 places, 14543/29875 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 891 ms. (steps per millisecond=11 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 20994 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20994 steps, saw 9882 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-25 16:12:48] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2024-05-25 16:12:48] [INFO ] Computed 1301 invariants in 377 ms
[2024-05-25 16:12:49] [INFO ] [Real]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 16:12:49] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 349 ms returned sat
[2024-05-25 16:12:50] [INFO ] After 1506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 16:12:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-05-25 16:12:51] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 356 ms returned sat
[2024-05-25 16:13:06] [INFO ] After 14286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 16:13:06] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 16:13:15] [INFO ] After 8976ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 16:13:15] [INFO ] After 8977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-25 16:13:15] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 5228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 909 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 909 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 894 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
[2024-05-25 16:13:17] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2024-05-25 16:13:17] [INFO ] Invariant cache hit.
[2024-05-25 16:13:22] [INFO ] Implicit Places using invariants in 5331 ms returned []
Implicit Place search using SMT only with invariants took 5331 ms to find 0 implicit places.
[2024-05-25 16:13:22] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2024-05-25 16:13:22] [INFO ] Invariant cache hit.
[2024-05-25 16:13:30] [INFO ] Dead Transitions using invariants and state equation in 7902 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14131 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p2 p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 248 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(OR (NOT p2) p0), true]
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p2) p0), true]
[2024-05-25 16:13:30] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2024-05-25 16:13:33] [INFO ] Computed 1301 invariants in 2631 ms
Could not prove EG (NOT p2)
Support contains 5 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22076
Deduced a syphon composed of 600 places in 23 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 2 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 2 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 12 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29391 place count 5590 transition count 8866
Iterating global reduction 2 with 549 rules applied. Total rules applied 29940 place count 5590 transition count 8866
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 29990 place count 5565 transition count 8841
Applied a total of 29990 rules in 3595 ms. Remains 5565 /20560 variables (removed 14995) and now considering 8841/29875 (removed 21034) transitions.
[2024-05-25 16:13:52] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2024-05-25 16:13:52] [INFO ] Computed 1301 invariants in 237 ms
[2024-05-25 16:13:57] [INFO ] Implicit Places using invariants in 5259 ms returned []
[2024-05-25 16:13:57] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2024-05-25 16:13:57] [INFO ] Invariant cache hit.
[2024-05-25 16:14:01] [INFO ] Implicit Places using invariants and state equation in 4380 ms returned []
Implicit Place search using SMT with State Equation took 9641 ms to find 0 implicit places.
[2024-05-25 16:14:02] [INFO ] Redundant transitions in 828 ms returned []
[2024-05-25 16:14:02] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2024-05-25 16:14:02] [INFO ] Invariant cache hit.
[2024-05-25 16:14:07] [INFO ] Dead Transitions using invariants and state equation in 5201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5565/20560 places, 8841/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19274 ms. Remains : 5565/20560 places, 8841/29875 transitions.
Computed a total of 2966 stabilizing places and 3665 stable transitions
Computed a total of 2966 stabilizing places and 3665 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(OR (NOT p2) p0), true]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 25871 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25871 steps, saw 12320 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 16:14:11] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2024-05-25 16:14:11] [INFO ] Invariant cache hit.
[2024-05-25 16:14:12] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2024-05-25 16:14:12] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 377 ms returned sat
[2024-05-25 16:14:12] [INFO ] After 1198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 16:14:13] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 16:14:13] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 381 ms returned sat
[2024-05-25 16:14:20] [INFO ] After 6562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 16:14:20] [INFO ] State equation strengthened by 3163 read => feed constraints.
[2024-05-25 16:14:24] [INFO ] After 3836ms SMT Verify possible using 3163 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-25 16:14:32] [INFO ] Deduced a trap composed of 772 places in 6865 ms of which 7 ms to minimize.
[2024-05-25 16:14:39] [INFO ] Deduced a trap composed of 410 places in 6330 ms of which 6 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-25 16:14:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:14:39] [INFO ] After 26620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 5565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5565/5565 places, 8841/8841 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5565 transition count 14543
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5228 transition count 14543
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 5228 transition count 14543
Applied a total of 699 rules in 2548 ms. Remains 5228 /5565 variables (removed 337) and now considering 14543/8841 (removed -5702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2548 ms. Remains : 5228/5565 places, 14543/8841 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 737 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 22570 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22570 steps, saw 10589 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 16:14:45] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2024-05-25 16:14:46] [INFO ] Computed 1301 invariants in 378 ms
[2024-05-25 16:14:46] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 16:14:47] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 358 ms returned sat
[2024-05-25 16:14:47] [INFO ] After 1087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:14:47] [INFO ] [Nat]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 16:14:48] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 358 ms returned sat
[2024-05-25 16:14:58] [INFO ] After 10063ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:14:58] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 16:15:09] [INFO ] After 10929ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:15:17] [INFO ] Deduced a trap composed of 627 places in 7818 ms of which 6 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-25 16:15:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:15:17] [INFO ] After 30427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 5228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 882 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 882 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 868 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
[2024-05-25 16:15:19] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2024-05-25 16:15:19] [INFO ] Invariant cache hit.
[2024-05-25 16:15:24] [INFO ] Implicit Places using invariants in 5174 ms returned []
Implicit Place search using SMT only with invariants took 5174 ms to find 0 implicit places.
[2024-05-25 16:15:24] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2024-05-25 16:15:24] [INFO ] Invariant cache hit.
[2024-05-25 16:15:33] [INFO ] Dead Transitions using invariants and state equation in 8557 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14602 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Graph (trivial) has 3625 edges and 5228 vertex of which 25 / 5228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55759 edges and 5204 vertex of which 5183 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.7 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4797 transition count 12814
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4555 transition count 12334
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1645 place count 4315 transition count 11896
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2280 place count 4076 transition count 11500
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 4 with 557 rules applied. Total rules applied 2837 place count 3877 transition count 11142
Ensure Unique test removed 36 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 161 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 5 with 517 rules applied. Total rules applied 3354 place count 3680 transition count 10822
Ensure Unique test removed 2 places
Reduce places removed 161 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 159 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 6 with 447 rules applied. Total rules applied 3801 place count 3519 transition count 10536
Ensure Unique test removed 32 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 7 with 411 rules applied. Total rules applied 4212 place count 3360 transition count 10284
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 8 with 349 rules applied. Total rules applied 4561 place count 3233 transition count 10062
Ensure Unique test removed 28 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 9 with 317 rules applied. Total rules applied 4878 place count 3108 transition count 9870
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 263 rules applied. Total rules applied 5141 place count 3011 transition count 9704
Ensure Unique test removed 24 places
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 235 rules applied. Total rules applied 5376 place count 2916 transition count 9564
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 12 with 188 rules applied. Total rules applied 5564 place count 2845 transition count 9447
Ensure Unique test removed 20 places
Reduce places removed 68 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 13 with 162 rules applied. Total rules applied 5726 place count 2777 transition count 9353
Ensure Unique test removed 2 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 14 with 124 rules applied. Total rules applied 5850 place count 2729 transition count 9277
Ensure Unique test removed 16 places
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 15 with 104 rules applied. Total rules applied 5954 place count 2683 transition count 9219
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 16 with 75 rules applied. Total rules applied 6029 place count 2653 transition count 9174
Ensure Unique test removed 11 places
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 17 with 60 rules applied. Total rules applied 6089 place count 2625 transition count 9142
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 40 rules applied. Total rules applied 6129 place count 2608 transition count 9119
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 29 rules applied. Total rules applied 6158 place count 2593 transition count 9105
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6174 place count 2585 transition count 9097
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 21 with 10 rules applied. Total rules applied 6184 place count 2579 transition count 9093
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 6190 place count 2575 transition count 9091
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6190 place count 2575 transition count 8491
Deduced a syphon composed of 600 places in 3 ms
Ensure Unique test removed 599 places
Reduce places removed 1199 places and 0 transitions.
Iterating global reduction 23 with 1799 rules applied. Total rules applied 7989 place count 1376 transition count 8491
Discarding 599 places :
Symmetric choice reduction at 23 with 599 rule applications. Total rules 8588 place count 777 transition count 7892
Iterating global reduction 23 with 599 rules applied. Total rules applied 9187 place count 777 transition count 7892
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9187 place count 777 transition count 7891
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9189 place count 776 transition count 7891
Discarding 538 places :
Symmetric choice reduction at 23 with 538 rule applications. Total rules 9727 place count 238 transition count 1435
Iterating global reduction 23 with 538 rules applied. Total rules applied 10265 place count 238 transition count 1435
Ensure Unique test removed 538 transitions
Reduce isomorphic transitions removed 538 transitions.
Iterating post reduction 23 with 538 rules applied. Total rules applied 10803 place count 238 transition count 897
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 24 with 81 rules applied. Total rules applied 10884 place count 197 transition count 857
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 24 with 15 rules applied. Total rules applied 10899 place count 197 transition count 842
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 10901 place count 197 transition count 840
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 25 with 26 rules applied. Total rules applied 10927 place count 197 transition count 814
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 25 with 26 rules applied. Total rules applied 10953 place count 171 transition count 814
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10975 place count 149 transition count 550
Ensure Unique test removed 10 places
Iterating global reduction 26 with 32 rules applied. Total rules applied 11007 place count 139 transition count 550
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 11029 place count 139 transition count 528
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11039 place count 129 transition count 408
Iterating global reduction 27 with 10 rules applied. Total rules applied 11049 place count 129 transition count 408
Discarding 9 places :
Symmetric choice reduction at 27 with 9 rule applications. Total rules 11058 place count 120 transition count 399
Iterating global reduction 27 with 9 rules applied. Total rules applied 11067 place count 120 transition count 399
Applied a total of 11067 rules in 9900 ms. Remains 120 /5228 variables (removed 5108) and now considering 399/14543 (removed 14144) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 399 rows 120 cols
[2024-05-25 16:15:43] [INFO ] Computed 45 invariants in 10 ms
[2024-05-25 16:15:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:15:43] [INFO ] [Real]Absence check using 5 positive and 40 generalized place invariants in 11 ms returned sat
[2024-05-25 16:15:43] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 16:15:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:15:43] [INFO ] [Nat]Absence check using 5 positive and 40 generalized place invariants in 8 ms returned sat
[2024-05-25 16:15:43] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 16:15:43] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-25 16:15:43] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (G (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p2)]
[2024-05-25 16:15:43] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2024-05-25 16:15:43] [INFO ] Computed 1301 invariants in 235 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 448 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-10 finished in 279575 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)||X((X(F(!p1))||G(!p2)))))'
Support contains 8 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 643 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2024-05-25 16:15:59] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2024-05-25 16:16:02] [INFO ] Computed 1301 invariants in 2651 ms
[2024-05-25 16:16:04] [INFO ] Implicit Places using invariants in 4314 ms returned []
Implicit Place search using SMT only with invariants took 4315 ms to find 0 implicit places.
[2024-05-25 16:16:04] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2024-05-25 16:16:04] [INFO ] Invariant cache hit.
[2024-05-25 16:16:05] [INFO ] Dead Transitions using invariants and state equation in 1667 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6626 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 826 ms :[p1, (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(AND (GEQ s15292 1) (GEQ s20346 1)), p0:(AND (GEQ s2 1) (GEQ s4611 1) (GEQ s4613 1) (GEQ s6737 1)), p2:(AND (GEQ s745 1) (GEQ s923 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 7847 ms.
Product exploration explored 100000 steps with 33333 reset in 7897 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Detected a total of 17936/20560 stabilizing places and 24674/29875 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 23 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-11 finished in 23401 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||(p1 U p2))&&(X(p0) U ((!p1&&X(p0))||X(G(p0))))))))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22076
Deduced a syphon composed of 600 places in 20 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 2 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 2 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 12 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29391 place count 5590 transition count 8866
Iterating global reduction 2 with 549 rules applied. Total rules applied 29940 place count 5590 transition count 8866
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 29990 place count 5565 transition count 8841
Applied a total of 29990 rules in 3512 ms. Remains 5565 /20560 variables (removed 14995) and now considering 8841/29875 (removed 21034) transitions.
[2024-05-25 16:16:26] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2024-05-25 16:16:26] [INFO ] Computed 1301 invariants in 240 ms
[2024-05-25 16:16:30] [INFO ] Implicit Places using invariants in 4671 ms returned []
[2024-05-25 16:16:30] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2024-05-25 16:16:30] [INFO ] Invariant cache hit.
[2024-05-25 16:16:37] [INFO ] Implicit Places using invariants and state equation in 6256 ms returned []
Implicit Place search using SMT with State Equation took 10943 ms to find 0 implicit places.
[2024-05-25 16:16:38] [INFO ] Redundant transitions in 836 ms returned []
[2024-05-25 16:16:38] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2024-05-25 16:16:38] [INFO ] Invariant cache hit.
[2024-05-25 16:16:43] [INFO ] Dead Transitions using invariants and state equation in 5588 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5565/20560 places, 8841/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20884 ms. Remains : 5565/20560 places, 8841/29875 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), false, (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1 p2), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (NOT p0) p1 p2), acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1022 1), p1:(AND (GEQ s1488 1) (GEQ s2846 1)), p2:(AND (GEQ s1142 1) (GEQ s2846 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-12 finished in 21116 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)&&X((G(p1)||(!p2 U (p3||G(!p2)))))))'
Support contains 8 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 618 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2024-05-25 16:16:44] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2024-05-25 16:16:47] [INFO ] Computed 1301 invariants in 2655 ms
[2024-05-25 16:16:48] [INFO ] Implicit Places using invariants in 4340 ms returned []
Implicit Place search using SMT only with invariants took 4341 ms to find 0 implicit places.
[2024-05-25 16:16:48] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2024-05-25 16:16:48] [INFO ] Invariant cache hit.
[2024-05-25 16:16:50] [INFO ] Dead Transitions using invariants and state equation in 1666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6639 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 p3), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p3) p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=4, aps=[p0:(LT s1691 1), p1:(OR (LT s8216 1) (LT s20211 1)), p3:(AND (NOT (OR (AND (GEQ s8216 1) (GEQ s20211 1) (GEQ s1894 1) (GEQ s1897 1) (GEQ s1898 1)) (AND (G...], 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 811 reset in 1832 ms.
Product exploration explored 100000 steps with 812 reset in 1929 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Detected a total of 17936/20560 stabilizing places and 24674/29875 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (AND p0 p3)), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (AND p0 p3))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 190 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 11245 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 11245 steps, saw 5742 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:16:58] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2024-05-25 16:16:58] [INFO ] Invariant cache hit.
[2024-05-25 16:17:00] [INFO ] [Real]Absence check using 47 positive place invariants in 220 ms returned sat
[2024-05-25 16:17:01] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 1041 ms returned sat
[2024-05-25 16:17:23] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 20560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22076
Deduced a syphon composed of 600 places in 21 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 2 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 2 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 13 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29391 place count 5590 transition count 8866
Iterating global reduction 2 with 549 rules applied. Total rules applied 29940 place count 5590 transition count 8866
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 29990 place count 5565 transition count 8841
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 30327 place count 5565 transition count 14543
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 30664 place count 5228 transition count 14543
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 30689 place count 5228 transition count 14543
Applied a total of 30689 rules in 5574 ms. Remains 5228 /20560 variables (removed 15332) and now considering 14543/29875 (removed 15332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5574 ms. Remains : 5228/20560 places, 14543/29875 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23295 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23295 steps, saw 10917 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:17:32] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2024-05-25 16:17:33] [INFO ] Computed 1301 invariants in 370 ms
[2024-05-25 16:17:33] [INFO ] [Real]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 16:17:33] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 367 ms returned sat
[2024-05-25 16:17:41] [INFO ] After 7657ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 16:17:41] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 16:17:43] [INFO ] After 1491ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:17:43] [INFO ] After 10289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:17:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 16:17:44] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 358 ms returned sat
[2024-05-25 16:17:51] [INFO ] After 7394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:17:54] [INFO ] After 3024ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:17:55] [INFO ] After 3671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 410 ms.
[2024-05-25 16:17:55] [INFO ] After 12476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 5228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 951 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 951 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 939 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
[2024-05-25 16:17:57] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2024-05-25 16:17:57] [INFO ] Invariant cache hit.
[2024-05-25 16:18:05] [INFO ] Implicit Places using invariants in 8065 ms returned []
Implicit Place search using SMT only with invariants took 8067 ms to find 0 implicit places.
[2024-05-25 16:18:05] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2024-05-25 16:18:05] [INFO ] Invariant cache hit.
[2024-05-25 16:18:14] [INFO ] Dead Transitions using invariants and state equation in 8795 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17807 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Graph (trivial) has 3629 edges and 5228 vertex of which 25 / 5228 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55759 edges and 5204 vertex of which 5182 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4796 transition count 12814
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4554 transition count 12333
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4313 transition count 11893
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 4073 transition count 11495
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3873 transition count 11135
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3675 transition count 10813
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3513 transition count 10525
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3353 transition count 10271
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3225 transition count 10047
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 3099 transition count 9853
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 3001 transition count 9685
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2905 transition count 9543
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2833 transition count 9423
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2763 transition count 9325
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2713 transition count 9245
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2665 transition count 9183
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2633 transition count 9135
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2603 transition count 9101
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2585 transition count 9077
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2569 transition count 9063
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2561 transition count 9055
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2554 transition count 9053
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2552 transition count 9053
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2552 transition count 8453
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 599 places
Reduce places removed 1199 places and 0 transitions.
Iterating global reduction 23 with 1799 rules applied. Total rules applied 8049 place count 1353 transition count 8453
Discarding 599 places :
Symmetric choice reduction at 23 with 599 rule applications. Total rules 8648 place count 754 transition count 7854
Iterating global reduction 23 with 599 rules applied. Total rules applied 9247 place count 754 transition count 7854
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9247 place count 754 transition count 7853
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9249 place count 753 transition count 7853
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 9789 place count 213 transition count 1373
Iterating global reduction 23 with 540 rules applied. Total rules applied 10329 place count 213 transition count 1373
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 10869 place count 213 transition count 833
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10920 place count 187 transition count 808
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 24 with 24 rules applied. Total rules applied 10944 place count 187 transition count 784
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 24 with 24 rules applied. Total rules applied 10968 place count 163 transition count 784
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10990 place count 141 transition count 520
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 11023 place count 130 transition count 520
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 11045 place count 130 transition count 498
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11056 place count 119 transition count 366
Iterating global reduction 26 with 11 rules applied. Total rules applied 11067 place count 119 transition count 366
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11078 place count 108 transition count 355
Iterating global reduction 26 with 11 rules applied. Total rules applied 11089 place count 108 transition count 355
Applied a total of 11089 rules in 9948 ms. Remains 108 /5228 variables (removed 5120) and now considering 355/14543 (removed 14188) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 355 rows 108 cols
[2024-05-25 16:18:24] [INFO ] Computed 40 invariants in 12 ms
[2024-05-25 16:18:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 16:18:24] [INFO ] [Real]Absence check using 3 positive and 37 generalized place invariants in 6 ms returned sat
[2024-05-25 16:18:24] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:18:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 16:18:24] [INFO ] [Nat]Absence check using 3 positive and 37 generalized place invariants in 5 ms returned sat
[2024-05-25 16:18:24] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:18:24] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 16:18:24] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (AND p0 p3)), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (AND p0 p3))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 182 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 57 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Support contains 1 out of 20560 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 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22076
Deduced a syphon composed of 600 places in 23 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 2 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 2 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 11 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 548 places :
Symmetric choice reduction at 2 with 548 rule applications. Total rules 29390 place count 5591 transition count 8878
Iterating global reduction 2 with 548 rules applied. Total rules applied 29938 place count 5591 transition count 8878
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 29986 place count 5567 transition count 8854
Applied a total of 29986 rules in 3512 ms. Remains 5567 /20560 variables (removed 14993) and now considering 8854/29875 (removed 21021) transitions.
[2024-05-25 16:18:28] [INFO ] Flow matrix only has 8254 transitions (discarded 600 similar events)
// Phase 1: matrix 8254 rows 5567 cols
[2024-05-25 16:18:28] [INFO ] Computed 1301 invariants in 233 ms
[2024-05-25 16:18:33] [INFO ] Implicit Places using invariants in 4580 ms returned []
[2024-05-25 16:18:33] [INFO ] Flow matrix only has 8254 transitions (discarded 600 similar events)
[2024-05-25 16:18:33] [INFO ] Invariant cache hit.
[2024-05-25 16:18:37] [INFO ] Implicit Places using invariants and state equation in 4068 ms returned []
Implicit Place search using SMT with State Equation took 8649 ms to find 0 implicit places.
[2024-05-25 16:18:38] [INFO ] Redundant transitions in 784 ms returned []
[2024-05-25 16:18:38] [INFO ] Flow matrix only has 8254 transitions (discarded 600 similar events)
[2024-05-25 16:18:38] [INFO ] Invariant cache hit.
[2024-05-25 16:18:43] [INFO ] Dead Transitions using invariants and state equation in 5501 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5567/20560 places, 8854/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18457 ms. Remains : 5567/20560 places, 8854/29875 transitions.
Computed a total of 2967 stabilizing places and 3677 stable transitions
Computed a total of 2967 stabilizing places and 3677 stable transitions
Detected a total of 2967/5567 stabilizing places and 3677/8854 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 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 36 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 28648 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 28648 steps, saw 13567 distinct states, run finished after 3002 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:18:46] [INFO ] Flow matrix only has 8254 transitions (discarded 600 similar events)
[2024-05-25 16:18:46] [INFO ] Invariant cache hit.
[2024-05-25 16:18:47] [INFO ] [Real]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 16:18:47] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 360 ms returned sat
[2024-05-25 16:18:52] [INFO ] After 4837ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 16:18:52] [INFO ] State equation strengthened by 3174 read => feed constraints.
[2024-05-25 16:18:53] [INFO ] After 1100ms SMT Verify possible using 3174 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:18:53] [INFO ] After 7003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:18:54] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 16:18:54] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 374 ms returned sat
[2024-05-25 16:19:00] [INFO ] After 5672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:19:02] [INFO ] After 1758ms SMT Verify possible using 3174 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:19:08] [INFO ] Deduced a trap composed of 883 places in 6058 ms of which 6 ms to minimize.
[2024-05-25 16:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6806 ms
[2024-05-25 16:19:09] [INFO ] After 8734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 254 ms.
[2024-05-25 16:19:09] [INFO ] After 15707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 5567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5567/5567 places, 8854/8854 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5566 transition count 8842
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5566 transition count 8842
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 5565 transition count 8841
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 341 place count 5565 transition count 14543
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 678 place count 5228 transition count 14543
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 703 place count 5228 transition count 14543
Applied a total of 703 rules in 3406 ms. Remains 5228 /5567 variables (removed 339) and now considering 14543/8854 (removed -5689) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3406 ms. Remains : 5228/5567 places, 14543/8854 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23510 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23510 steps, saw 11007 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:19:16] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2024-05-25 16:19:17] [INFO ] Computed 1301 invariants in 358 ms
[2024-05-25 16:19:17] [INFO ] [Real]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 16:19:17] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 337 ms returned sat
[2024-05-25 16:19:25] [INFO ] After 7485ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 16:19:25] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2024-05-25 16:19:27] [INFO ] After 1468ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:19:27] [INFO ] After 10020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:19:27] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 16:19:28] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 350 ms returned sat
[2024-05-25 16:19:35] [INFO ] After 7645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:19:38] [INFO ] After 2450ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:19:38] [INFO ] After 3067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 381 ms.
[2024-05-25 16:19:39] [INFO ] After 12082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 5228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 883 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 883 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 870 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
[2024-05-25 16:19:40] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2024-05-25 16:19:40] [INFO ] Invariant cache hit.
[2024-05-25 16:19:48] [INFO ] Implicit Places using invariants in 7598 ms returned []
Implicit Place search using SMT only with invariants took 7599 ms to find 0 implicit places.
[2024-05-25 16:19:48] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2024-05-25 16:19:48] [INFO ] Invariant cache hit.
[2024-05-25 16:19:57] [INFO ] Dead Transitions using invariants and state equation in 8556 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17028 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Graph (trivial) has 3629 edges and 5228 vertex of which 25 / 5228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55759 edges and 5204 vertex of which 5182 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4796 transition count 12814
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4554 transition count 12333
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4313 transition count 11893
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 4073 transition count 11495
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3873 transition count 11135
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3675 transition count 10813
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3513 transition count 10525
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3353 transition count 10271
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3225 transition count 10047
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 3099 transition count 9853
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 3001 transition count 9685
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2905 transition count 9543
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2833 transition count 9423
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2763 transition count 9325
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2713 transition count 9245
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2665 transition count 9183
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2633 transition count 9135
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2603 transition count 9101
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2585 transition count 9077
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2569 transition count 9063
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2561 transition count 9055
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2554 transition count 9053
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2552 transition count 9053
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2552 transition count 8453
Deduced a syphon composed of 600 places in 3 ms
Ensure Unique test removed 599 places
Reduce places removed 1199 places and 0 transitions.
Iterating global reduction 23 with 1799 rules applied. Total rules applied 8049 place count 1353 transition count 8453
Discarding 599 places :
Symmetric choice reduction at 23 with 599 rule applications. Total rules 8648 place count 754 transition count 7854
Iterating global reduction 23 with 599 rules applied. Total rules applied 9247 place count 754 transition count 7854
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9247 place count 754 transition count 7853
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9249 place count 753 transition count 7853
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 9789 place count 213 transition count 1373
Iterating global reduction 23 with 540 rules applied. Total rules applied 10329 place count 213 transition count 1373
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 10869 place count 213 transition count 833
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10920 place count 187 transition count 808
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 24 with 24 rules applied. Total rules applied 10944 place count 187 transition count 784
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 24 with 24 rules applied. Total rules applied 10968 place count 163 transition count 784
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10990 place count 141 transition count 520
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 11023 place count 130 transition count 520
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 11045 place count 130 transition count 498
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11056 place count 119 transition count 366
Iterating global reduction 26 with 11 rules applied. Total rules applied 11067 place count 119 transition count 366
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11078 place count 108 transition count 355
Iterating global reduction 26 with 11 rules applied. Total rules applied 11089 place count 108 transition count 355
Applied a total of 11089 rules in 9542 ms. Remains 108 /5228 variables (removed 5120) and now considering 355/14543 (removed 14188) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 355 rows 108 cols
[2024-05-25 16:20:06] [INFO ] Computed 40 invariants in 10 ms
[2024-05-25 16:20:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 16:20:06] [INFO ] [Real]Absence check using 3 positive and 37 generalized place invariants in 6 ms returned sat
[2024-05-25 16:20:06] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:20:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 16:20:06] [INFO ] [Nat]Absence check using 3 positive and 37 generalized place invariants in 7 ms returned sat
[2024-05-25 16:20:06] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:20:06] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-25 16:20:06] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 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 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1154 reset in 1112 ms.
Product exploration explored 100000 steps with 1155 reset in 1143 ms.
Built C files in :
/tmp/ltsmin4098046044053300645
[2024-05-25 16:20:09] [INFO ] Too many transitions (8854) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:20:09] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4098046044053300645
Running compilation step : cd /tmp/ltsmin4098046044053300645;'/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/ltsmin4098046044053300645;'/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/ltsmin4098046044053300645;'/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 1 out of 5567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5567/5567 places, 8854/8854 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5566 transition count 8842
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5566 transition count 8842
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 5565 transition count 8841
Applied a total of 4 rules in 1440 ms. Remains 5565 /5567 variables (removed 2) and now considering 8841/8854 (removed 13) transitions.
[2024-05-25 16:20:13] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2024-05-25 16:20:14] [INFO ] Computed 1301 invariants in 237 ms
[2024-05-25 16:20:18] [INFO ] Implicit Places using invariants in 4604 ms returned []
[2024-05-25 16:20:18] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2024-05-25 16:20:18] [INFO ] Invariant cache hit.
[2024-05-25 16:20:22] [INFO ] Implicit Places using invariants and state equation in 4205 ms returned []
Implicit Place search using SMT with State Equation took 8809 ms to find 0 implicit places.
[2024-05-25 16:20:23] [INFO ] Redundant transitions in 768 ms returned []
[2024-05-25 16:20:23] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2024-05-25 16:20:23] [INFO ] Invariant cache hit.
[2024-05-25 16:20:28] [INFO ] Dead Transitions using invariants and state equation in 5317 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5565/5567 places, 8841/8854 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16346 ms. Remains : 5565/5567 places, 8841/8854 transitions.
Built C files in :
/tmp/ltsmin13083178605004493208
[2024-05-25 16:20:28] [INFO ] Too many transitions (8841) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:20:28] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13083178605004493208
Running compilation step : cd /tmp/ltsmin13083178605004493208;'/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/ltsmin13083178605004493208;'/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/ltsmin13083178605004493208;'/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-25 16:20:32] [INFO ] Flatten gal took : 207 ms
[2024-05-25 16:20:32] [INFO ] Flatten gal took : 214 ms
[2024-05-25 16:20:32] [INFO ] Time to serialize gal into /tmp/LTL17447647465331618955.gal : 40 ms
[2024-05-25 16:20:32] [INFO ] Time to serialize properties into /tmp/LTL11148874467273812710.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/LTL17447647465331618955.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9615347622372925046.hoa' '-atoms' '/tmp/LTL11148874467273812710.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/LTL11148874467273812710.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9615347622372925046.hoa
Detected timeout of ITS tools.
[2024-05-25 16:20:48] [INFO ] Flatten gal took : 214 ms
[2024-05-25 16:20:48] [INFO ] Flatten gal took : 322 ms
[2024-05-25 16:20:48] [INFO ] Time to serialize gal into /tmp/LTL13611421857393481206.gal : 41 ms
[2024-05-25 16:20:48] [INFO ] Time to serialize properties into /tmp/LTL12562814483984555954.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13611421857393481206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12562814483984555954.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 : !(((G("(Node1HasTheLeafSetOfRx7ToReplaceNode19<1)"))&&(X((G("((Node10ManageTheCrashOfNode1<1)||(Lx11IsAtTheLeftExtremityOfTheLeafSet<1...768
Formula 0 simplified : F!"(Node1HasTheLeafSetOfRx7ToReplaceNode19<1)" | X(F!"((Node10ManageTheCrashOfNode1<1)||(Lx11IsAtTheLeftExtremityOfTheLeafSet<1))" &...642
Detected timeout of ITS tools.
[2024-05-25 16:21:04] [INFO ] Flatten gal took : 219 ms
[2024-05-25 16:21:04] [INFO ] Applying decomposition
[2024-05-25 16:21:04] [INFO ] Flatten gal took : 235 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/graph2963069743416668963.txt' '-o' '/tmp/graph2963069743416668963.bin' '-w' '/tmp/graph2963069743416668963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2963069743416668963.bin' '-l' '-1' '-v' '-w' '/tmp/graph2963069743416668963.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:21:04] [INFO ] Decomposing Gal with order
[2024-05-25 16:21:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:21:06] [INFO ] Removed a total of 7501 redundant transitions.
[2024-05-25 16:21:06] [INFO ] Flatten gal took : 1251 ms
[2024-05-25 16:21:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 5196 labels/synchronizations in 426 ms.
[2024-05-25 16:21:07] [INFO ] Time to serialize gal into /tmp/LTL10023684995344924991.gal : 69 ms
[2024-05-25 16:21:07] [INFO ] Time to serialize properties into /tmp/LTL6558567859765844661.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/LTL10023684995344924991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6558567859765844661.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 : !(((G("(i16.i1.u394.Node1HasTheLeafSetOfRx7ToReplaceNode19<1)"))&&(X((G("((i0.i0.u371.Node10ManageTheCrashOfNode1<1)||(i0.i0.u0.Lx11Is...894
Formula 0 simplified : F!"(i16.i1.u394.Node1HasTheLeafSetOfRx7ToReplaceNode19<1)" | X(F!"((i0.i0.u371.Node10ManageTheCrashOfNode1<1)||(i0.i0.u0.Lx11IsAtThe...754
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16144827280988319041
[2024-05-25 16:21:22] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16144827280988319041
Running compilation step : cd /tmp/ltsmin16144827280988319041;'/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/ltsmin16144827280988319041;'/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/ltsmin16144827280988319041;'/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 MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-13 finished in 281701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7200 transitions
Trivial Post-agglo rules discarded 7200 transitions
Performed 7200 trivial Post agglomeration. Transition count delta: 7200
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 22675
Reduce places removed 7200 places and 0 transitions.
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 25 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6600 places :
Symmetric choice reduction at 2 with 6600 rule applications. Total rules 22200 place count 6160 transition count 15475
Iterating global reduction 2 with 6600 rules applied. Total rules applied 28800 place count 6160 transition count 15475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28800 place count 6160 transition count 15451
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 28848 place count 6136 transition count 15451
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29397 place count 5587 transition count 8863
Iterating global reduction 2 with 549 rules applied. Total rules applied 29946 place count 5587 transition count 8863
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 29996 place count 5562 transition count 8838
Applied a total of 29996 rules in 3596 ms. Remains 5562 /20560 variables (removed 14998) and now considering 8838/29875 (removed 21037) transitions.
[2024-05-25 16:21:29] [INFO ] Flow matrix only has 8238 transitions (discarded 600 similar events)
// Phase 1: matrix 8238 rows 5562 cols
[2024-05-25 16:21:29] [INFO ] Computed 1301 invariants in 234 ms
[2024-05-25 16:21:33] [INFO ] Implicit Places using invariants in 4773 ms returned []
[2024-05-25 16:21:33] [INFO ] Flow matrix only has 8238 transitions (discarded 600 similar events)
[2024-05-25 16:21:33] [INFO ] Invariant cache hit.
[2024-05-25 16:21:38] [INFO ] Implicit Places using invariants and state equation in 4311 ms returned []
Implicit Place search using SMT with State Equation took 9086 ms to find 0 implicit places.
[2024-05-25 16:21:39] [INFO ] Redundant transitions in 1001 ms returned []
[2024-05-25 16:21:39] [INFO ] Flow matrix only has 8238 transitions (discarded 600 similar events)
[2024-05-25 16:21:39] [INFO ] Invariant cache hit.
[2024-05-25 16:21:44] [INFO ] Dead Transitions using invariants and state equation in 5376 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5562/20560 places, 8838/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19072 ms. Remains : 5562/20560 places, 8838/29875 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s245 1) (GEQ s5507 1)) (AND (GEQ s2 1) (GEQ s1946 1) (GEQ s3148 1) (GEQ s3149 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-14 finished in 19147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F((p1||G(p2))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(F(G(!p2))&&p1))))'
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 U (p1||G(!p0))))))'
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)&&X((G(p1)||(!p2 U (p3||G(!p2)))))))'
[2024-05-25 16:21:45] [INFO ] Flatten gal took : 812 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2513235015315266212
[2024-05-25 16:21:46] [INFO ] Too many transitions (29875) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:21:46] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2513235015315266212
Running compilation step : cd /tmp/ltsmin2513235015315266212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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-25 16:21:46] [INFO ] Applying decomposition
[2024-05-25 16:21:47] [INFO ] Flatten gal took : 975 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/graph18064412027419877484.txt' '-o' '/tmp/graph18064412027419877484.bin' '-w' '/tmp/graph18064412027419877484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18064412027419877484.bin' '-l' '-1' '-v' '-w' '/tmp/graph18064412027419877484.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:21:49] [INFO ] Decomposing Gal with order
[2024-05-25 16:21:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:21:57] [INFO ] Removed a total of 18990 redundant transitions.
[2024-05-25 16:21:57] [INFO ] Flatten gal took : 3032 ms
[2024-05-25 16:21:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1499 labels/synchronizations in 495 ms.
[2024-05-25 16:21:58] [INFO ] Time to serialize gal into /tmp/LTLFireability10140373877720373746.gal : 159 ms
[2024-05-25 16:21:58] [INFO ] Time to serialize properties into /tmp/LTLFireability16519820272877206600.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/LTLFireability10140373877720373746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16519820272877206600.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...278
Read 4 LTL properties
Checking formula 0 : !((G(F(("((i13.u415.Node22HasAskedItsLeafSetToRx6ToReplaceNode19<1)||(i13.u415.LeafSetOfRx6IsSentToNode22<1))")||(G(F(("((i10.u412.Nod...371
Formula 0 simplified : G(F!"((i2.u150.Node5ThinksNode6ShouldBeNodeMasterToReplaceNode12>=1)&&(i1.u242.NodesCanDetectThatNode6HasCrashed>=1))" & FG(!"((i10....358
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/ltsmin2513235015315266212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 180 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2513235015315266212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 180 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)
ITS-tools command line returned an error code 137
[2024-05-25 16:31:12] [INFO ] Flatten gal took : 1382 ms
[2024-05-25 16:31:12] [INFO ] Time to serialize gal into /tmp/LTLFireability11411258618150290751.gal : 126 ms
[2024-05-25 16:31:12] [INFO ] Time to serialize properties into /tmp/LTLFireability11716673284571446874.ltl : 6 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/LTLFireability11411258618150290751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11716673284571446874.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...299
Read 4 LTL properties
Checking formula 0 : !((G(F(("((Node22HasAskedItsLeafSetToRx6ToReplaceNode19<1)||(LeafSetOfRx6IsSentToNode22<1))")||(G(F(("((Node2HasAskedItsLeafSetToRx3To...319
Formula 0 simplified : G(F!"((Node5ThinksNode6ShouldBeNodeMasterToReplaceNode12>=1)&&(NodesCanDetectThatNode6HasCrashed>=1))" & FG(!"((Node2HasAskedItsLeaf...306
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7986176 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11459624 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S24C12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372000088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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