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.r158-smll-171636266300188.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 itstools
Input is EisenbergMcGuire-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716545824084

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 10:17:06] [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-24 10:17:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 10:17:06] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2024-05-24 10:17:06] [INFO ] Transformed 712 places.
[2024-05-24 10:17:06] [INFO ] Transformed 2816 transitions.
[2024-05-24 10:17:06] [INFO ] Found NUPN structural information;
[2024-05-24 10:17:06] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 596 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 135 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 663 transition count 2424
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 663 transition count 2424
Applied a total of 98 rules in 236 ms. Remains 663 /712 variables (removed 49) and now considering 2424/2816 (removed 392) transitions.
[2024-05-24 10:17:07] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
// Phase 1: matrix 976 rows 663 cols
[2024-05-24 10:17:07] [INFO ] Computed 25 invariants in 24 ms
[2024-05-24 10:17:08] [INFO ] Implicit Places using invariants in 982 ms returned []
[2024-05-24 10:17:08] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-05-24 10:17:08] [INFO ] Invariant cache hit.
[2024-05-24 10:17:09] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-24 10:17:13] [INFO ] Implicit Places using invariants and state equation in 4976 ms returned []
Implicit Place search using SMT with State Equation took 6118 ms to find 0 implicit places.
Running 2416 sub problems to find dead transitions.
[2024-05-24 10:17:13] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-05-24 10:17:13] [INFO ] Invariant cache hit.
[2024-05-24 10:17:13] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2416 unsolved
SMT process timed out in 32703ms, After SMT, problems are : Problem set: 0 solved, 2416 unsolved
Search for dead transitions found 0 dead transitions in 32808ms
Starting structural reductions in LTL mode, iteration 1 : 663/712 places, 2424/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39240 ms. Remains : 663/712 places, 2424/2816 transitions.
Support contains 38 out of 663 places after structural reductions.
[2024-05-24 10:17:47] [INFO ] Flatten gal took : 258 ms
[2024-05-24 10:17:47] [INFO ] Flatten gal took : 172 ms
[2024-05-24 10:17:47] [INFO ] Input system was already deterministic with 2424 transitions.
Support contains 35 out of 663 places (down from 38) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (8 resets) in 1967 ms. (20 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
[2024-05-24 10:17:48] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-05-24 10:17:48] [INFO ] Invariant cache hit.
[2024-05-24 10:17:48] [INFO ] State equation strengthened by 333 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 517/548 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 25/573 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 64/637 variables, 8/23 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 26/663 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 976/1639 variables, 663/688 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1639 variables, 333/1021 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1639 variables, 0/1021 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/1639 variables, 0/1021 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1639/1639 variables, and 1021 constraints, problems are : Problem set: 1 solved, 14 unsolved in 2472 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 663/663 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 519/548 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 25/573 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 64/637 variables, 8/23 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-24 10:17:52] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 28 ms to minimize.
[2024-05-24 10:17:52] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2024-05-24 10:17:52] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 10:17:53] [INFO ] Deduced a trap composed of 142 places in 495 ms of which 6 ms to minimize.
[2024-05-24 10:17:53] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 3 ms to minimize.
[2024-05-24 10:17:53] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-05-24 10:17:54] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 3 ms to minimize.
[2024-05-24 10:17:54] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-24 10:17:54] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 9/32 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-24 10:17:55] [INFO ] Deduced a trap composed of 100 places in 424 ms of which 5 ms to minimize.
[2024-05-24 10:17:55] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-24 10:17:55] [INFO ] Deduced a trap composed of 143 places in 411 ms of which 8 ms to minimize.
[2024-05-24 10:17:55] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 4/36 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/1639 variables, and 36 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/663 constraints, ReadFeed: 0/333 constraints, PredecessorRefiner: 0/15 constraints, Known Traps: 13/13 constraints]
After SMT, in 7562ms problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 655 transition count 2218
Deduced a syphon composed of 198 places in 5 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 457 transition count 2218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 415 place count 454 transition count 2194
Iterating global reduction 2 with 3 rules applied. Total rules applied 418 place count 454 transition count 2194
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 530 place count 398 transition count 2138
Applied a total of 530 rules in 473 ms. Remains 398 /663 variables (removed 265) and now considering 2138/2424 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 398/663 places, 2138/2424 transitions.
RANDOM walk for 40000 steps (8 resets) in 1013 ms. (39 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 155925 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :1 out of 13
Probabilistic random walk after 155925 steps, saw 91079 distinct states, run finished after 3006 ms. (steps per millisecond=51 ) properties seen :1
[2024-05-24 10:18:00] [INFO ] Flow matrix only has 690 transitions (discarded 1448 similar events)
// Phase 1: matrix 690 rows 398 cols
[2024-05-24 10:18:00] [INFO ] Computed 25 invariants in 6 ms
[2024-05-24 10:18:00] [INFO ] State equation strengthened by 312 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 303/332 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 10/342 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 46/388 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 10/398 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 690/1088 variables, 398/423 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1088 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1088 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/1088 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 735 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1630 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 398/398 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 303/332 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 10/342 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 46/388 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-24 10:18:02] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 2 ms to minimize.
[2024-05-24 10:18:03] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
[2024-05-24 10:18:03] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-05-24 10:18:03] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-05-24 10:18:03] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-24 10:18:03] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 2 ms to minimize.
[2024-05-24 10:18:03] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 2 ms to minimize.
[2024-05-24 10:18:04] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 2 ms to minimize.
[2024-05-24 10:18:04] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 2 ms to minimize.
[2024-05-24 10:18:04] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 10/398 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-24 10:18:04] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-24 10:18:05] [INFO ] Deduced a trap composed of 76 places in 521 ms of which 6 ms to minimize.
[2024-05-24 10:18:05] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2024-05-24 10:18:05] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 690/1088 variables, 398/437 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1088 variables, 312/749 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1088 variables, 12/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1088 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/1088 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 761 constraints, problems are : Problem set: 0 solved, 12 unsolved in 6390 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 398/398 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 14/14 constraints]
After SMT, in 8075ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 1 properties in 15465 ms.
Support contains 28 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 2138/2138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 397 transition count 2130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 397 transition count 2130
Applied a total of 2 rules in 97 ms. Remains 397 /398 variables (removed 1) and now considering 2130/2138 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 397/398 places, 2130/2138 transitions.
RANDOM walk for 40000 steps (8 resets) in 354 ms. (112 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 184536 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 11
Probabilistic random walk after 184536 steps, saw 108009 distinct states, run finished after 3004 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-24 10:18:27] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
// Phase 1: matrix 682 rows 397 cols
[2024-05-24 10:18:27] [INFO ] Computed 25 invariants in 24 ms
[2024-05-24 10:18:27] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 303/331 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 10/341 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 46/387 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 10/397 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 682/1079 variables, 397/422 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1079 variables, 305/727 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1079 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/1079 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 727 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1995 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 397/397 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 303/331 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 10/341 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 46/387 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 10:18:30] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 4 ms to minimize.
[2024-05-24 10:18:30] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-05-24 10:18:30] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-24 10:18:30] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-05-24 10:18:31] [INFO ] Deduced a trap composed of 22 places in 428 ms of which 5 ms to minimize.
[2024-05-24 10:18:31] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2024-05-24 10:18:31] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 3 ms to minimize.
[2024-05-24 10:18:32] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-24 10:18:32] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 2 ms to minimize.
[2024-05-24 10:18:32] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 10/397 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 10:18:33] [INFO ] Deduced a trap composed of 98 places in 536 ms of which 5 ms to minimize.
[2024-05-24 10:18:33] [INFO ] Deduced a trap composed of 98 places in 533 ms of which 5 ms to minimize.
[2024-05-24 10:18:33] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 3 ms to minimize.
[2024-05-24 10:18:34] [INFO ] Deduced a trap composed of 21 places in 390 ms of which 5 ms to minimize.
[2024-05-24 10:18:34] [INFO ] Deduced a trap composed of 41 places in 522 ms of which 5 ms to minimize.
[2024-05-24 10:18:35] [INFO ] Deduced a trap composed of 95 places in 415 ms of which 5 ms to minimize.
[2024-05-24 10:18:35] [INFO ] Deduced a trap composed of 91 places in 495 ms of which 6 ms to minimize.
[2024-05-24 10:18:36] [INFO ] Deduced a trap composed of 77 places in 563 ms of which 5 ms to minimize.
[2024-05-24 10:18:37] [INFO ] Deduced a trap composed of 74 places in 616 ms of which 7 ms to minimize.
[2024-05-24 10:18:37] [INFO ] Deduced a trap composed of 90 places in 653 ms of which 7 ms to minimize.
[2024-05-24 10:18:38] [INFO ] Deduced a trap composed of 83 places in 620 ms of which 6 ms to minimize.
[2024-05-24 10:18:39] [INFO ] Deduced a trap composed of 81 places in 611 ms of which 6 ms to minimize.
[2024-05-24 10:18:39] [INFO ] Deduced a trap composed of 60 places in 619 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 10:18:40] [INFO ] Deduced a trap composed of 80 places in 531 ms of which 6 ms to minimize.
[2024-05-24 10:18:41] [INFO ] Deduced a trap composed of 91 places in 604 ms of which 6 ms to minimize.
[2024-05-24 10:18:41] [INFO ] Deduced a trap composed of 83 places in 614 ms of which 6 ms to minimize.
[2024-05-24 10:18:42] [INFO ] Deduced a trap composed of 75 places in 624 ms of which 6 ms to minimize.
[2024-05-24 10:18:43] [INFO ] Deduced a trap composed of 129 places in 607 ms of which 7 ms to minimize.
[2024-05-24 10:18:43] [INFO ] Deduced a trap composed of 84 places in 608 ms of which 6 ms to minimize.
[2024-05-24 10:18:44] [INFO ] Deduced a trap composed of 77 places in 598 ms of which 6 ms to minimize.
[2024-05-24 10:18:44] [INFO ] Deduced a trap composed of 104 places in 670 ms of which 7 ms to minimize.
[2024-05-24 10:18:45] [INFO ] Deduced a trap composed of 79 places in 635 ms of which 6 ms to minimize.
[2024-05-24 10:18:46] [INFO ] Deduced a trap composed of 81 places in 648 ms of which 6 ms to minimize.
[2024-05-24 10:18:46] [INFO ] Deduced a trap composed of 68 places in 650 ms of which 6 ms to minimize.
[2024-05-24 10:18:47] [INFO ] Deduced a trap composed of 76 places in 604 ms of which 6 ms to minimize.
[2024-05-24 10:18:48] [INFO ] Deduced a trap composed of 78 places in 593 ms of which 6 ms to minimize.
[2024-05-24 10:18:48] [INFO ] Deduced a trap composed of 75 places in 591 ms of which 5 ms to minimize.
[2024-05-24 10:18:49] [INFO ] Deduced a trap composed of 87 places in 557 ms of which 6 ms to minimize.
[2024-05-24 10:18:49] [INFO ] Deduced a trap composed of 31 places in 609 ms of which 6 ms to minimize.
[2024-05-24 10:18:50] [INFO ] Deduced a trap composed of 27 places in 543 ms of which 6 ms to minimize.
[2024-05-24 10:18:51] [INFO ] Deduced a trap composed of 108 places in 607 ms of which 6 ms to minimize.
[2024-05-24 10:18:51] [INFO ] Deduced a trap composed of 76 places in 597 ms of which 6 ms to minimize.
[2024-05-24 10:18:52] [INFO ] Deduced a trap composed of 53 places in 612 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 10:18:53] [INFO ] Deduced a trap composed of 103 places in 558 ms of which 7 ms to minimize.
[2024-05-24 10:18:53] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 4 ms to minimize.
[2024-05-24 10:18:53] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 3 ms to minimize.
[2024-05-24 10:18:54] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-24 10:18:54] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 3 ms to minimize.
[2024-05-24 10:18:54] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-05-24 10:18:54] [INFO ] Deduced a trap composed of 74 places in 510 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 10:18:55] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 682/1079 variables, 397/473 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1079 variables, 305/778 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1079 variables, 11/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1079 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 0/1079 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 789 constraints, problems are : Problem set: 0 solved, 11 unsolved in 29164 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 397/397 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 51/51 constraints]
After SMT, in 31219ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 13715 ms.
Support contains 28 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 2130/2130 transitions.
Applied a total of 0 rules in 92 ms. Remains 397 /397 variables (removed 0) and now considering 2130/2130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 397/397 places, 2130/2130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 2130/2130 transitions.
Applied a total of 0 rules in 73 ms. Remains 397 /397 variables (removed 0) and now considering 2130/2130 (removed 0) transitions.
[2024-05-24 10:19:12] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
[2024-05-24 10:19:12] [INFO ] Invariant cache hit.
[2024-05-24 10:19:13] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-24 10:19:13] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
[2024-05-24 10:19:13] [INFO ] Invariant cache hit.
[2024-05-24 10:19:13] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-24 10:19:15] [INFO ] Implicit Places using invariants and state equation in 2395 ms returned []
Implicit Place search using SMT with State Equation took 3117 ms to find 0 implicit places.
[2024-05-24 10:19:16] [INFO ] Redundant transitions in 133 ms returned []
Running 2122 sub problems to find dead transitions.
[2024-05-24 10:19:16] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
[2024-05-24 10:19:16] [INFO ] Invariant cache hit.
[2024-05-24 10:19:16] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
[2024-05-24 10:19:42] [INFO ] Deduced a trap composed of 3 places in 639 ms of which 6 ms to minimize.
[2024-05-24 10:19:43] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 4 ms to minimize.
[2024-05-24 10:19:43] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 3 ms to minimize.
[2024-05-24 10:19:43] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 3 ms to minimize.
[2024-05-24 10:19:43] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-24 10:19:43] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 10:19:44] [INFO ] Deduced a trap composed of 43 places in 318 ms of which 5 ms to minimize.
[2024-05-24 10:19:46] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-24 10:19:47] [INFO ] Deduced a trap composed of 45 places in 360 ms of which 5 ms to minimize.
[2024-05-24 10:19:47] [INFO ] Deduced a trap composed of 44 places in 362 ms of which 5 ms to minimize.
SMT process timed out in 31886ms, After SMT, problems are : Problem set: 0 solved, 2122 unsolved
Search for dead transitions found 0 dead transitions in 31914ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35253 ms. Remains : 397/397 places, 2130/2130 transitions.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&(p1 U p2)))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 658 transition count 2384
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 658 transition count 2384
Applied a total of 10 rules in 70 ms. Remains 658 /663 variables (removed 5) and now considering 2384/2424 (removed 40) transitions.
[2024-05-24 10:19:48] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
// Phase 1: matrix 936 rows 658 cols
[2024-05-24 10:19:48] [INFO ] Computed 25 invariants in 8 ms
[2024-05-24 10:19:49] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-24 10:19:49] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2024-05-24 10:19:49] [INFO ] Invariant cache hit.
[2024-05-24 10:19:50] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-24 10:19:54] [INFO ] Implicit Places using invariants and state equation in 5352 ms returned []
Implicit Place search using SMT with State Equation took 6329 ms to find 0 implicit places.
Running 2376 sub problems to find dead transitions.
[2024-05-24 10:19:54] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2024-05-24 10:19:54] [INFO ] Invariant cache hit.
[2024-05-24 10:19:54] [INFO ] State equation strengthened by 298 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2376 unsolved
SMT process timed out in 31790ms, After SMT, problems are : Problem set: 0 solved, 2376 unsolved
Search for dead transitions found 0 dead transitions in 31828ms
Starting structural reductions in LTL mode, iteration 1 : 658/663 places, 2384/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38240 ms. Remains : 658/663 places, 2384/2424 transitions.
Stuttering acceptance computed with spot in 523 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), true, (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-00 finished in 38948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 64 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 10:20:27] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-05-24 10:20:27] [INFO ] Computed 25 invariants in 7 ms
[2024-05-24 10:20:28] [INFO ] Implicit Places using invariants in 1053 ms returned []
[2024-05-24 10:20:28] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:20:28] [INFO ] Invariant cache hit.
[2024-05-24 10:20:29] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:20:32] [INFO ] Implicit Places using invariants and state equation in 4608 ms returned []
Implicit Place search using SMT with State Equation took 5663 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-05-24 10:20:32] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:20:32] [INFO ] Invariant cache hit.
[2024-05-24 10:20:32] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31905ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31934ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37673 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-02 finished in 37820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 361 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-05-24 10:21:05] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 10:21:05] [INFO ] Computed 25 invariants in 7 ms
[2024-05-24 10:21:06] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-24 10:21:06] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:21:06] [INFO ] Invariant cache hit.
[2024-05-24 10:21:06] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 10:21:08] [INFO ] Implicit Places using invariants and state equation in 2344 ms returned []
Implicit Place search using SMT with State Equation took 3151 ms to find 0 implicit places.
[2024-05-24 10:21:08] [INFO ] Redundant transitions in 155 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 10:21:08] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:21:08] [INFO ] Invariant cache hit.
[2024-05-24 10:21:08] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:21:33] [INFO ] Deduced a trap composed of 3 places in 555 ms of which 6 ms to minimize.
[2024-05-24 10:21:34] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 2 ms to minimize.
[2024-05-24 10:21:34] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 3 ms to minimize.
[2024-05-24 10:21:34] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-05-24 10:21:34] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2024-05-24 10:21:34] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-24 10:21:34] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 10:21:35] [INFO ] Deduced a trap composed of 60 places in 271 ms of which 4 ms to minimize.
[2024-05-24 10:21:35] [INFO ] Deduced a trap composed of 76 places in 297 ms of which 5 ms to minimize.
[2024-05-24 10:21:35] [INFO ] Deduced a trap composed of 21 places in 324 ms of which 4 ms to minimize.
[2024-05-24 10:21:37] [INFO ] Deduced a trap composed of 70 places in 340 ms of which 5 ms to minimize.
[2024-05-24 10:21:38] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 5 ms to minimize.
[2024-05-24 10:21:38] [INFO ] Deduced a trap composed of 89 places in 322 ms of which 5 ms to minimize.
[2024-05-24 10:21:38] [INFO ] Deduced a trap composed of 37 places in 346 ms of which 4 ms to minimize.
[2024-05-24 10:21:39] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 5 ms to minimize.
[2024-05-24 10:21:39] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 2 ms to minimize.
[2024-05-24 10:21:39] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 10:21:39] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-05-24 10:21:39] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-05-24 10:21:40] [INFO ] Deduced a trap composed of 73 places in 352 ms of which 3 ms to minimize.
SMT process timed out in 31432ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 31455ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35142 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-03
Product exploration explored 100000 steps with 637 reset in 425 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-03 finished in 35694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 188 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-05-24 10:21:40] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 10:21:40] [INFO ] Computed 25 invariants in 6 ms
[2024-05-24 10:21:41] [INFO ] Implicit Places using invariants in 766 ms returned []
[2024-05-24 10:21:41] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:21:41] [INFO ] Invariant cache hit.
[2024-05-24 10:21:42] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 10:21:44] [INFO ] Implicit Places using invariants and state equation in 2659 ms returned []
Implicit Place search using SMT with State Equation took 3440 ms to find 0 implicit places.
[2024-05-24 10:21:44] [INFO ] Redundant transitions in 59 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 10:21:44] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:21:44] [INFO ] Invariant cache hit.
[2024-05-24 10:21:44] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:22:09] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 4 ms to minimize.
[2024-05-24 10:22:09] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2024-05-24 10:22:09] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2024-05-24 10:22:09] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-24 10:22:10] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-24 10:22:10] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-24 10:22:10] [INFO ] Deduced a trap composed of 60 places in 237 ms of which 3 ms to minimize.
[2024-05-24 10:22:10] [INFO ] Deduced a trap composed of 77 places in 374 ms of which 5 ms to minimize.
[2024-05-24 10:22:12] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-05-24 10:22:12] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 3 ms to minimize.
[2024-05-24 10:22:13] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 3 ms to minimize.
[2024-05-24 10:22:13] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 3 ms to minimize.
[2024-05-24 10:22:13] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 3 ms to minimize.
[2024-05-24 10:22:14] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-24 10:22:14] [INFO ] Deduced a trap composed of 76 places in 350 ms of which 3 ms to minimize.
[2024-05-24 10:22:14] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 4 ms to minimize.
[2024-05-24 10:22:15] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-24 10:22:15] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 3 ms to minimize.
[2024-05-24 10:22:16] [INFO ] Deduced a trap composed of 68 places in 268 ms of which 3 ms to minimize.
[2024-05-24 10:22:16] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 4 ms to minimize.
SMT process timed out in 31996ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 32019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35718 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 455 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-04 finished in 36284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 448 transition count 2160
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 542 place count 392 transition count 2104
Applied a total of 542 rules in 246 ms. Remains 392 /663 variables (removed 271) and now considering 2104/2424 (removed 320) transitions.
[2024-05-24 10:22:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 10:22:17] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 10:22:18] [INFO ] Implicit Places using invariants in 957 ms returned []
[2024-05-24 10:22:18] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:22:18] [INFO ] Invariant cache hit.
[2024-05-24 10:22:18] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:22:20] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3507 ms to find 0 implicit places.
[2024-05-24 10:22:20] [INFO ] Redundant transitions in 99 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:22:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:22:20] [INFO ] Invariant cache hit.
[2024-05-24 10:22:20] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:22:45] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 4 ms to minimize.
[2024-05-24 10:22:45] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-05-24 10:22:45] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2024-05-24 10:22:45] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-05-24 10:22:45] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-24 10:22:45] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 10:22:46] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 5 ms to minimize.
[2024-05-24 10:22:46] [INFO ] Deduced a trap composed of 71 places in 256 ms of which 5 ms to minimize.
[2024-05-24 10:22:46] [INFO ] Deduced a trap composed of 28 places in 431 ms of which 4 ms to minimize.
[2024-05-24 10:22:47] [INFO ] Deduced a trap composed of 61 places in 369 ms of which 5 ms to minimize.
[2024-05-24 10:22:47] [INFO ] Deduced a trap composed of 22 places in 319 ms of which 4 ms to minimize.
[2024-05-24 10:22:47] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 3 ms to minimize.
[2024-05-24 10:22:48] [INFO ] Deduced a trap composed of 29 places in 283 ms of which 3 ms to minimize.
[2024-05-24 10:22:48] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 2 ms to minimize.
[2024-05-24 10:22:48] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 4 ms to minimize.
[2024-05-24 10:22:48] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 3 ms to minimize.
[2024-05-24 10:22:48] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-24 10:22:49] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-05-24 10:22:50] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 3 ms to minimize.
[2024-05-24 10:22:51] [INFO ] Deduced a trap composed of 15 places in 343 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:22:52] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 3 ms to minimize.
SMT process timed out in 31716ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31755ms
Starting structural reductions in SI_LTL mode, iteration 1 : 392/663 places, 2104/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35624 ms. Remains : 392/663 places, 2104/2424 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 369 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-07 finished in 36055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 421 place count 450 transition count 2176
Iterating global reduction 2 with 5 rules applied. Total rules applied 426 place count 450 transition count 2176
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2120
Applied a total of 538 rules in 157 ms. Remains 394 /663 variables (removed 269) and now considering 2120/2424 (removed 304) transitions.
[2024-05-24 10:22:53] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
// Phase 1: matrix 672 rows 394 cols
[2024-05-24 10:22:53] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 10:22:53] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-24 10:22:53] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2024-05-24 10:22:53] [INFO ] Invariant cache hit.
[2024-05-24 10:22:54] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-24 10:22:56] [INFO ] Implicit Places using invariants and state equation in 2337 ms returned []
Implicit Place search using SMT with State Equation took 2977 ms to find 0 implicit places.
[2024-05-24 10:22:56] [INFO ] Redundant transitions in 100 ms returned []
Running 2112 sub problems to find dead transitions.
[2024-05-24 10:22:56] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2024-05-24 10:22:56] [INFO ] Invariant cache hit.
[2024-05-24 10:22:56] [INFO ] State equation strengthened by 298 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
[2024-05-24 10:23:19] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 4 ms to minimize.
[2024-05-24 10:23:19] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 2 ms to minimize.
[2024-05-24 10:23:19] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2024-05-24 10:23:19] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-05-24 10:23:19] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-05-24 10:23:19] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-05-24 10:23:20] [INFO ] Deduced a trap composed of 43 places in 312 ms of which 5 ms to minimize.
[2024-05-24 10:23:20] [INFO ] Deduced a trap composed of 75 places in 342 ms of which 4 ms to minimize.
[2024-05-24 10:23:22] [INFO ] Deduced a trap composed of 54 places in 350 ms of which 5 ms to minimize.
[2024-05-24 10:23:23] [INFO ] Deduced a trap composed of 50 places in 361 ms of which 3 ms to minimize.
[2024-05-24 10:23:23] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 3 ms to minimize.
[2024-05-24 10:23:23] [INFO ] Deduced a trap composed of 52 places in 243 ms of which 3 ms to minimize.
[2024-05-24 10:23:24] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 3 ms to minimize.
[2024-05-24 10:23:24] [INFO ] Deduced a trap composed of 69 places in 274 ms of which 3 ms to minimize.
[2024-05-24 10:23:25] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 3 ms to minimize.
[2024-05-24 10:23:25] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2024-05-24 10:23:25] [INFO ] Deduced a trap composed of 78 places in 294 ms of which 4 ms to minimize.
[2024-05-24 10:23:26] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 4 ms to minimize.
[2024-05-24 10:23:26] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-24 10:23:26] [INFO ] Deduced a trap composed of 44 places in 317 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1066 variables, and 45 constraints, problems are : Problem set: 0 solved, 2112 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/298 constraints, PredecessorRefiner: 2112/2112 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
[2024-05-24 10:23:34] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-05-24 10:23:35] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-24 10:23:35] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 3 ms to minimize.
[2024-05-24 10:23:36] [INFO ] Deduced a trap composed of 60 places in 267 ms of which 3 ms to minimize.
[2024-05-24 10:23:36] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 3 ms to minimize.
[2024-05-24 10:23:36] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 4 ms to minimize.
[2024-05-24 10:23:37] [INFO ] Deduced a trap composed of 52 places in 292 ms of which 4 ms to minimize.
[2024-05-24 10:23:37] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-24 10:23:38] [INFO ] Deduced a trap composed of 61 places in 318 ms of which 5 ms to minimize.
[2024-05-24 10:23:38] [INFO ] Deduced a trap composed of 60 places in 322 ms of which 5 ms to minimize.
[2024-05-24 10:23:39] [INFO ] Deduced a trap composed of 58 places in 321 ms of which 4 ms to minimize.
[2024-05-24 10:23:41] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 3 ms to minimize.
[2024-05-24 10:23:41] [INFO ] Deduced a trap composed of 59 places in 362 ms of which 4 ms to minimize.
[2024-05-24 10:23:41] [INFO ] Deduced a trap composed of 70 places in 367 ms of which 5 ms to minimize.
[2024-05-24 10:23:42] [INFO ] Deduced a trap composed of 71 places in 319 ms of which 5 ms to minimize.
[2024-05-24 10:23:42] [INFO ] Deduced a trap composed of 72 places in 361 ms of which 5 ms to minimize.
[2024-05-24 10:23:43] [INFO ] Deduced a trap composed of 58 places in 352 ms of which 4 ms to minimize.
[2024-05-24 10:23:43] [INFO ] Deduced a trap composed of 70 places in 297 ms of which 5 ms to minimize.
[2024-05-24 10:23:43] [INFO ] Deduced a trap composed of 69 places in 349 ms of which 4 ms to minimize.
[2024-05-24 10:23:44] [INFO ] Deduced a trap composed of 48 places in 355 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
[2024-05-24 10:23:45] [INFO ] Deduced a trap composed of 73 places in 301 ms of which 4 ms to minimize.
[2024-05-24 10:23:45] [INFO ] Deduced a trap composed of 62 places in 308 ms of which 4 ms to minimize.
[2024-05-24 10:23:46] [INFO ] Deduced a trap composed of 29 places in 335 ms of which 5 ms to minimize.
[2024-05-24 10:23:46] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 4 ms to minimize.
[2024-05-24 10:23:46] [INFO ] Deduced a trap composed of 77 places in 384 ms of which 5 ms to minimize.
[2024-05-24 10:23:47] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 3 ms to minimize.
[2024-05-24 10:23:48] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-24 10:23:48] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-24 10:23:49] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-24 10:23:49] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2024-05-24 10:23:49] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 3 ms to minimize.
[2024-05-24 10:23:49] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 3 ms to minimize.
[2024-05-24 10:23:50] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 2 ms to minimize.
[2024-05-24 10:23:51] [INFO ] Deduced a trap composed of 13 places in 411 ms of which 6 ms to minimize.
[2024-05-24 10:23:51] [INFO ] Deduced a trap composed of 67 places in 455 ms of which 6 ms to minimize.
[2024-05-24 10:23:52] [INFO ] Deduced a trap composed of 27 places in 380 ms of which 5 ms to minimize.
[2024-05-24 10:23:52] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 3 ms to minimize.
[2024-05-24 10:23:52] [INFO ] Deduced a trap composed of 24 places in 414 ms of which 5 ms to minimize.
[2024-05-24 10:23:54] [INFO ] Deduced a trap composed of 78 places in 421 ms of which 4 ms to minimize.
[2024-05-24 10:23:54] [INFO ] Deduced a trap composed of 79 places in 333 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1066 variables, and 85 constraints, problems are : Problem set: 0 solved, 2112 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/298 constraints, PredecessorRefiner: 0/2112 constraints, Known Traps: 60/60 constraints]
After SMT, in 61538ms problems are : Problem set: 0 solved, 2112 unsolved
Search for dead transitions found 0 dead transitions in 61576ms
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2120/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64830 ms. Remains : 394/663 places, 2120/2424 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 321 ms.
Stack based approach found an accepted trace after 457 steps with 0 reset with depth 458 and stack size 395 in 2 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-09 finished in 65278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p1)&&p0) U X(G(p2))))'
Support contains 8 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 31 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 10:23:58] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-05-24 10:23:58] [INFO ] Computed 25 invariants in 7 ms
[2024-05-24 10:23:59] [INFO ] Implicit Places using invariants in 919 ms returned []
[2024-05-24 10:23:59] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:23:59] [INFO ] Invariant cache hit.
[2024-05-24 10:23:59] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:24:03] [INFO ] Implicit Places using invariants and state equation in 4208 ms returned []
Implicit Place search using SMT with State Equation took 5132 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-05-24 10:24:03] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:24:03] [INFO ] Invariant cache hit.
[2024-05-24 10:24:03] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31732ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31781ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36951 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2358 steps with 0 reset in 7 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-10 finished in 37218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||(G(!p1) U p0)))))'
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 31 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 10:24:35] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:24:35] [INFO ] Invariant cache hit.
[2024-05-24 10:24:36] [INFO ] Implicit Places using invariants in 968 ms returned []
[2024-05-24 10:24:36] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:24:36] [INFO ] Invariant cache hit.
[2024-05-24 10:24:36] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:24:41] [INFO ] Implicit Places using invariants and state equation in 5042 ms returned []
Implicit Place search using SMT with State Equation took 6013 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-05-24 10:24:41] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:24:41] [INFO ] Invariant cache hit.
[2024-05-24 10:24:41] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31605ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31630ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37680 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 369 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 250 ms.
Product exploration explored 100000 steps with 0 reset in 413 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
RANDOM walk for 40000 steps (8 resets) in 1157 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 142614 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 4
Probabilistic random walk after 142614 steps, saw 103763 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2024-05-24 10:25:18] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:25:18] [INFO ] Invariant cache hit.
[2024-05-24 10:25:18] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 216/222 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/246 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/307 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:18] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 25/332 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:19] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 516/848 variables, 332/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/848 variables, 84/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/848 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 88/936 variables, 40/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/936 variables, 22/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 276/1212 variables, 8/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1212 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 8/1220 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1220 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 356/1576 variables, 284/789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1576 variables, 178/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 967 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1895 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 216/222 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/246 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/307 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:20] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 3 ms to minimize.
[2024-05-24 10:25:20] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-24 10:25:20] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 25/332 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 516/848 variables, 332/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/848 variables, 84/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/848 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 88/936 variables, 40/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 22/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:21] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/936 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/936 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 276/1212 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1212 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 8/1220 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1220 variables, 4/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:22] [INFO ] Deduced a trap composed of 3 places in 615 ms of which 7 ms to minimize.
[2024-05-24 10:25:22] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2024-05-24 10:25:23] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-24 10:25:23] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-24 10:25:23] [INFO ] Deduced a trap composed of 103 places in 334 ms of which 5 ms to minimize.
[2024-05-24 10:25:23] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 4 ms to minimize.
[2024-05-24 10:25:24] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1220 variables, 7/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1220 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 356/1576 variables, 284/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1576 variables, 178/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1576 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/1576 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1576/1576 variables, and 982 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 6932ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1221 ms.
Support contains 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 138 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 392/656 places, 2104/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 491 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 140193 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 4
Probabilistic random walk after 140193 steps, saw 87271 distinct states, run finished after 3005 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-24 10:25:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 10:25:30] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 10:25:30] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/147 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/190 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:30] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/200 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:30] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 384/584 variables, 200/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 84/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 88/672 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/672 variables, 25/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/672 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 143/815 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/815 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/817 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/817 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 7/824 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/824 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 224/1048 variables, 152/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 175/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/147 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/190 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:32] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-05-24 10:25:32] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-05-24 10:25:32] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 10:25:32] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 10/200 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 384/584 variables, 200/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 84/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 88/672 variables, 40/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/672 variables, 25/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/672 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 143/815 variables, 7/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/815 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/817 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/817 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 7/824 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/824 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:33] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
[2024-05-24 10:25:33] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/824 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/824 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 224/1048 variables, 152/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 175/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:25:34] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1048 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/1048 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 714 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2620 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 4378ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1631 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 73 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 69 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 10:25:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:25:36] [INFO ] Invariant cache hit.
[2024-05-24 10:25:37] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-05-24 10:25:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:25:37] [INFO ] Invariant cache hit.
[2024-05-24 10:25:37] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:25:39] [INFO ] Implicit Places using invariants and state equation in 2435 ms returned []
Implicit Place search using SMT with State Equation took 3083 ms to find 0 implicit places.
[2024-05-24 10:25:39] [INFO ] Redundant transitions in 92 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:25:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:25:39] [INFO ] Invariant cache hit.
[2024-05-24 10:25:39] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:26:07] [INFO ] Deduced a trap composed of 3 places in 566 ms of which 7 ms to minimize.
[2024-05-24 10:26:07] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 2 ms to minimize.
[2024-05-24 10:26:08] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
[2024-05-24 10:26:08] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2024-05-24 10:26:08] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-05-24 10:26:08] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 10:26:08] [INFO ] Deduced a trap composed of 43 places in 337 ms of which 5 ms to minimize.
[2024-05-24 10:26:09] [INFO ] Deduced a trap composed of 71 places in 281 ms of which 5 ms to minimize.
[2024-05-24 10:26:09] [INFO ] Deduced a trap composed of 124 places in 417 ms of which 5 ms to minimize.
[2024-05-24 10:26:10] [INFO ] Deduced a trap composed of 41 places in 343 ms of which 3 ms to minimize.
[2024-05-24 10:26:10] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 4 ms to minimize.
[2024-05-24 10:26:10] [INFO ] Deduced a trap composed of 28 places in 308 ms of which 4 ms to minimize.
[2024-05-24 10:26:11] [INFO ] Deduced a trap composed of 62 places in 236 ms of which 3 ms to minimize.
[2024-05-24 10:26:11] [INFO ] Deduced a trap composed of 27 places in 360 ms of which 5 ms to minimize.
SMT process timed out in 31804ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31842ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35100 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1916 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 4 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 336 transition count 411
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 259 transition count 411
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 155 place count 259 transition count 394
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 197 place count 234 transition count 394
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 417 place count 124 transition count 284
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 469 place count 124 transition count 232
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 483 place count 117 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 490 place count 117 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 499 place count 117 transition count 216
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 557 place count 117 transition count 158
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 615 place count 59 transition count 158
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 623 place count 59 transition count 158
Applied a total of 623 rules in 66 ms. Remains 59 /392 variables (removed 333) and now considering 158/2104 (removed 1946) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 158 rows 59 cols
[2024-05-24 10:26:11] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 10:26:11] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 10:26:11] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 10:26:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 10:26:11] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 10:26:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 10:26:11] [INFO ] After 61ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 10:26:11] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-24 10:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-24 10:26:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-24 10:26:12] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-24 10:26:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
TRAPS : Iteration 1
[2024-05-24 10:26:12] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 10:26:12] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 787 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
[2024-05-24 10:26:12] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-05-24 10:26:12] [INFO ] Computed 25 invariants in 5 ms
[2024-05-24 10:26:14] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2024-05-24 10:26:14] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 30 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-11 finished in 99288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 84 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 10:26:14] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:26:14] [INFO ] Invariant cache hit.
[2024-05-24 10:26:15] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-24 10:26:15] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:26:15] [INFO ] Invariant cache hit.
[2024-05-24 10:26:16] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:26:19] [INFO ] Implicit Places using invariants and state equation in 3789 ms returned []
Implicit Place search using SMT with State Equation took 4642 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-05-24 10:26:19] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:26:19] [INFO ] Invariant cache hit.
[2024-05-24 10:26:19] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31732ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31781ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36513 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 264 ms.
Product exploration explored 100000 steps with 0 reset in 318 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 341217 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 341217 steps, saw 238968 distinct states, run finished after 3007 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-24 10:26:55] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 10:26:55] [INFO ] Invariant cache hit.
[2024-05-24 10:26:55] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:26:55] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/170 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:26:55] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 314/484 variables, 170/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 30/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/616 variables, 60/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 22/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 414/1030 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1030 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1042 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1042 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 534/1576 variables, 426/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1576 variables, 232/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 967 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/170 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 314/484 variables, 170/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 30/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/616 variables, 60/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 22/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 414/1030 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1030 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1042 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1042 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:26:57] [INFO ] Deduced a trap composed of 3 places in 844 ms of which 10 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1042 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:26:58] [INFO ] Deduced a trap composed of 114 places in 675 ms of which 9 ms to minimize.
[2024-05-24 10:26:59] [INFO ] Deduced a trap composed of 142 places in 749 ms of which 9 ms to minimize.
[2024-05-24 10:27:00] [INFO ] Deduced a trap composed of 121 places in 750 ms of which 8 ms to minimize.
[2024-05-24 10:27:00] [INFO ] Deduced a trap composed of 129 places in 724 ms of which 11 ms to minimize.
[2024-05-24 10:27:01] [INFO ] Deduced a trap composed of 130 places in 613 ms of which 9 ms to minimize.
SMT process timed out in 6149ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 238 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 392/656 places, 2104/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 437 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 381339 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 381339 steps, saw 210288 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2024-05-24 10:27:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 10:27:05] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 10:27:05] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:27:05] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:27:05] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:27:06] [INFO ] Deduced a trap composed of 8 places in 527 ms of which 5 ms to minimize.
[2024-05-24 10:27:07] [INFO ] Deduced a trap composed of 3 places in 353 ms of which 4 ms to minimize.
[2024-05-24 10:27:07] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 2 ms to minimize.
[2024-05-24 10:27:07] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 3 ms to minimize.
[2024-05-24 10:27:07] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 4 ms to minimize.
[2024-05-24 10:27:08] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 6/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:27:08] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/712 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 336/1048 variables, 228/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 227/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3127 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3908ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 160 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 159 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 10:27:09] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:27:09] [INFO ] Invariant cache hit.
[2024-05-24 10:27:10] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-24 10:27:10] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:27:10] [INFO ] Invariant cache hit.
[2024-05-24 10:27:10] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:27:13] [INFO ] Implicit Places using invariants and state equation in 2949 ms returned []
Implicit Place search using SMT with State Equation took 3692 ms to find 0 implicit places.
[2024-05-24 10:27:13] [INFO ] Redundant transitions in 84 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:27:13] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:27:13] [INFO ] Invariant cache hit.
[2024-05-24 10:27:13] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:27:44] [INFO ] Deduced a trap composed of 3 places in 458 ms of which 7 ms to minimize.
[2024-05-24 10:27:44] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 2 ms to minimize.
[2024-05-24 10:27:44] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 28 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:27:48] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2024-05-24 10:27:48] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-24 10:27:48] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 10:27:48] [INFO ] Deduced a trap composed of 43 places in 293 ms of which 4 ms to minimize.
[2024-05-24 10:27:48] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 3 ms to minimize.
[2024-05-24 10:27:49] [INFO ] Deduced a trap composed of 25 places in 339 ms of which 6 ms to minimize.
[2024-05-24 10:27:51] [INFO ] Deduced a trap composed of 47 places in 353 ms of which 4 ms to minimize.
[2024-05-24 10:27:52] [INFO ] Deduced a trap composed of 43 places in 453 ms of which 5 ms to minimize.
[2024-05-24 10:27:52] [INFO ] Deduced a trap composed of 66 places in 374 ms of which 5 ms to minimize.
[2024-05-24 10:27:52] [INFO ] Deduced a trap composed of 23 places in 412 ms of which 5 ms to minimize.
[2024-05-24 10:27:53] [INFO ] Deduced a trap composed of 18 places in 334 ms of which 4 ms to minimize.
[2024-05-24 10:27:53] [INFO ] Deduced a trap composed of 61 places in 471 ms of which 5 ms to minimize.
[2024-05-24 10:27:54] [INFO ] Deduced a trap composed of 45 places in 436 ms of which 5 ms to minimize.
[2024-05-24 10:27:54] [INFO ] Deduced a trap composed of 64 places in 392 ms of which 5 ms to minimize.
[2024-05-24 10:27:55] [INFO ] Deduced a trap composed of 64 places in 440 ms of which 5 ms to minimize.
[2024-05-24 10:27:55] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-05-24 10:27:55] [INFO ] Deduced a trap composed of 43 places in 317 ms of which 3 ms to minimize.
[2024-05-24 10:27:56] [INFO ] Deduced a trap composed of 53 places in 354 ms of which 4 ms to minimize.
[2024-05-24 10:27:56] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-24 10:27:56] [INFO ] Deduced a trap composed of 69 places in 420 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:28:00] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 5 ms to minimize.
[2024-05-24 10:28:03] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-24 10:28:05] [INFO ] Deduced a trap composed of 43 places in 359 ms of which 5 ms to minimize.
[2024-05-24 10:28:06] [INFO ] Deduced a trap composed of 77 places in 323 ms of which 5 ms to minimize.
[2024-05-24 10:28:08] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 4 ms to minimize.
[2024-05-24 10:28:09] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 3 ms to minimize.
[2024-05-24 10:28:10] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 3 ms to minimize.
[2024-05-24 10:28:13] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-24 10:28:15] [INFO ] Deduced a trap composed of 55 places in 400 ms of which 5 ms to minimize.
SMT process timed out in 61954ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61990ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65936 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 64 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 10:28:15] [INFO ] Computed 17 invariants in 2 ms
[2024-05-24 10:28:15] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-24 10:28:15] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 10:28:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-24 10:28:15] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 10:28:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 10:28:15] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 10:28:15] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 10:28:15] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 415 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 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 66 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 219 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
[2024-05-24 10:28:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 10:28:16] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 10:28:16] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-24 10:28:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:28:16] [INFO ] Invariant cache hit.
[2024-05-24 10:28:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:28:19] [INFO ] Implicit Places using invariants and state equation in 3199 ms returned []
Implicit Place search using SMT with State Equation took 3913 ms to find 0 implicit places.
[2024-05-24 10:28:20] [INFO ] Redundant transitions in 91 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:28:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:28:20] [INFO ] Invariant cache hit.
[2024-05-24 10:28:20] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:28:49] [INFO ] Deduced a trap composed of 3 places in 591 ms of which 6 ms to minimize.
[2024-05-24 10:28:50] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 3 ms to minimize.
[2024-05-24 10:28:50] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 2 ms to minimize.
[2024-05-24 10:28:50] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 3 ms to minimize.
[2024-05-24 10:28:50] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-05-24 10:28:50] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-24 10:28:51] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 5 ms to minimize.
[2024-05-24 10:28:51] [INFO ] Deduced a trap composed of 71 places in 385 ms of which 5 ms to minimize.
[2024-05-24 10:28:51] [INFO ] Deduced a trap composed of 124 places in 407 ms of which 5 ms to minimize.
SMT process timed out in 31895ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31930ms
Starting structural reductions in SI_LTL mode, iteration 1 : 392/656 places, 2104/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36175 ms. Remains : 392/656 places, 2104/2368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 297603 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 297603 steps, saw 167629 distinct states, run finished after 3005 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-24 10:28:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:28:55] [INFO ] Invariant cache hit.
[2024-05-24 10:28:55] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:28:55] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:28:55] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:28:56] [INFO ] Deduced a trap composed of 3 places in 360 ms of which 4 ms to minimize.
[2024-05-24 10:28:57] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 4 ms to minimize.
[2024-05-24 10:28:57] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 2 ms to minimize.
[2024-05-24 10:28:57] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:28:58] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2126 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3005ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 103 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 331137 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 331137 steps, saw 184833 distinct states, run finished after 3005 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-24 10:29:01] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:29:01] [INFO ] Invariant cache hit.
[2024-05-24 10:29:01] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:29:01] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:29:01] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:29:03] [INFO ] Deduced a trap composed of 3 places in 378 ms of which 5 ms to minimize.
[2024-05-24 10:29:03] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 3 ms to minimize.
[2024-05-24 10:29:03] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 3 ms to minimize.
[2024-05-24 10:29:03] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:29:04] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2170 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2897ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 101 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 126 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 10:29:04] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:29:04] [INFO ] Invariant cache hit.
[2024-05-24 10:29:05] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-05-24 10:29:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:29:05] [INFO ] Invariant cache hit.
[2024-05-24 10:29:06] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:29:09] [INFO ] Implicit Places using invariants and state equation in 3358 ms returned []
Implicit Place search using SMT with State Equation took 4316 ms to find 0 implicit places.
[2024-05-24 10:29:09] [INFO ] Redundant transitions in 92 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:29:09] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:29:09] [INFO ] Invariant cache hit.
[2024-05-24 10:29:09] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:29:39] [INFO ] Deduced a trap composed of 3 places in 530 ms of which 6 ms to minimize.
[2024-05-24 10:29:39] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 3 ms to minimize.
[2024-05-24 10:29:39] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 3 ms to minimize.
[2024-05-24 10:29:40] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-05-24 10:29:40] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-05-24 10:29:40] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-24 10:29:40] [INFO ] Deduced a trap composed of 43 places in 312 ms of which 5 ms to minimize.
[2024-05-24 10:29:41] [INFO ] Deduced a trap composed of 71 places in 352 ms of which 5 ms to minimize.
[2024-05-24 10:29:41] [INFO ] Deduced a trap composed of 124 places in 393 ms of which 5 ms to minimize.
SMT process timed out in 32288ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 32325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36879 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 47 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 10:29:41] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 10:29:41] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-24 10:29:41] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 10:29:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-24 10:29:41] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 10:29:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 10:29:41] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 10:29:41] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 10:29:42] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 390 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 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 66 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 395 ms.
Product exploration explored 100000 steps with 0 reset in 491 ms.
Built C files in :
/tmp/ltsmin4295543496515916812
[2024-05-24 10:29:43] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-24 10:29:43] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4295543496515916812
Running compilation step : cd /tmp/ltsmin4295543496515916812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4295543496515916812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4295543496515916812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 10:29:46] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 10:29:46] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 10:29:47] [INFO ] Implicit Places using invariants in 859 ms returned []
[2024-05-24 10:29:47] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:29:47] [INFO ] Invariant cache hit.
[2024-05-24 10:29:47] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:29:50] [INFO ] Implicit Places using invariants and state equation in 3524 ms returned []
Implicit Place search using SMT with State Equation took 4392 ms to find 0 implicit places.
[2024-05-24 10:29:50] [INFO ] Redundant transitions in 88 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:29:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:29:50] [INFO ] Invariant cache hit.
[2024-05-24 10:29:50] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:30:22] [INFO ] Deduced a trap composed of 3 places in 549 ms of which 7 ms to minimize.
SMT process timed out in 31898ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31936ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36502 ms. Remains : 392/392 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin3098274855151838115
[2024-05-24 10:30:22] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-24 10:30:22] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3098274855151838115
Running compilation step : cd /tmp/ltsmin3098274855151838115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3098274855151838115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3098274855151838115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 10:30:26] [INFO ] Flatten gal took : 215 ms
[2024-05-24 10:30:26] [INFO ] Flatten gal took : 211 ms
[2024-05-24 10:30:26] [INFO ] Time to serialize gal into /tmp/LTL1455323830310540612.gal : 39 ms
[2024-05-24 10:30:26] [INFO ] Time to serialize properties into /tmp/LTL5477626713560149684.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1455323830310540612.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13386072228559044406.hoa' '-atoms' '/tmp/LTL5477626713560149684.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5477626713560149684.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13386072228559044406.hoa
Detected timeout of ITS tools.
[2024-05-24 10:30:41] [INFO ] Flatten gal took : 96 ms
[2024-05-24 10:30:41] [INFO ] Flatten gal took : 101 ms
[2024-05-24 10:30:42] [INFO ] Time to serialize gal into /tmp/LTL13505427439169183644.gal : 26 ms
[2024-05-24 10:30:42] [INFO ] Time to serialize properties into /tmp/LTL18041802716519449193.ltl : 16 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13505427439169183644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18041802716519449193.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"
Detected timeout of ITS tools.
[2024-05-24 10:30:57] [INFO ] Flatten gal took : 122 ms
[2024-05-24 10:30:57] [INFO ] Applying decomposition
[2024-05-24 10:30:57] [INFO ] Flatten gal took : 134 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1161981456037399159.txt' '-o' '/tmp/graph1161981456037399159.bin' '-w' '/tmp/graph1161981456037399159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1161981456037399159.bin' '-l' '-1' '-v' '-w' '/tmp/graph1161981456037399159.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:30:57] [INFO ] Decomposing Gal with order
[2024-05-24 10:30:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:30:58] [INFO ] Removed a total of 4353 redundant transitions.
[2024-05-24 10:30:58] [INFO ] Flatten gal took : 821 ms
[2024-05-24 10:30:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 145 ms.
[2024-05-24 10:30:58] [INFO ] Time to serialize gal into /tmp/LTL4681211587460509793.gal : 24 ms
[2024-05-24 10:30:58] [INFO ] Time to serialize properties into /tmp/LTL8066711488531785431.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4681211587460509793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8066711488531785431.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i13.i0.u5.turn_1!=1)||(i2.u3.flag_1_idle!=1))||(i10.u57.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((i13.i0.u5.turn_1!=1)||(i2.u3.flag_1_idle!=1))||(i10.u57.p25_3_5!=1))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 299253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p2)||p1)))))'
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 655 transition count 2218
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 457 transition count 2218
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 450 transition count 2162
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2106
Applied a total of 538 rules in 185 ms. Remains 394 /663 variables (removed 269) and now considering 2106/2424 (removed 318) transitions.
[2024-05-24 10:31:14] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-05-24 10:31:14] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 10:31:15] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2024-05-24 10:31:15] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:31:15] [INFO ] Invariant cache hit.
[2024-05-24 10:31:15] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:31:18] [INFO ] Implicit Places using invariants and state equation in 3371 ms returned []
Implicit Place search using SMT with State Equation took 4488 ms to find 0 implicit places.
[2024-05-24 10:31:18] [INFO ] Redundant transitions in 85 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 10:31:18] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:31:18] [INFO ] Invariant cache hit.
[2024-05-24 10:31:18] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 10:31:49] [INFO ] Deduced a trap composed of 3 places in 570 ms of which 6 ms to minimize.
[2024-05-24 10:31:49] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 3 ms to minimize.
[2024-05-24 10:31:50] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 4 ms to minimize.
[2024-05-24 10:31:50] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 2 ms to minimize.
[2024-05-24 10:31:50] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2024-05-24 10:31:50] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-05-24 10:31:50] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
SMT process timed out in 31913ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 31947ms
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2106/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36719 ms. Remains : 394/663 places, 2106/2424 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 441 ms.
Product exploration explored 100000 steps with 0 reset in 451 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0)), (X p2), (X (NOT (OR (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (AND p2 p0)), (X p0), (X p1), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (OR (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 172 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 670 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
[2024-05-24 10:31:52] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:31:52] [INFO ] Invariant cache hit.
[2024-05-24 10:31:52] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:31:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:31:53] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:31:54] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 4 ms to minimize.
[2024-05-24 10:31:54] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-05-24 10:31:55] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
[2024-05-24 10:31:55] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-05-24 10:31:55] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-24 10:31:55] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 10:31:55] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 2 ms to minimize.
[2024-05-24 10:31:55] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3429 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 4247ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1207 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 81 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 394/394 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 1199 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 132075 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 4
Probabilistic random walk after 132075 steps, saw 82693 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-24 10:32:01] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:32:01] [INFO ] Invariant cache hit.
[2024-05-24 10:32:01] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:32:02] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:32:03] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:32:03] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 3 ms to minimize.
[2024-05-24 10:32:03] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 2 ms to minimize.
[2024-05-24 10:32:04] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2024-05-24 10:32:04] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 2 ms to minimize.
[2024-05-24 10:32:04] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-05-24 10:32:04] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 10:32:04] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 2 ms to minimize.
[2024-05-24 10:32:05] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2971 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 3862ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1180 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 71 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 68 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 10:32:07] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:32:07] [INFO ] Invariant cache hit.
[2024-05-24 10:32:07] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-24 10:32:07] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:32:07] [INFO ] Invariant cache hit.
[2024-05-24 10:32:08] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:32:10] [INFO ] Implicit Places using invariants and state equation in 3170 ms returned []
Implicit Place search using SMT with State Equation took 3786 ms to find 0 implicit places.
[2024-05-24 10:32:10] [INFO ] Redundant transitions in 75 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 10:32:10] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:32:10] [INFO ] Invariant cache hit.
[2024-05-24 10:32:10] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 10:32:38] [INFO ] Deduced a trap composed of 3 places in 431 ms of which 4 ms to minimize.
[2024-05-24 10:32:39] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 2 ms to minimize.
[2024-05-24 10:32:39] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 2 ms to minimize.
[2024-05-24 10:32:39] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-05-24 10:32:39] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2024-05-24 10:32:39] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-24 10:32:39] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 10:32:40] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 4 ms to minimize.
[2024-05-24 10:32:41] [INFO ] Deduced a trap composed of 43 places in 293 ms of which 4 ms to minimize.
[2024-05-24 10:32:42] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 3 ms to minimize.
[2024-05-24 10:32:42] [INFO ] Deduced a trap composed of 45 places in 306 ms of which 5 ms to minimize.
[2024-05-24 10:32:42] [INFO ] Deduced a trap composed of 45 places in 310 ms of which 5 ms to minimize.
SMT process timed out in 31891ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 31923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35865 ms. Remains : 394/394 places, 2106/2106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1934 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 2 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 338 transition count 413
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 157 place count 260 transition count 395
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 199 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 417 place count 126 transition count 286
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 471 place count 126 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 487 place count 118 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 495 place count 118 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 503 place count 118 transition count 216
Free-agglomeration rule applied 55 times.
Iterating global reduction 5 with 55 rules applied. Total rules applied 558 place count 118 transition count 161
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 613 place count 63 transition count 161
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 620 place count 63 transition count 161
Applied a total of 620 rules in 30 ms. Remains 63 /394 variables (removed 331) and now considering 161/2106 (removed 1945) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 161 rows 63 cols
[2024-05-24 10:32:42] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 10:32:42] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 10:32:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 10:32:43] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 10:32:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 10:32:43] [INFO ] After 50ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 10:32:43] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-24 10:32:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-24 10:32:43] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 10:32:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-05-24 10:32:43] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-24 10:32:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 2
[2024-05-24 10:32:43] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 10:32:43] [INFO ] After 583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 672 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0)), (X p2), (X (NOT (OR (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (AND p2 p0)), (X p0), (X p1), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (OR (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 17 factoid took 253 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 71 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 10:32:44] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-05-24 10:32:44] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 10:32:44] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-24 10:32:44] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:32:44] [INFO ] Invariant cache hit.
[2024-05-24 10:32:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:32:47] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 3132 ms to find 0 implicit places.
[2024-05-24 10:32:47] [INFO ] Redundant transitions in 88 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 10:32:47] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:32:47] [INFO ] Invariant cache hit.
[2024-05-24 10:32:47] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 10:33:16] [INFO ] Deduced a trap composed of 3 places in 480 ms of which 6 ms to minimize.
[2024-05-24 10:33:16] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 3 ms to minimize.
[2024-05-24 10:33:16] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-05-24 10:33:16] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 2 ms to minimize.
[2024-05-24 10:33:16] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-24 10:33:16] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 10:33:16] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 10:33:17] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 3 ms to minimize.
[2024-05-24 10:33:18] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 3 ms to minimize.
[2024-05-24 10:33:19] [INFO ] Deduced a trap composed of 44 places in 248 ms of which 4 ms to minimize.
SMT process timed out in 31793ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 31830ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35144 ms. Remains : 394/394 places, 2106/2106 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (AND p0 p2)), (X p0), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 137 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 946 ms. (42 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
[2024-05-24 10:33:19] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:33:19] [INFO ] Invariant cache hit.
[2024-05-24 10:33:19] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:33:20] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 10:33:21] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:33:21] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:33:21] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-05-24 10:33:21] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-24 10:33:21] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-24 10:33:22] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 2 ms to minimize.
[2024-05-24 10:33:22] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 715 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2668 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 3474ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1011 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 112 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 394/394 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 1051 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 98523 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 98523 steps, saw 63882 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-24 10:33:28] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:33:28] [INFO ] Invariant cache hit.
[2024-05-24 10:33:28] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:33:29] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-05-24 10:33:29] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:33:29] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:33:30] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2024-05-24 10:33:30] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-05-24 10:33:30] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 10:33:30] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 2 ms to minimize.
[2024-05-24 10:33:31] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 715 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2676 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 3817ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 887 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 83 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 71 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 10:33:33] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:33:33] [INFO ] Invariant cache hit.
[2024-05-24 10:33:33] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-24 10:33:33] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:33:33] [INFO ] Invariant cache hit.
[2024-05-24 10:33:34] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:33:36] [INFO ] Implicit Places using invariants and state equation in 2651 ms returned []
Implicit Place search using SMT with State Equation took 3557 ms to find 0 implicit places.
[2024-05-24 10:33:36] [INFO ] Redundant transitions in 81 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 10:33:36] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:33:36] [INFO ] Invariant cache hit.
[2024-05-24 10:33:36] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 10:33:59] [INFO ] Deduced a trap composed of 3 places in 360 ms of which 3 ms to minimize.
[2024-05-24 10:33:59] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 2 ms to minimize.
[2024-05-24 10:33:59] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
[2024-05-24 10:34:00] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-24 10:34:00] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 4 ms to minimize.
[2024-05-24 10:34:00] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-24 10:34:00] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 10:34:00] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 3 ms to minimize.
[2024-05-24 10:34:01] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 3 ms to minimize.
[2024-05-24 10:34:02] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 3 ms to minimize.
[2024-05-24 10:34:02] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 3 ms to minimize.
[2024-05-24 10:34:02] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 3 ms to minimize.
[2024-05-24 10:34:03] [INFO ] Deduced a trap composed of 45 places in 275 ms of which 4 ms to minimize.
[2024-05-24 10:34:03] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-24 10:34:03] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 3 ms to minimize.
[2024-05-24 10:34:04] [INFO ] Deduced a trap composed of 76 places in 254 ms of which 3 ms to minimize.
[2024-05-24 10:34:04] [INFO ] Deduced a trap composed of 61 places in 281 ms of which 3 ms to minimize.
[2024-05-24 10:34:04] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 10:34:05] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 3 ms to minimize.
[2024-05-24 10:34:05] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 45 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 10:34:12] [INFO ] Deduced a trap composed of 70 places in 369 ms of which 5 ms to minimize.
[2024-05-24 10:34:13] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 5 ms to minimize.
[2024-05-24 10:34:13] [INFO ] Deduced a trap composed of 62 places in 303 ms of which 4 ms to minimize.
[2024-05-24 10:34:13] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 4 ms to minimize.
[2024-05-24 10:34:14] [INFO ] Deduced a trap composed of 21 places in 352 ms of which 5 ms to minimize.
[2024-05-24 10:34:14] [INFO ] Deduced a trap composed of 28 places in 348 ms of which 4 ms to minimize.
[2024-05-24 10:34:14] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 10:34:15] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-24 10:34:16] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-05-24 10:34:16] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-24 10:34:16] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-24 10:34:16] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-24 10:34:17] [INFO ] Deduced a trap composed of 62 places in 356 ms of which 5 ms to minimize.
[2024-05-24 10:34:17] [INFO ] Deduced a trap composed of 64 places in 378 ms of which 5 ms to minimize.
[2024-05-24 10:34:17] [INFO ] Deduced a trap composed of 65 places in 350 ms of which 5 ms to minimize.
[2024-05-24 10:34:18] [INFO ] Deduced a trap composed of 62 places in 330 ms of which 4 ms to minimize.
[2024-05-24 10:34:18] [INFO ] Deduced a trap composed of 73 places in 387 ms of which 5 ms to minimize.
[2024-05-24 10:34:19] [INFO ] Deduced a trap composed of 87 places in 386 ms of which 5 ms to minimize.
[2024-05-24 10:34:19] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 4 ms to minimize.
[2024-05-24 10:34:19] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 10:34:29] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 5 ms to minimize.
[2024-05-24 10:34:30] [INFO ] Deduced a trap composed of 64 places in 390 ms of which 5 ms to minimize.
[2024-05-24 10:34:30] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-24 10:34:33] [INFO ] Deduced a trap composed of 69 places in 396 ms of which 5 ms to minimize.
[2024-05-24 10:34:34] [INFO ] Deduced a trap composed of 64 places in 391 ms of which 4 ms to minimize.
[2024-05-24 10:34:34] [INFO ] Deduced a trap composed of 80 places in 363 ms of which 5 ms to minimize.
[2024-05-24 10:34:34] [INFO ] Deduced a trap composed of 82 places in 441 ms of which 4 ms to minimize.
[2024-05-24 10:34:35] [INFO ] Deduced a trap composed of 70 places in 439 ms of which 5 ms to minimize.
[2024-05-24 10:34:35] [INFO ] Deduced a trap composed of 61 places in 372 ms of which 5 ms to minimize.
[2024-05-24 10:34:36] [INFO ] Deduced a trap composed of 71 places in 328 ms of which 3 ms to minimize.
[2024-05-24 10:34:36] [INFO ] Deduced a trap composed of 63 places in 364 ms of which 5 ms to minimize.
[2024-05-24 10:34:37] [INFO ] Deduced a trap composed of 50 places in 372 ms of which 5 ms to minimize.
[2024-05-24 10:34:38] [INFO ] Deduced a trap composed of 83 places in 465 ms of which 5 ms to minimize.
SMT process timed out in 61796ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61828ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65549 ms. Remains : 394/394 places, 2106/2106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1934 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 338 transition count 413
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 157 place count 260 transition count 395
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 199 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 417 place count 126 transition count 286
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 471 place count 126 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 487 place count 118 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 495 place count 118 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 503 place count 118 transition count 216
Free-agglomeration rule applied 55 times.
Iterating global reduction 5 with 55 rules applied. Total rules applied 558 place count 118 transition count 161
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 613 place count 63 transition count 161
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 620 place count 63 transition count 161
Applied a total of 620 rules in 33 ms. Remains 63 /394 variables (removed 331) and now considering 161/2106 (removed 1945) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 161 rows 63 cols
[2024-05-24 10:34:38] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 10:34:38] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 10:34:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 10:34:38] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 10:34:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 10:34:38] [INFO ] After 58ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 10:34:38] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-24 10:34:38] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-24 10:34:38] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 10:34:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 110 ms
TRAPS : Iteration 1
[2024-05-24 10:34:39] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 10:34:39] [INFO ] After 572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 675 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (AND p0 p2)), (X p0), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 351 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 520 ms.
Product exploration explored 100000 steps with 0 reset in 337 ms.
Built C files in :
/tmp/ltsmin14305372331330773135
[2024-05-24 10:34:40] [INFO ] Too many transitions (2106) to apply POR reductions. Disabling POR matrices.
[2024-05-24 10:34:40] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14305372331330773135
Running compilation step : cd /tmp/ltsmin14305372331330773135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14305372331330773135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14305372331330773135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 65 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 10:34:44] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-05-24 10:34:44] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 10:34:44] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-24 10:34:44] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:34:44] [INFO ] Invariant cache hit.
[2024-05-24 10:34:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:34:47] [INFO ] Implicit Places using invariants and state equation in 2989 ms returned []
Implicit Place search using SMT with State Equation took 3721 ms to find 0 implicit places.
[2024-05-24 10:34:47] [INFO ] Redundant transitions in 54 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 10:34:47] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 10:34:47] [INFO ] Invariant cache hit.
[2024-05-24 10:34:47] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 10:35:13] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 4 ms to minimize.
[2024-05-24 10:35:13] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 2 ms to minimize.
[2024-05-24 10:35:13] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2024-05-24 10:35:13] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 3 ms to minimize.
[2024-05-24 10:35:13] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-24 10:35:14] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-05-24 10:35:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-24 10:35:14] [INFO ] Deduced a trap composed of 60 places in 216 ms of which 3 ms to minimize.
[2024-05-24 10:35:15] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2024-05-24 10:35:16] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 3 ms to minimize.
[2024-05-24 10:35:16] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
[2024-05-24 10:35:16] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 4 ms to minimize.
[2024-05-24 10:35:17] [INFO ] Deduced a trap composed of 45 places in 308 ms of which 5 ms to minimize.
[2024-05-24 10:35:17] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-05-24 10:35:18] [INFO ] Deduced a trap composed of 43 places in 387 ms of which 5 ms to minimize.
[2024-05-24 10:35:18] [INFO ] Deduced a trap composed of 76 places in 352 ms of which 4 ms to minimize.
[2024-05-24 10:35:19] [INFO ] Deduced a trap composed of 61 places in 376 ms of which 4 ms to minimize.
[2024-05-24 10:35:19] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
SMT process timed out in 31391ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 31414ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35269 ms. Remains : 394/394 places, 2106/2106 transitions.
Built C files in :
/tmp/ltsmin487024347040678055
[2024-05-24 10:35:19] [INFO ] Too many transitions (2106) to apply POR reductions. Disabling POR matrices.
[2024-05-24 10:35:19] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin487024347040678055
Running compilation step : cd /tmp/ltsmin487024347040678055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin487024347040678055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin487024347040678055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 10:35:22] [INFO ] Flatten gal took : 110 ms
[2024-05-24 10:35:22] [INFO ] Flatten gal took : 88 ms
[2024-05-24 10:35:22] [INFO ] Time to serialize gal into /tmp/LTL9014038057891227920.gal : 10 ms
[2024-05-24 10:35:22] [INFO ] Time to serialize properties into /tmp/LTL10366380862275408412.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9014038057891227920.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9849295311191872464.hoa' '-atoms' '/tmp/LTL10366380862275408412.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10366380862275408412.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9849295311191872464.hoa
Detected timeout of ITS tools.
[2024-05-24 10:35:37] [INFO ] Flatten gal took : 50 ms
[2024-05-24 10:35:37] [INFO ] Flatten gal took : 54 ms
[2024-05-24 10:35:37] [INFO ] Time to serialize gal into /tmp/LTL4920020669593991551.gal : 9 ms
[2024-05-24 10:35:37] [INFO ] Time to serialize properties into /tmp/LTL12244003562894700717.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4920020669593991551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12244003562894700717.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((flag_3_idle==0)||(p18_0_3==0))||(p34_7_3==0))")&&(("((flag_3_idle==0)||(p18_0_3==0))")||(G("(((turn_7==0)||(flag_7_idle==0...180
Formula 0 simplified : GF(!"(((flag_3_idle==0)||(p18_0_3==0))||(p34_7_3==0))" | (!"((flag_3_idle==0)||(p18_0_3==0))" & F!"(((turn_7==0)||(flag_7_idle==0))|...172
Detected timeout of ITS tools.
[2024-05-24 10:35:52] [INFO ] Flatten gal took : 54 ms
[2024-05-24 10:35:52] [INFO ] Applying decomposition
[2024-05-24 10:35:52] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15070346455345411759.txt' '-o' '/tmp/graph15070346455345411759.bin' '-w' '/tmp/graph15070346455345411759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15070346455345411759.bin' '-l' '-1' '-v' '-w' '/tmp/graph15070346455345411759.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:35:53] [INFO ] Decomposing Gal with order
[2024-05-24 10:35:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:35:53] [INFO ] Removed a total of 4368 redundant transitions.
[2024-05-24 10:35:53] [INFO ] Flatten gal took : 243 ms
[2024-05-24 10:35:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 509 labels/synchronizations in 80 ms.
[2024-05-24 10:35:53] [INFO ] Time to serialize gal into /tmp/LTL13191612797720563788.gal : 17 ms
[2024-05-24 10:35:53] [INFO ] Time to serialize properties into /tmp/LTL16238314390316658752.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13191612797720563788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16238314390316658752.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((i14.u28.flag_3_idle==0)||(i0.u0.p18_0_3==0))||(i14.u65.p34_7_3==0))")&&(("((i14.u28.flag_3_idle==0)||(i0.u0.p18_0_3==0))")...235
Formula 0 simplified : GF(!"(((i14.u28.flag_3_idle==0)||(i0.u0.p18_0_3==0))||(i14.u65.p34_7_3==0))" | (!"((i14.u28.flag_3_idle==0)||(i0.u0.p18_0_3==0))" & ...227
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-13 finished in 294645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p1)))||p0))))'
Support contains 5 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 125 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-05-24 10:36:08] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 10:36:08] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 10:36:09] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-24 10:36:09] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:36:09] [INFO ] Invariant cache hit.
[2024-05-24 10:36:09] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 10:36:12] [INFO ] Implicit Places using invariants and state equation in 2814 ms returned []
Implicit Place search using SMT with State Equation took 3494 ms to find 0 implicit places.
[2024-05-24 10:36:12] [INFO ] Redundant transitions in 85 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 10:36:12] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:36:12] [INFO ] Invariant cache hit.
[2024-05-24 10:36:12] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:36:40] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 4 ms to minimize.
[2024-05-24 10:36:41] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 2 ms to minimize.
[2024-05-24 10:36:41] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 3 ms to minimize.
[2024-05-24 10:36:41] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 3 ms to minimize.
[2024-05-24 10:36:41] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-24 10:36:41] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 10:36:41] [INFO ] Deduced a trap composed of 60 places in 270 ms of which 5 ms to minimize.
[2024-05-24 10:36:42] [INFO ] Deduced a trap composed of 77 places in 320 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 33 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:36:47] [INFO ] Deduced a trap composed of 71 places in 336 ms of which 4 ms to minimize.
[2024-05-24 10:36:48] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 4 ms to minimize.
[2024-05-24 10:36:48] [INFO ] Deduced a trap composed of 62 places in 248 ms of which 4 ms to minimize.
[2024-05-24 10:36:48] [INFO ] Deduced a trap composed of 59 places in 355 ms of which 4 ms to minimize.
[2024-05-24 10:36:49] [INFO ] Deduced a trap composed of 22 places in 384 ms of which 5 ms to minimize.
[2024-05-24 10:36:49] [INFO ] Deduced a trap composed of 29 places in 403 ms of which 4 ms to minimize.
[2024-05-24 10:36:49] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-24 10:36:51] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2024-05-24 10:36:51] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2024-05-24 10:36:52] [INFO ] Deduced a trap composed of 11 places in 463 ms of which 5 ms to minimize.
[2024-05-24 10:36:52] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 2 ms to minimize.
[2024-05-24 10:36:52] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-05-24 10:36:53] [INFO ] Deduced a trap composed of 64 places in 384 ms of which 5 ms to minimize.
[2024-05-24 10:36:53] [INFO ] Deduced a trap composed of 74 places in 372 ms of which 5 ms to minimize.
[2024-05-24 10:36:54] [INFO ] Deduced a trap composed of 65 places in 426 ms of which 5 ms to minimize.
[2024-05-24 10:36:54] [INFO ] Deduced a trap composed of 38 places in 455 ms of which 5 ms to minimize.
[2024-05-24 10:36:55] [INFO ] Deduced a trap composed of 64 places in 436 ms of which 5 ms to minimize.
[2024-05-24 10:36:55] [INFO ] Deduced a trap composed of 45 places in 459 ms of which 5 ms to minimize.
[2024-05-24 10:36:56] [INFO ] Deduced a trap composed of 76 places in 539 ms of which 5 ms to minimize.
[2024-05-24 10:36:56] [INFO ] Deduced a trap composed of 72 places in 540 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:37:00] [INFO ] Deduced a trap composed of 54 places in 344 ms of which 5 ms to minimize.
[2024-05-24 10:37:00] [INFO ] Deduced a trap composed of 51 places in 366 ms of which 5 ms to minimize.
[2024-05-24 10:37:01] [INFO ] Deduced a trap composed of 43 places in 342 ms of which 5 ms to minimize.
[2024-05-24 10:37:02] [INFO ] Deduced a trap composed of 56 places in 359 ms of which 4 ms to minimize.
[2024-05-24 10:37:02] [INFO ] Deduced a trap composed of 52 places in 386 ms of which 5 ms to minimize.
[2024-05-24 10:37:03] [INFO ] Deduced a trap composed of 74 places in 344 ms of which 4 ms to minimize.
[2024-05-24 10:37:03] [INFO ] Deduced a trap composed of 64 places in 369 ms of which 5 ms to minimize.
[2024-05-24 10:37:04] [INFO ] Deduced a trap composed of 55 places in 331 ms of which 5 ms to minimize.
[2024-05-24 10:37:04] [INFO ] Deduced a trap composed of 51 places in 382 ms of which 5 ms to minimize.
[2024-05-24 10:37:05] [INFO ] Deduced a trap composed of 49 places in 431 ms of which 5 ms to minimize.
[2024-05-24 10:37:05] [INFO ] Deduced a trap composed of 68 places in 435 ms of which 5 ms to minimize.
[2024-05-24 10:37:06] [INFO ] Deduced a trap composed of 50 places in 488 ms of which 17 ms to minimize.
[2024-05-24 10:37:06] [INFO ] Deduced a trap composed of 70 places in 478 ms of which 5 ms to minimize.
[2024-05-24 10:37:06] [INFO ] Deduced a trap composed of 68 places in 424 ms of which 4 ms to minimize.
[2024-05-24 10:37:07] [INFO ] Deduced a trap composed of 61 places in 432 ms of which 5 ms to minimize.
[2024-05-24 10:37:07] [INFO ] Deduced a trap composed of 50 places in 480 ms of which 5 ms to minimize.
[2024-05-24 10:37:08] [INFO ] Deduced a trap composed of 30 places in 434 ms of which 5 ms to minimize.
[2024-05-24 10:37:08] [INFO ] Deduced a trap composed of 15 places in 416 ms of which 5 ms to minimize.
[2024-05-24 10:37:09] [INFO ] Deduced a trap composed of 52 places in 437 ms of which 5 ms to minimize.
[2024-05-24 10:37:09] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:37:11] [INFO ] Deduced a trap composed of 67 places in 293 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1057 variables, and 74 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 49/49 constraints]
After SMT, in 61903ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61938ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65661 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 375 ms.
Product exploration explored 100000 steps with 0 reset in 383 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 201 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 587 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 97632 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 97632 steps, saw 63440 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-24 10:37:19] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:37:19] [INFO ] Invariant cache hit.
[2024-05-24 10:37:19] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:37:20] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:37:21] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 2 ms to minimize.
[2024-05-24 10:37:21] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 3 ms to minimize.
[2024-05-24 10:37:21] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 2 ms to minimize.
[2024-05-24 10:37:21] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 3 ms to minimize.
[2024-05-24 10:37:21] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-05-24 10:37:22] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 10:37:22] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 10:37:22] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3366 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 4472ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3527 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 110 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 393/393 places, 2112/2112 transitions.
RANDOM walk for 40000 steps (8 resets) in 911 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 111690 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 4
Probabilistic random walk after 111690 steps, saw 71412 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-24 10:37:30] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:37:30] [INFO ] Invariant cache hit.
[2024-05-24 10:37:30] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1251 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:37:32] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:37:33] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 2 ms to minimize.
[2024-05-24 10:37:33] [INFO ] Deduced a trap composed of 44 places in 288 ms of which 3 ms to minimize.
[2024-05-24 10:37:33] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 2 ms to minimize.
[2024-05-24 10:37:33] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 3 ms to minimize.
[2024-05-24 10:37:34] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 2 ms to minimize.
[2024-05-24 10:37:34] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-24 10:37:34] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-24 10:37:34] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3527 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 4811ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3502 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 88 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 94 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 10:37:39] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:37:39] [INFO ] Invariant cache hit.
[2024-05-24 10:37:40] [INFO ] Implicit Places using invariants in 948 ms returned []
[2024-05-24 10:37:40] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:37:40] [INFO ] Invariant cache hit.
[2024-05-24 10:37:40] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 10:37:42] [INFO ] Implicit Places using invariants and state equation in 2676 ms returned []
Implicit Place search using SMT with State Equation took 3627 ms to find 0 implicit places.
[2024-05-24 10:37:42] [INFO ] Redundant transitions in 93 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 10:37:42] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:37:42] [INFO ] Invariant cache hit.
[2024-05-24 10:37:42] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:38:10] [INFO ] Deduced a trap composed of 3 places in 372 ms of which 4 ms to minimize.
[2024-05-24 10:38:10] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2024-05-24 10:38:10] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 2 ms to minimize.
[2024-05-24 10:38:10] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 3 ms to minimize.
[2024-05-24 10:38:10] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-24 10:38:11] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 10:38:11] [INFO ] Deduced a trap composed of 60 places in 204 ms of which 3 ms to minimize.
[2024-05-24 10:38:11] [INFO ] Deduced a trap composed of 77 places in 197 ms of which 3 ms to minimize.
[2024-05-24 10:38:13] [INFO ] Deduced a trap composed of 42 places in 359 ms of which 5 ms to minimize.
[2024-05-24 10:38:14] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 3 ms to minimize.
[2024-05-24 10:38:14] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 3 ms to minimize.
[2024-05-24 10:38:14] [INFO ] Deduced a trap composed of 45 places in 297 ms of which 5 ms to minimize.
[2024-05-24 10:38:15] [INFO ] Deduced a trap composed of 45 places in 277 ms of which 3 ms to minimize.
SMT process timed out in 32388ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 32425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36255 ms. Remains : 393/393 places, 2112/2112 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1936 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 337 transition count 413
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 259 transition count 413
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 157 place count 259 transition count 397
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 236 transition count 397
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 420 place count 124 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 475 place count 124 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 485 place count 119 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 490 place count 119 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 497 place count 119 transition count 218
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 555 place count 119 transition count 160
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 613 place count 61 transition count 160
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 61 transition count 160
Applied a total of 621 rules in 29 ms. Remains 61 /393 variables (removed 332) and now considering 160/2112 (removed 1952) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 160 rows 61 cols
[2024-05-24 10:38:15] [INFO ] Computed 18 invariants in 2 ms
[2024-05-24 10:38:15] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 10:38:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 10:38:15] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 10:38:15] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 10:38:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 10:38:15] [INFO ] After 56ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 10:38:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 10:38:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-24 10:38:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 10:38:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-05-24 10:38:15] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 10:38:15] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 569 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 159 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 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 71 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 10:38:16] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 10:38:16] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 10:38:17] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-24 10:38:17] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:38:17] [INFO ] Invariant cache hit.
[2024-05-24 10:38:17] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 10:38:20] [INFO ] Implicit Places using invariants and state equation in 2871 ms returned []
Implicit Place search using SMT with State Equation took 3730 ms to find 0 implicit places.
[2024-05-24 10:38:20] [INFO ] Redundant transitions in 53 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 10:38:20] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:38:20] [INFO ] Invariant cache hit.
[2024-05-24 10:38:20] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:38:44] [INFO ] Deduced a trap composed of 3 places in 431 ms of which 4 ms to minimize.
[2024-05-24 10:38:44] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 3 ms to minimize.
[2024-05-24 10:38:44] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 3 ms to minimize.
[2024-05-24 10:38:44] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-05-24 10:38:45] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-24 10:38:45] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 10:38:45] [INFO ] Deduced a trap composed of 60 places in 298 ms of which 5 ms to minimize.
[2024-05-24 10:38:45] [INFO ] Deduced a trap composed of 77 places in 293 ms of which 4 ms to minimize.
[2024-05-24 10:38:47] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 5 ms to minimize.
[2024-05-24 10:38:48] [INFO ] Deduced a trap composed of 48 places in 336 ms of which 4 ms to minimize.
[2024-05-24 10:38:48] [INFO ] Deduced a trap composed of 50 places in 331 ms of which 4 ms to minimize.
[2024-05-24 10:38:48] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 3 ms to minimize.
[2024-05-24 10:38:49] [INFO ] Deduced a trap composed of 45 places in 331 ms of which 5 ms to minimize.
[2024-05-24 10:38:49] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-24 10:38:50] [INFO ] Deduced a trap composed of 76 places in 375 ms of which 5 ms to minimize.
[2024-05-24 10:38:50] [INFO ] Deduced a trap composed of 13 places in 451 ms of which 5 ms to minimize.
[2024-05-24 10:38:50] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-24 10:38:51] [INFO ] Deduced a trap composed of 24 places in 418 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 43 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:38:56] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-24 10:38:57] [INFO ] Deduced a trap composed of 66 places in 323 ms of which 4 ms to minimize.
[2024-05-24 10:38:58] [INFO ] Deduced a trap composed of 76 places in 393 ms of which 5 ms to minimize.
[2024-05-24 10:39:01] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-24 10:39:02] [INFO ] Deduced a trap composed of 74 places in 301 ms of which 5 ms to minimize.
[2024-05-24 10:39:03] [INFO ] Deduced a trap composed of 45 places in 319 ms of which 4 ms to minimize.
[2024-05-24 10:39:05] [INFO ] Deduced a trap composed of 46 places in 348 ms of which 5 ms to minimize.
[2024-05-24 10:39:05] [INFO ] Deduced a trap composed of 72 places in 333 ms of which 5 ms to minimize.
[2024-05-24 10:39:05] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 3 ms to minimize.
[2024-05-24 10:39:05] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
[2024-05-24 10:39:06] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 2 ms to minimize.
[2024-05-24 10:39:06] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-24 10:39:06] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-05-24 10:39:06] [INFO ] Deduced a trap composed of 77 places in 361 ms of which 5 ms to minimize.
[2024-05-24 10:39:07] [INFO ] Deduced a trap composed of 75 places in 423 ms of which 6 ms to minimize.
[2024-05-24 10:39:07] [INFO ] Deduced a trap composed of 25 places in 411 ms of which 5 ms to minimize.
[2024-05-24 10:39:08] [INFO ] Deduced a trap composed of 68 places in 346 ms of which 5 ms to minimize.
[2024-05-24 10:39:09] [INFO ] Deduced a trap composed of 75 places in 419 ms of which 5 ms to minimize.
[2024-05-24 10:39:09] [INFO ] Deduced a trap composed of 87 places in 407 ms of which 5 ms to minimize.
[2024-05-24 10:39:10] [INFO ] Deduced a trap composed of 84 places in 360 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:39:13] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 4 ms to minimize.
[2024-05-24 10:39:19] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1057 variables, and 65 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 40/40 constraints]
After SMT, in 61549ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61573ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65436 ms. Remains : 393/393 places, 2112/2112 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 152 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 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 795 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 134433 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 4
Probabilistic random walk after 134433 steps, saw 82933 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-24 10:39:25] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:39:25] [INFO ] Invariant cache hit.
[2024-05-24 10:39:25] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1079 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:39:26] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:39:27] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-24 10:39:27] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 3 ms to minimize.
[2024-05-24 10:39:27] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2024-05-24 10:39:28] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 3 ms to minimize.
[2024-05-24 10:39:28] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2024-05-24 10:39:28] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 10:39:28] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-24 10:39:28] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2739 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 3844ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3308 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 93 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 393/393 places, 2112/2112 transitions.
RANDOM walk for 40000 steps (8 resets) in 651 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 122247 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 122247 steps, saw 76316 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-24 10:39:36] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:39:36] [INFO ] Invariant cache hit.
[2024-05-24 10:39:36] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:39:37] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 10:39:38] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 2 ms to minimize.
[2024-05-24 10:39:38] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 3 ms to minimize.
[2024-05-24 10:39:38] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 3 ms to minimize.
[2024-05-24 10:39:38] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 3 ms to minimize.
[2024-05-24 10:39:39] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 2 ms to minimize.
[2024-05-24 10:39:39] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 10:39:39] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-24 10:39:39] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3146 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 4100ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3190 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 115 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 111 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 10:39:43] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:39:43] [INFO ] Invariant cache hit.
[2024-05-24 10:39:44] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-24 10:39:44] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:39:44] [INFO ] Invariant cache hit.
[2024-05-24 10:39:45] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 10:39:48] [INFO ] Implicit Places using invariants and state equation in 3635 ms returned []
Implicit Place search using SMT with State Equation took 4393 ms to find 0 implicit places.
[2024-05-24 10:39:48] [INFO ] Redundant transitions in 81 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 10:39:48] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:39:48] [INFO ] Invariant cache hit.
[2024-05-24 10:39:48] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:40:13] [INFO ] Deduced a trap composed of 3 places in 443 ms of which 6 ms to minimize.
[2024-05-24 10:40:13] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 4 ms to minimize.
[2024-05-24 10:40:13] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2024-05-24 10:40:13] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 3 ms to minimize.
[2024-05-24 10:40:13] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-05-24 10:40:13] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 10:40:14] [INFO ] Deduced a trap composed of 60 places in 277 ms of which 4 ms to minimize.
[2024-05-24 10:40:14] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 2 ms to minimize.
[2024-05-24 10:40:16] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 4 ms to minimize.
[2024-05-24 10:40:16] [INFO ] Deduced a trap composed of 48 places in 297 ms of which 5 ms to minimize.
[2024-05-24 10:40:17] [INFO ] Deduced a trap composed of 50 places in 306 ms of which 5 ms to minimize.
[2024-05-24 10:40:17] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 3 ms to minimize.
[2024-05-24 10:40:17] [INFO ] Deduced a trap composed of 45 places in 303 ms of which 5 ms to minimize.
[2024-05-24 10:40:18] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-24 10:40:18] [INFO ] Deduced a trap composed of 76 places in 366 ms of which 5 ms to minimize.
[2024-05-24 10:40:19] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 5 ms to minimize.
[2024-05-24 10:40:19] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-24 10:40:19] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-05-24 10:40:20] [INFO ] Deduced a trap composed of 68 places in 390 ms of which 5 ms to minimize.
SMT process timed out in 31933ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 31965ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36565 ms. Remains : 393/393 places, 2112/2112 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1936 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 337 transition count 413
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 259 transition count 413
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 157 place count 259 transition count 397
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 236 transition count 397
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 420 place count 124 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 475 place count 124 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 485 place count 119 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 490 place count 119 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 497 place count 119 transition count 218
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 555 place count 119 transition count 160
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 613 place count 61 transition count 160
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 61 transition count 160
Applied a total of 621 rules in 26 ms. Remains 61 /393 variables (removed 332) and now considering 160/2112 (removed 1952) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 160 rows 61 cols
[2024-05-24 10:40:20] [INFO ] Computed 18 invariants in 2 ms
[2024-05-24 10:40:20] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 10:40:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 10:40:20] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 10:40:20] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 10:40:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 10:40:20] [INFO ] After 58ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 10:40:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-24 10:40:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-24 10:40:20] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 10:40:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 1
[2024-05-24 10:40:20] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 10:40:20] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 580 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 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 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 408 ms.
Product exploration explored 100000 steps with 0 reset in 461 ms.
Built C files in :
/tmp/ltsmin16848205267281724753
[2024-05-24 10:40:22] [INFO ] Too many transitions (2112) to apply POR reductions. Disabling POR matrices.
[2024-05-24 10:40:22] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16848205267281724753
Running compilation step : cd /tmp/ltsmin16848205267281724753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16848205267281724753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16848205267281724753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 70 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 10:40:25] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 10:40:25] [INFO ] Computed 25 invariants in 1 ms
[2024-05-24 10:40:25] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-24 10:40:25] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:40:25] [INFO ] Invariant cache hit.
[2024-05-24 10:40:26] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 10:40:29] [INFO ] Implicit Places using invariants and state equation in 3731 ms returned []
Implicit Place search using SMT with State Equation took 4378 ms to find 0 implicit places.
[2024-05-24 10:40:29] [INFO ] Redundant transitions in 89 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 10:40:29] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 10:40:29] [INFO ] Invariant cache hit.
[2024-05-24 10:40:29] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:40:53] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 4 ms to minimize.
[2024-05-24 10:40:53] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2024-05-24 10:40:53] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2024-05-24 10:40:53] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2024-05-24 10:40:53] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-24 10:40:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 10:40:54] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 2 ms to minimize.
[2024-05-24 10:40:54] [INFO ] Deduced a trap composed of 77 places in 199 ms of which 3 ms to minimize.
[2024-05-24 10:40:56] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 3 ms to minimize.
[2024-05-24 10:40:56] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 3 ms to minimize.
[2024-05-24 10:40:56] [INFO ] Deduced a trap composed of 50 places in 305 ms of which 4 ms to minimize.
[2024-05-24 10:40:56] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
[2024-05-24 10:40:57] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
[2024-05-24 10:40:57] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-05-24 10:40:57] [INFO ] Deduced a trap composed of 76 places in 254 ms of which 3 ms to minimize.
[2024-05-24 10:40:58] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 3 ms to minimize.
[2024-05-24 10:40:58] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-05-24 10:40:58] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 4 ms to minimize.
[2024-05-24 10:40:59] [INFO ] Deduced a trap composed of 68 places in 368 ms of which 5 ms to minimize.
[2024-05-24 10:40:59] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 45 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 10:41:09] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-24 10:41:13] [INFO ] Deduced a trap composed of 62 places in 347 ms of which 5 ms to minimize.
[2024-05-24 10:41:13] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 3 ms to minimize.
[2024-05-24 10:41:17] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-05-24 10:41:21] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-05-24 10:41:26] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1057 variables, and 51 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 26/26 constraints]
After SMT, in 61735ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61773ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66323 ms. Remains : 393/393 places, 2112/2112 transitions.
Built C files in :
/tmp/ltsmin855164714087744518
[2024-05-24 10:41:31] [INFO ] Too many transitions (2112) to apply POR reductions. Disabling POR matrices.
[2024-05-24 10:41:31] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin855164714087744518
Running compilation step : cd /tmp/ltsmin855164714087744518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin855164714087744518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin855164714087744518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 10:41:34] [INFO ] Flatten gal took : 60 ms
[2024-05-24 10:41:34] [INFO ] Flatten gal took : 86 ms
[2024-05-24 10:41:34] [INFO ] Time to serialize gal into /tmp/LTL4222996405033499676.gal : 14 ms
[2024-05-24 10:41:34] [INFO ] Time to serialize properties into /tmp/LTL14073320025545270960.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4222996405033499676.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3284475122424250553.hoa' '-atoms' '/tmp/LTL14073320025545270960.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14073320025545270960.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3284475122424250553.hoa
Detected timeout of ITS tools.
[2024-05-24 10:41:49] [INFO ] Flatten gal took : 59 ms
[2024-05-24 10:41:49] [INFO ] Flatten gal took : 58 ms
[2024-05-24 10:41:49] [INFO ] Time to serialize gal into /tmp/LTL17217210726762523244.gal : 9 ms
[2024-05-24 10:41:49] [INFO ] Time to serialize properties into /tmp/LTL9672271672071779025.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17217210726762523244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9672271672071779025.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((turn_6==0)||(p10_5_0==0))")||(X(X(F("(((turn_2==1)&&(flag_2_active==1))&&(p25_3_0==1))"))))))))
Formula 0 simplified : G(F!"((turn_6==0)||(p10_5_0==0))" & FG!"(((turn_2==1)&&(flag_2_active==1))&&(p25_3_0==1))")
Detected timeout of ITS tools.
[2024-05-24 10:42:05] [INFO ] Flatten gal took : 53 ms
[2024-05-24 10:42:05] [INFO ] Applying decomposition
[2024-05-24 10:42:05] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14740497157030449800.txt' '-o' '/tmp/graph14740497157030449800.bin' '-w' '/tmp/graph14740497157030449800.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14740497157030449800.bin' '-l' '-1' '-v' '-w' '/tmp/graph14740497157030449800.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:42:05] [INFO ] Decomposing Gal with order
[2024-05-24 10:42:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:42:05] [INFO ] Removed a total of 4448 redundant transitions.
[2024-05-24 10:42:05] [INFO ] Flatten gal took : 160 ms
[2024-05-24 10:42:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 485 labels/synchronizations in 58 ms.
[2024-05-24 10:42:05] [INFO ] Time to serialize gal into /tmp/LTL2323212849273674101.gal : 17 ms
[2024-05-24 10:42:05] [INFO ] Time to serialize properties into /tmp/LTL8563671549396561229.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2323212849273674101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8563671549396561229.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i2.u0.turn_6==0)||(i11.u15.p10_5_0==0))")||(X(X(F("(((i3.u6.turn_2==1)&&(i14.u3.flag_2_active==1))&&(i14.u3.p25_3_0==1))"))...161
Formula 0 simplified : G(F!"((i2.u0.turn_6==0)||(i11.u15.p10_5_0==0))" & FG!"(((i3.u6.turn_2==1)&&(i14.u3.flag_2_active==1))&&(i14.u3.p25_3_0==1))")
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-14 finished in 371927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-12
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 448 transition count 2160
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 542 place count 392 transition count 2104
Applied a total of 542 rules in 83 ms. Remains 392 /663 variables (removed 271) and now considering 2104/2424 (removed 320) transitions.
[2024-05-24 10:42:21] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 10:42:21] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 10:42:21] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-24 10:42:21] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:42:21] [INFO ] Invariant cache hit.
[2024-05-24 10:42:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:42:24] [INFO ] Implicit Places using invariants and state equation in 2707 ms returned []
Implicit Place search using SMT with State Equation took 3345 ms to find 0 implicit places.
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:42:24] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:42:24] [INFO ] Invariant cache hit.
[2024-05-24 10:42:24] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:42:51] [INFO ] Deduced a trap composed of 3 places in 556 ms of which 14 ms to minimize.
[2024-05-24 10:42:51] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 3 ms to minimize.
[2024-05-24 10:42:51] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 3 ms to minimize.
[2024-05-24 10:42:51] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-05-24 10:42:52] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-24 10:42:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 10:42:52] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 4 ms to minimize.
[2024-05-24 10:42:52] [INFO ] Deduced a trap composed of 71 places in 305 ms of which 4 ms to minimize.
[2024-05-24 10:42:53] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 4 ms to minimize.
[2024-05-24 10:42:53] [INFO ] Deduced a trap composed of 61 places in 332 ms of which 4 ms to minimize.
[2024-05-24 10:42:53] [INFO ] Deduced a trap composed of 22 places in 413 ms of which 5 ms to minimize.
[2024-05-24 10:42:54] [INFO ] Deduced a trap composed of 24 places in 375 ms of which 4 ms to minimize.
[2024-05-24 10:42:54] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 4 ms to minimize.
[2024-05-24 10:42:54] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 3 ms to minimize.
[2024-05-24 10:42:55] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 3 ms to minimize.
[2024-05-24 10:42:55] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 3 ms to minimize.
[2024-05-24 10:42:55] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 42 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:43:01] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 4 ms to minimize.
[2024-05-24 10:43:01] [INFO ] Deduced a trap composed of 49 places in 339 ms of which 4 ms to minimize.
[2024-05-24 10:43:02] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 3 ms to minimize.
[2024-05-24 10:43:02] [INFO ] Deduced a trap composed of 45 places in 289 ms of which 4 ms to minimize.
[2024-05-24 10:43:03] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 3 ms to minimize.
[2024-05-24 10:43:03] [INFO ] Deduced a trap composed of 73 places in 290 ms of which 3 ms to minimize.
[2024-05-24 10:43:03] [INFO ] Deduced a trap composed of 78 places in 310 ms of which 3 ms to minimize.
[2024-05-24 10:43:04] [INFO ] Deduced a trap composed of 71 places in 284 ms of which 3 ms to minimize.
[2024-05-24 10:43:04] [INFO ] Deduced a trap composed of 59 places in 243 ms of which 3 ms to minimize.
[2024-05-24 10:43:04] [INFO ] Deduced a trap composed of 60 places in 228 ms of which 3 ms to minimize.
[2024-05-24 10:43:05] [INFO ] Deduced a trap composed of 46 places in 304 ms of which 3 ms to minimize.
[2024-05-24 10:43:05] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 2 ms to minimize.
[2024-05-24 10:43:05] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 3 ms to minimize.
[2024-05-24 10:43:06] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 3 ms to minimize.
[2024-05-24 10:43:06] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
[2024-05-24 10:43:06] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 3 ms to minimize.
[2024-05-24 10:43:07] [INFO ] Deduced a trap composed of 82 places in 243 ms of which 3 ms to minimize.
[2024-05-24 10:43:07] [INFO ] Deduced a trap composed of 71 places in 294 ms of which 3 ms to minimize.
[2024-05-24 10:43:07] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 3 ms to minimize.
[2024-05-24 10:43:08] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:43:14] [INFO ] Deduced a trap composed of 66 places in 334 ms of which 5 ms to minimize.
[2024-05-24 10:43:15] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-05-24 10:43:15] [INFO ] Deduced a trap composed of 48 places in 353 ms of which 4 ms to minimize.
[2024-05-24 10:43:16] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 4 ms to minimize.
[2024-05-24 10:43:20] [INFO ] Deduced a trap composed of 15 places in 326 ms of which 4 ms to minimize.
[2024-05-24 10:43:24] [INFO ] Deduced a trap composed of 84 places in 381 ms of which 5 ms to minimize.
[2024-05-24 10:43:24] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 2 ms to minimize.
[2024-05-24 10:43:25] [INFO ] Deduced a trap composed of 78 places in 409 ms of which 5 ms to minimize.
[2024-05-24 10:43:25] [INFO ] Deduced a trap composed of 64 places in 367 ms of which 5 ms to minimize.
SMT process timed out in 61499ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61535ms
Starting structural reductions in LI_LTL mode, iteration 1 : 392/663 places, 2104/2424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64970 ms. Remains : 392/663 places, 2104/2424 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 394 ms.
Product exploration explored 100000 steps with 0 reset in 396 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 409302 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 409302 steps, saw 223147 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2024-05-24 10:43:29] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:43:29] [INFO ] Invariant cache hit.
[2024-05-24 10:43:29] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:43:30] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:43:30] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:43:31] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
[2024-05-24 10:43:31] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 2 ms to minimize.
[2024-05-24 10:43:31] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-05-24 10:43:31] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-05-24 10:43:31] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:43:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 65 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 411075 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 411075 steps, saw 224080 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2024-05-24 10:43:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:43:35] [INFO ] Invariant cache hit.
[2024-05-24 10:43:35] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:43:35] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:43:35] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:43:36] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 4 ms to minimize.
[2024-05-24 10:43:37] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 4 ms to minimize.
[2024-05-24 10:43:37] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 3 ms to minimize.
[2024-05-24 10:43:37] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2024-05-24 10:43:37] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:43:37] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1802 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2419ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 66 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 69 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 10:43:38] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:43:38] [INFO ] Invariant cache hit.
[2024-05-24 10:43:39] [INFO ] Implicit Places using invariants in 919 ms returned []
[2024-05-24 10:43:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:43:39] [INFO ] Invariant cache hit.
[2024-05-24 10:43:39] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:43:41] [INFO ] Implicit Places using invariants and state equation in 2382 ms returned []
Implicit Place search using SMT with State Equation took 3303 ms to find 0 implicit places.
[2024-05-24 10:43:41] [INFO ] Redundant transitions in 54 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:43:41] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:43:41] [INFO ] Invariant cache hit.
[2024-05-24 10:43:41] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:44:08] [INFO ] Deduced a trap composed of 3 places in 387 ms of which 5 ms to minimize.
[2024-05-24 10:44:09] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 3 ms to minimize.
[2024-05-24 10:44:09] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 2 ms to minimize.
[2024-05-24 10:44:09] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-05-24 10:44:09] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-24 10:44:09] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 10:44:09] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 4 ms to minimize.
[2024-05-24 10:44:10] [INFO ] Deduced a trap composed of 71 places in 288 ms of which 3 ms to minimize.
[2024-05-24 10:44:10] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 6 ms to minimize.
[2024-05-24 10:44:10] [INFO ] Deduced a trap composed of 61 places in 257 ms of which 3 ms to minimize.
[2024-05-24 10:44:11] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 3 ms to minimize.
[2024-05-24 10:44:11] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 3 ms to minimize.
[2024-05-24 10:44:11] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 3 ms to minimize.
[2024-05-24 10:44:12] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 2 ms to minimize.
[2024-05-24 10:44:12] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 2 ms to minimize.
[2024-05-24 10:44:12] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 3 ms to minimize.
[2024-05-24 10:44:12] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 3 ms to minimize.
[2024-05-24 10:44:13] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
SMT process timed out in 31598ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31635ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35078 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 30 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 10:44:13] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 10:44:13] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 10:44:13] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 10:44:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-24 10:44:13] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 10:44:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 10:44:13] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 10:44:13] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-24 10:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2024-05-24 10:44:13] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 10:44:13] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 396 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 60 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 67 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 10:44:13] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 10:44:13] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 10:44:14] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-05-24 10:44:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:44:14] [INFO ] Invariant cache hit.
[2024-05-24 10:44:15] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:44:17] [INFO ] Implicit Places using invariants and state equation in 2623 ms returned []
Implicit Place search using SMT with State Equation took 3526 ms to find 0 implicit places.
[2024-05-24 10:44:17] [INFO ] Redundant transitions in 89 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:44:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:44:17] [INFO ] Invariant cache hit.
[2024-05-24 10:44:17] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:44:47] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 3 ms to minimize.
[2024-05-24 10:44:47] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 2 ms to minimize.
[2024-05-24 10:44:47] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 2 ms to minimize.
[2024-05-24 10:44:47] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-05-24 10:44:47] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-24 10:44:47] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 10:44:48] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2024-05-24 10:44:48] [INFO ] Deduced a trap composed of 71 places in 311 ms of which 4 ms to minimize.
[2024-05-24 10:44:48] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 3 ms to minimize.
[2024-05-24 10:44:49] [INFO ] Deduced a trap composed of 61 places in 303 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 35 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:44:54] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 4 ms to minimize.
[2024-05-24 10:44:55] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 4 ms to minimize.
[2024-05-24 10:44:55] [INFO ] Deduced a trap composed of 43 places in 326 ms of which 5 ms to minimize.
[2024-05-24 10:44:55] [INFO ] Deduced a trap composed of 50 places in 292 ms of which 4 ms to minimize.
[2024-05-24 10:44:56] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 5 ms to minimize.
[2024-05-24 10:44:56] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-24 10:44:57] [INFO ] Deduced a trap composed of 48 places in 325 ms of which 4 ms to minimize.
[2024-05-24 10:44:57] [INFO ] Deduced a trap composed of 49 places in 273 ms of which 4 ms to minimize.
[2024-05-24 10:44:57] [INFO ] Deduced a trap composed of 53 places in 330 ms of which 5 ms to minimize.
[2024-05-24 10:44:58] [INFO ] Deduced a trap composed of 45 places in 410 ms of which 5 ms to minimize.
[2024-05-24 10:44:58] [INFO ] Deduced a trap composed of 48 places in 380 ms of which 5 ms to minimize.
[2024-05-24 10:44:58] [INFO ] Deduced a trap composed of 54 places in 375 ms of which 5 ms to minimize.
[2024-05-24 10:44:59] [INFO ] Deduced a trap composed of 47 places in 363 ms of which 5 ms to minimize.
[2024-05-24 10:44:59] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 5 ms to minimize.
[2024-05-24 10:45:00] [INFO ] Deduced a trap composed of 48 places in 409 ms of which 5 ms to minimize.
[2024-05-24 10:45:00] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-24 10:45:00] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-24 10:45:00] [INFO ] Deduced a trap composed of 11 places in 335 ms of which 4 ms to minimize.
[2024-05-24 10:45:01] [INFO ] Deduced a trap composed of 33 places in 397 ms of which 5 ms to minimize.
[2024-05-24 10:45:01] [INFO ] Deduced a trap composed of 70 places in 351 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:45:07] [INFO ] Deduced a trap composed of 67 places in 317 ms of which 4 ms to minimize.
[2024-05-24 10:45:08] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 4 ms to minimize.
[2024-05-24 10:45:11] [INFO ] Deduced a trap composed of 63 places in 298 ms of which 4 ms to minimize.
[2024-05-24 10:45:11] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-24 10:45:15] [INFO ] Deduced a trap composed of 63 places in 359 ms of which 5 ms to minimize.
[2024-05-24 10:45:16] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 61 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 36/36 constraints]
After SMT, in 61550ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61586ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65279 ms. Remains : 392/392 places, 2104/2104 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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)]
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 385326 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 385326 steps, saw 211925 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2024-05-24 10:45:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:45:22] [INFO ] Invariant cache hit.
[2024-05-24 10:45:22] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:45:22] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:45:22] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:45:23] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 4 ms to minimize.
[2024-05-24 10:45:24] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 4 ms to minimize.
[2024-05-24 10:45:24] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 3 ms to minimize.
[2024-05-24 10:45:24] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 3 ms to minimize.
[2024-05-24 10:45:24] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:45:25] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2170 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2844ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 108 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 345006 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 345006 steps, saw 192037 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-24 10:45:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:45:28] [INFO ] Invariant cache hit.
[2024-05-24 10:45:28] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:45:28] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:45:28] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:45:30] [INFO ] Deduced a trap composed of 3 places in 340 ms of which 4 ms to minimize.
[2024-05-24 10:45:30] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 4 ms to minimize.
[2024-05-24 10:45:30] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 4 ms to minimize.
[2024-05-24 10:45:31] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2024-05-24 10:45:31] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 10:45:31] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2257 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3150ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 107 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 107 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 10:45:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:45:32] [INFO ] Invariant cache hit.
[2024-05-24 10:45:32] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-05-24 10:45:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:45:32] [INFO ] Invariant cache hit.
[2024-05-24 10:45:33] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:45:36] [INFO ] Implicit Places using invariants and state equation in 3526 ms returned []
Implicit Place search using SMT with State Equation took 4460 ms to find 0 implicit places.
[2024-05-24 10:45:36] [INFO ] Redundant transitions in 91 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:45:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:45:36] [INFO ] Invariant cache hit.
[2024-05-24 10:45:36] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:46:03] [INFO ] Deduced a trap composed of 3 places in 427 ms of which 4 ms to minimize.
[2024-05-24 10:46:03] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 4 ms to minimize.
[2024-05-24 10:46:04] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 2 ms to minimize.
[2024-05-24 10:46:04] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 3 ms to minimize.
[2024-05-24 10:46:04] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2024-05-24 10:46:04] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-24 10:46:04] [INFO ] Deduced a trap composed of 43 places in 324 ms of which 5 ms to minimize.
[2024-05-24 10:46:05] [INFO ] Deduced a trap composed of 71 places in 383 ms of which 5 ms to minimize.
[2024-05-24 10:46:05] [INFO ] Deduced a trap composed of 28 places in 424 ms of which 5 ms to minimize.
[2024-05-24 10:46:06] [INFO ] Deduced a trap composed of 61 places in 383 ms of which 5 ms to minimize.
[2024-05-24 10:46:06] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 5 ms to minimize.
[2024-05-24 10:46:07] [INFO ] Deduced a trap composed of 24 places in 388 ms of which 5 ms to minimize.
[2024-05-24 10:46:07] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 5 ms to minimize.
[2024-05-24 10:46:07] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 3 ms to minimize.
[2024-05-24 10:46:07] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 3 ms to minimize.
[2024-05-24 10:46:08] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 3 ms to minimize.
[2024-05-24 10:46:08] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 42 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:46:13] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 3 ms to minimize.
[2024-05-24 10:46:14] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 5 ms to minimize.
[2024-05-24 10:46:14] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 3 ms to minimize.
[2024-05-24 10:46:14] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 3 ms to minimize.
[2024-05-24 10:46:15] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 3 ms to minimize.
[2024-05-24 10:46:15] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 3 ms to minimize.
[2024-05-24 10:46:16] [INFO ] Deduced a trap composed of 78 places in 342 ms of which 4 ms to minimize.
[2024-05-24 10:46:16] [INFO ] Deduced a trap composed of 71 places in 256 ms of which 5 ms to minimize.
[2024-05-24 10:46:16] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 3 ms to minimize.
[2024-05-24 10:46:17] [INFO ] Deduced a trap composed of 60 places in 225 ms of which 3 ms to minimize.
[2024-05-24 10:46:17] [INFO ] Deduced a trap composed of 46 places in 335 ms of which 4 ms to minimize.
[2024-05-24 10:46:18] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 3 ms to minimize.
[2024-05-24 10:46:18] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 3 ms to minimize.
[2024-05-24 10:46:18] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 5 ms to minimize.
[2024-05-24 10:46:19] [INFO ] Deduced a trap composed of 45 places in 300 ms of which 6 ms to minimize.
[2024-05-24 10:46:19] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 3 ms to minimize.
[2024-05-24 10:46:20] [INFO ] Deduced a trap composed of 82 places in 320 ms of which 4 ms to minimize.
[2024-05-24 10:46:20] [INFO ] Deduced a trap composed of 71 places in 283 ms of which 4 ms to minimize.
[2024-05-24 10:46:20] [INFO ] Deduced a trap composed of 49 places in 274 ms of which 3 ms to minimize.
[2024-05-24 10:46:20] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:46:26] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 3 ms to minimize.
[2024-05-24 10:46:26] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 10:46:26] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
[2024-05-24 10:46:27] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 3 ms to minimize.
[2024-05-24 10:46:31] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
[2024-05-24 10:46:33] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 2 ms to minimize.
[2024-05-24 10:46:33] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-24 10:46:34] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 3 ms to minimize.
[2024-05-24 10:46:34] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 3 ms to minimize.
[2024-05-24 10:46:34] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 2 ms to minimize.
[2024-05-24 10:46:34] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 2 ms to minimize.
[2024-05-24 10:46:36] [INFO ] Deduced a trap composed of 55 places in 327 ms of which 4 ms to minimize.
[2024-05-24 10:46:38] [INFO ] Deduced a trap composed of 73 places in 500 ms of which 6 ms to minimize.
[2024-05-24 10:46:38] [INFO ] Deduced a trap composed of 73 places in 378 ms of which 5 ms to minimize.
SMT process timed out in 62019ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 62055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66725 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 29 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 10:46:38] [INFO ] Computed 17 invariants in 0 ms
[2024-05-24 10:46:38] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-24 10:46:38] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 10:46:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 10:46:38] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 10:46:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 10:46:38] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 10:46:38] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 10:46:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 1
[2024-05-24 10:46:39] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 10:46:39] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 361 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 66 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 276 ms.
Product exploration explored 100000 steps with 0 reset in 287 ms.
Built C files in :
/tmp/ltsmin17126071153901094530
[2024-05-24 10:46:39] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-24 10:46:39] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17126071153901094530
Running compilation step : cd /tmp/ltsmin17126071153901094530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17126071153901094530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17126071153901094530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 68 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 10:46:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 10:46:43] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 10:46:43] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-24 10:46:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:46:43] [INFO ] Invariant cache hit.
[2024-05-24 10:46:44] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 10:46:46] [INFO ] Implicit Places using invariants and state equation in 2948 ms returned []
Implicit Place search using SMT with State Equation took 3672 ms to find 0 implicit places.
[2024-05-24 10:46:46] [INFO ] Redundant transitions in 53 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 10:46:46] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 10:46:46] [INFO ] Invariant cache hit.
[2024-05-24 10:46:46] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:47:07] [INFO ] Deduced a trap composed of 3 places in 433 ms of which 3 ms to minimize.
[2024-05-24 10:47:07] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 3 ms to minimize.
[2024-05-24 10:47:07] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 3 ms to minimize.
[2024-05-24 10:47:08] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2024-05-24 10:47:08] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-24 10:47:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 10:47:08] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2024-05-24 10:47:08] [INFO ] Deduced a trap composed of 71 places in 314 ms of which 4 ms to minimize.
[2024-05-24 10:47:09] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 5 ms to minimize.
[2024-05-24 10:47:09] [INFO ] Deduced a trap composed of 61 places in 309 ms of which 4 ms to minimize.
[2024-05-24 10:47:09] [INFO ] Deduced a trap composed of 22 places in 345 ms of which 5 ms to minimize.
[2024-05-24 10:47:10] [INFO ] Deduced a trap composed of 24 places in 347 ms of which 5 ms to minimize.
[2024-05-24 10:47:10] [INFO ] Deduced a trap composed of 29 places in 296 ms of which 5 ms to minimize.
[2024-05-24 10:47:10] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 4 ms to minimize.
[2024-05-24 10:47:11] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 3 ms to minimize.
[2024-05-24 10:47:11] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 3 ms to minimize.
[2024-05-24 10:47:11] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 3 ms to minimize.
[2024-05-24 10:47:11] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-24 10:47:13] [INFO ] Deduced a trap composed of 48 places in 390 ms of which 5 ms to minimize.
[2024-05-24 10:47:13] [INFO ] Deduced a trap composed of 15 places in 441 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 10:47:14] [INFO ] Deduced a trap composed of 76 places in 244 ms of which 5 ms to minimize.
[2024-05-24 10:47:16] [INFO ] Deduced a trap composed of 45 places in 312 ms of which 5 ms to minimize.
[2024-05-24 10:47:16] [INFO ] Deduced a trap composed of 48 places in 338 ms of which 5 ms to minimize.
[2024-05-24 10:47:17] [INFO ] Deduced a trap composed of 59 places in 307 ms of which 5 ms to minimize.
[2024-05-24 10:47:17] [INFO ] Deduced a trap composed of 45 places in 299 ms of which 5 ms to minimize.
[2024-05-24 10:47:17] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 5 ms to minimize.
[2024-05-24 10:47:18] [INFO ] Deduced a trap composed of 49 places in 324 ms of which 5 ms to minimize.
SMT process timed out in 31587ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31609ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35408 ms. Remains : 392/392 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin1219805776632353748
[2024-05-24 10:47:18] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2024-05-24 10:47:18] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1219805776632353748
Running compilation step : cd /tmp/ltsmin1219805776632353748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin1219805776632353748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin1219805776632353748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 10:47:21] [INFO ] Flatten gal took : 53 ms
[2024-05-24 10:47:21] [INFO ] Flatten gal took : 52 ms
[2024-05-24 10:47:21] [INFO ] Time to serialize gal into /tmp/LTL15022559806422824941.gal : 8 ms
[2024-05-24 10:47:21] [INFO ] Time to serialize properties into /tmp/LTL12518518616446678776.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15022559806422824941.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13150905293891627745.hoa' '-atoms' '/tmp/LTL12518518616446678776.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12518518616446678776.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13150905293891627745.hoa
Detected timeout of ITS tools.
[2024-05-24 10:47:36] [INFO ] Flatten gal took : 51 ms
[2024-05-24 10:47:36] [INFO ] Flatten gal took : 52 ms
[2024-05-24 10:47:36] [INFO ] Time to serialize gal into /tmp/LTL9968341217010707898.gal : 8 ms
[2024-05-24 10:47:36] [INFO ] Time to serialize properties into /tmp/LTL13314064305286141809.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9968341217010707898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13314064305286141809.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"
Detected timeout of ITS tools.
[2024-05-24 10:47:51] [INFO ] Flatten gal took : 52 ms
[2024-05-24 10:47:51] [INFO ] Applying decomposition
[2024-05-24 10:47:51] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13091563153005413878.txt' '-o' '/tmp/graph13091563153005413878.bin' '-w' '/tmp/graph13091563153005413878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13091563153005413878.bin' '-l' '-1' '-v' '-w' '/tmp/graph13091563153005413878.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:47:52] [INFO ] Decomposing Gal with order
[2024-05-24 10:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:47:52] [INFO ] Removed a total of 4423 redundant transitions.
[2024-05-24 10:47:52] [INFO ] Flatten gal took : 150 ms
[2024-05-24 10:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 472 labels/synchronizations in 39 ms.
[2024-05-24 10:47:52] [INFO ] Time to serialize gal into /tmp/LTL3526804037320665187.gal : 15 ms
[2024-05-24 10:47:52] [INFO ] Time to serialize properties into /tmp/LTL5637852669681920832.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3526804037320665187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5637852669681920832.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i14.u7.turn_1!=1)||(i0.u27.flag_1_idle!=1))||(i3.u3.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((i14.u7.turn_1!=1)||(i0.u27.flag_1_idle!=1))||(i3.u3.p25_3_5!=1))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 346808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p1)))||p0))))'
[2024-05-24 10:48:07] [INFO ] Flatten gal took : 98 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8725179258598389599
[2024-05-24 10:48:07] [INFO ] Too many transitions (2424) to apply POR reductions. Disabling POR matrices.
[2024-05-24 10:48:07] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8725179258598389599
Running compilation step : cd /tmp/ltsmin8725179258598389599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 10:48:07] [INFO ] Applying decomposition
[2024-05-24 10:48:08] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5357168899409815290.txt' '-o' '/tmp/graph5357168899409815290.bin' '-w' '/tmp/graph5357168899409815290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5357168899409815290.bin' '-l' '-1' '-v' '-w' '/tmp/graph5357168899409815290.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:48:08] [INFO ] Decomposing Gal with order
[2024-05-24 10:48:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:48:08] [INFO ] Removed a total of 4686 redundant transitions.
[2024-05-24 10:48:08] [INFO ] Flatten gal took : 155 ms
[2024-05-24 10:48:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 626 labels/synchronizations in 54 ms.
[2024-05-24 10:48:08] [INFO ] Time to serialize gal into /tmp/LTLFireability12999913727432358853.gal : 20 ms
[2024-05-24 10:48:08] [INFO ] Time to serialize properties into /tmp/LTLFireability7526688190246136091.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12999913727432358853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7526688190246136091.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(G("(((i0.i0.u0.turn_1!=1)||(i0.i0.u3.flag_1_idle!=1))||(i13.i2.u4.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((i0.i0.u0.turn_1!=1)||(i0.i0.u3.flag_1_idle!=1))||(i13.i2.u4.p25_3_5!=1))"
Compilation finished in 10786 ms.
Running link step : cd /tmp/ltsmin8725179258598389599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin8725179258598389599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8725179258598389599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8725179258598389599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp1==true)&&([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8725179258598389599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp1==true)&&([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8725179258598389599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(X(<>((LTLAPp5==true))))||(LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8725179258598389599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(X(<>((LTLAPp5==true))))||(LTLAPp4==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin8725179258598389599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'

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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is EisenbergMcGuire-PT-08, 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 r158-smll-171636266300188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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