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.r356-tall-171683761000412.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 ShieldPPPs-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761000412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 11:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 13 11:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 11:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716959556031

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 05:12:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 05:12:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:12:37] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-29 05:12:37] [INFO ] Transformed 275 places.
[2024-05-29 05:12:37] [INFO ] Transformed 255 transitions.
[2024-05-29 05:12:37] [INFO ] Found NUPN structural information;
[2024-05-29 05:12:37] [INFO ] Parsed PT model containing 275 places and 255 transitions and 702 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-004B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 255/255 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 249 transition count 229
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 249 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 248 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 248 transition count 228
Applied a total of 54 rules in 61 ms. Remains 248 /275 variables (removed 27) and now considering 228/255 (removed 27) transitions.
// Phase 1: matrix 228 rows 248 cols
[2024-05-29 05:12:37] [INFO ] Computed 45 invariants in 20 ms
[2024-05-29 05:12:37] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-29 05:12:37] [INFO ] Invariant cache hit.
[2024-05-29 05:12:38] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-29 05:12:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:40] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 12 ms to minimize.
[2024-05-29 05:12:40] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:12:40] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-29 05:12:40] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:12:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:12:40] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:12:40] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:12:40] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-29 05:12:40] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-29 05:12:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:12:42] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:12:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-05-29 05:12:45] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:12:45] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2024-05-29 05:12:45] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:12:45] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 5 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:12:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:12:47] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:12:47] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:12:47] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:12:47] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:47] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:12:48] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:12:48] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:50] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:51] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:12:51] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:52] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:12:52] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:12:52] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-29 05:12:52] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-29 05:12:52] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:12:52] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:12:52] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:12:52] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:12:52] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:12:53] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2024-05-29 05:12:53] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-29 05:12:53] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:12:53] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:55] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:12:55] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:12:55] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:12:55] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:12:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:12:55] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:12:55] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:57] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:12:58] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:13:00] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:13:00] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:13:00] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:13:00] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:13:02] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:13:03] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:13:03] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:13:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 17 (OVERLAPS) 228/476 variables, 248/414 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:13:07] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:13:07] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/476 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 416 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 123/123 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 123/168 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:13:09] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:13:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:13:09] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:13:09] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:13:09] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:13:10] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:13:10] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:13:10] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:13:10] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:13:10] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:13:10] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:13:10] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:13:10] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:13:11] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:13:11] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:13:11] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:13:11] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:13:11] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:13:11] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:13:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:13:13] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:13:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 228/476 variables, 248/438 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 227/665 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:13:16] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:13:18] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:13:19] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:13:19] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:13:19] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:13:20] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 05:13:30] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-29 05:13:30] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-29 05:13:30] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:13:31] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-29 05:13:32] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-29 05:13:32] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-29 05:13:32] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:13:32] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:13:33] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-29 05:13:33] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-29 05:13:34] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-29 05:13:34] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:13:34] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:13:34] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:13:34] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:13:35] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:13:35] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:13:35] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:13:36] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 690 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 170/170 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 248/275 places, 228/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60651 ms. Remains : 248/275 places, 228/255 transitions.
Support contains 29 out of 248 places after structural reductions.
[2024-05-29 05:13:38] [INFO ] Flatten gal took : 40 ms
[2024-05-29 05:13:38] [INFO ] Flatten gal took : 15 ms
[2024-05-29 05:13:38] [INFO ] Input system was already deterministic with 228 transitions.
Support contains 28 out of 248 places (down from 29) after GAL structural reductions.
RANDOM walk for 2585 steps (1 resets) in 115 ms. (22 steps per ms) remains 0/23 properties
Computed a total of 49 stabilizing places and 49 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(p1)&&p0)))'
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 247 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 247 transition count 227
Applied a total of 2 rules in 11 ms. Remains 247 /248 variables (removed 1) and now considering 227/228 (removed 1) transitions.
// Phase 1: matrix 227 rows 247 cols
[2024-05-29 05:13:38] [INFO ] Computed 45 invariants in 5 ms
[2024-05-29 05:13:39] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-29 05:13:39] [INFO ] Invariant cache hit.
[2024-05-29 05:13:39] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-29 05:13:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:13:41] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:13:42] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:13:43] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:13:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:13:44] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:13:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:13:45] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:13:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:13:45] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:13:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:13:45] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:13:45] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:13:45] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:13:46] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:13:46] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-29 05:13:46] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:13:46] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:13:46] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:13:46] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:13:46] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:13:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:13:47] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:13:47] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:13:47] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:13:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:13:48] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:13:49] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:13:49] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:13:49] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 16/123 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:13:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
[2024-05-29 05:13:50] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:13:51] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:13:51] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:13:51] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:13:51] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:13:51] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-29 05:13:51] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:13:51] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 9/132 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:13:52] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:13:52] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-05-29 05:13:52] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:13:52] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:13:52] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/474 variables, 247/384 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:13:55] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:13:55] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:13:55] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:13:55] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:13:56] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:13:56] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:13:56] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:13:56] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:13:57] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 9/393 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:13:57] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:13:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:13:57] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:13:58] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:13:58] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 5/398 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:14:01] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:14:01] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:14:01] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:14:01] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:14:01] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:14:01] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:14:03] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:14:04] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:14:05] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:14:07] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:14:08] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:14:08] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-29 05:14:08] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:14:08] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:14:08] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:14:08] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/474 variables, 7/414 constraints. Problems are: Problem set: 0 solved, 226 unsolved
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 Real declared 474/474 variables, and 414 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 122/167 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:14:10] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:14:10] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:14:11] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:14:11] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:14:12] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:14:12] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:14:12] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:14:12] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:14:12] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:14:12] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:14:12] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:14:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:14:13] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 227/474 variables, 247/427 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 226/653 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:14:18] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:14:18] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:14:19] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-29 05:14:19] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-29 05:14:19] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:14:19] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:14:19] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:14:20] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:14:20] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:14:21] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 10/663 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:14:33] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-29 05:14:33] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:14:34] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:14:34] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:14:35] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:14:35] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:14:35] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:14:36] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2024-05-29 05:14:36] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:14:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:14:36] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:14:36] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:14:37] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:14:38] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/474 variables, and 677 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 159/159 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 247/248 places, 227/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60382 ms. Remains : 247/248 places, 227/228 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-004B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004B-LTLFireability-00 finished in 60702 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 1 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 247 transition count 197
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 217 transition count 197
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 60 place count 217 transition count 177
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 100 place count 197 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 196 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 196 transition count 176
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 240 place count 127 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 125 transition count 105
Applied a total of 242 rules in 47 ms. Remains 125 /248 variables (removed 123) and now considering 105/228 (removed 123) transitions.
// Phase 1: matrix 105 rows 125 cols
[2024-05-29 05:14:39] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 05:14:39] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 05:14:39] [INFO ] Invariant cache hit.
[2024-05-29 05:14:39] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-29 05:14:39] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-29 05:14:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-29 05:14:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:14:40] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:14:40] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:14:40] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 105/230 variables, 125/174 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-29 05:14:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/230 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 175 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2650 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 105/230 variables, 125/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 103/278 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-29 05:14:43] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 279 constraints, problems are : Problem set: 0 solved, 103 unsolved in 12746 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 6/6 constraints]
After SMT, in 15416ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 15418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/248 places, 105/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15621 ms. Remains : 125/248 places, 105/228 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-01
Product exploration explored 100000 steps with 2213 reset in 364 ms.
Product exploration explored 100000 steps with 2202 reset in 235 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 210 steps (0 resets) in 4 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-05-29 05:14:56] [INFO ] Invariant cache hit.
[2024-05-29 05:14:56] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:14:56] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-29 05:14:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:14:56] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:14:56] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-29 05:14:56] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:14:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:14:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2024-05-29 05:14:56] [INFO ] Computed and/alt/rep : 103/194/103 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 05:14:56] [INFO ] Added : 103 causal constraints over 21 iterations in 242 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 105/105 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-29 05:14:56] [INFO ] Invariant cache hit.
[2024-05-29 05:14:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 05:14:56] [INFO ] Invariant cache hit.
[2024-05-29 05:14:57] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-29 05:14:57] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-29 05:14:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-29 05:14:57] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:14:57] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:14:57] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:14:57] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 105/230 variables, 125/174 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-29 05:14:58] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/230 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 175 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2604 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 105/230 variables, 125/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 103/278 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-29 05:15:00] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 279 constraints, problems are : Problem set: 0 solved, 103 unsolved in 12605 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 6/6 constraints]
After SMT, in 15220ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 15221ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15401 ms. Remains : 125/125 places, 105/105 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 204 steps (0 resets) in 6 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 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 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-05-29 05:15:12] [INFO ] Invariant cache hit.
[2024-05-29 05:15:12] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:15:12] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-29 05:15:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:15:12] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:15:12] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-29 05:15:12] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:15:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:15:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2024-05-29 05:15:13] [INFO ] Computed and/alt/rep : 103/194/103 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-29 05:15:13] [INFO ] Added : 103 causal constraints over 21 iterations in 222 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2216 reset in 191 ms.
Product exploration explored 100000 steps with 2218 reset in 198 ms.
Built C files in :
/tmp/ltsmin988756737231412549
[2024-05-29 05:15:13] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2024-05-29 05:15:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:15:13] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2024-05-29 05:15:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:15:13] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2024-05-29 05:15:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:15:13] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin988756737231412549
Running compilation step : cd /tmp/ltsmin988756737231412549;'/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'
Compilation finished in 390 ms.
Running link step : cd /tmp/ltsmin988756737231412549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin988756737231412549;'/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' '--hoa' '/tmp/stateBased18197988303999228459.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 105/105 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-29 05:15:28] [INFO ] Invariant cache hit.
[2024-05-29 05:15:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 05:15:28] [INFO ] Invariant cache hit.
[2024-05-29 05:15:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-29 05:15:29] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-29 05:15:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-29 05:15:29] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:15:29] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:15:29] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:15:29] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 105/230 variables, 125/174 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-29 05:15:30] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/230 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 175 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2624 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 105/230 variables, 125/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 103/278 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-29 05:15:32] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 279 constraints, problems are : Problem set: 0 solved, 103 unsolved in 12579 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 6/6 constraints]
After SMT, in 15214ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 15215ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15396 ms. Remains : 125/125 places, 105/105 transitions.
Built C files in :
/tmp/ltsmin1919272152906577899
[2024-05-29 05:15:44] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2024-05-29 05:15:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:15:44] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2024-05-29 05:15:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:15:44] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2024-05-29 05:15:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:15:44] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1919272152906577899
Running compilation step : cd /tmp/ltsmin1919272152906577899;'/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'
Compilation finished in 249 ms.
Running link step : cd /tmp/ltsmin1919272152906577899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1919272152906577899;'/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' '--hoa' '/tmp/stateBased10273648374876440721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:15:59] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:15:59] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:15:59] [INFO ] Time to serialize gal into /tmp/LTL3932140962365447715.gal : 2 ms
[2024-05-29 05:15:59] [INFO ] Time to serialize properties into /tmp/LTL1707851809951641716.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/LTL3932140962365447715.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8608444068404196004.hoa' '-atoms' '/tmp/LTL1707851809951641716.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...317
Loading property file /tmp/LTL1707851809951641716.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8608444068404196004.hoa
Detected timeout of ITS tools.
[2024-05-29 05:16:14] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:16:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:16:14] [INFO ] Time to serialize gal into /tmp/LTL17035930248614805272.gal : 2 ms
[2024-05-29 05:16:14] [INFO ] Time to serialize properties into /tmp/LTL9086050865323156615.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/LTL17035930248614805272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9086050865323156615.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 : !((G(F("(p131==1)"))))
Formula 0 simplified : FG!"(p131==1)"
Detected timeout of ITS tools.
[2024-05-29 05:16:29] [INFO ] Flatten gal took : 14 ms
[2024-05-29 05:16:29] [INFO ] Applying decomposition
[2024-05-29 05:16:29] [INFO ] Flatten gal took : 5 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/graph1512202323575132875.txt' '-o' '/tmp/graph1512202323575132875.bin' '-w' '/tmp/graph1512202323575132875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1512202323575132875.bin' '-l' '-1' '-v' '-w' '/tmp/graph1512202323575132875.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:16:29] [INFO ] Decomposing Gal with order
[2024-05-29 05:16:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:16:29] [INFO ] Removed a total of 25 redundant transitions.
[2024-05-29 05:16:29] [INFO ] Flatten gal took : 32 ms
[2024-05-29 05:16:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 5 ms.
[2024-05-29 05:16:29] [INFO ] Time to serialize gal into /tmp/LTL5968556370794434395.gal : 3 ms
[2024-05-29 05:16:29] [INFO ] Time to serialize properties into /tmp/LTL16125470790048491090.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/LTL5968556370794434395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16125470790048491090.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(i4.i1.u22.p131==1)"))))
Formula 0 simplified : FG!"(i4.i1.u22.p131==1)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004B-LTLFireability-01 finished in 125181 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(F((p0&&X(X(F(p1)))))))'
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 247 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 247 transition count 227
Applied a total of 2 rules in 6 ms. Remains 247 /248 variables (removed 1) and now considering 227/228 (removed 1) transitions.
// Phase 1: matrix 227 rows 247 cols
[2024-05-29 05:16:44] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 05:16:44] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 05:16:44] [INFO ] Invariant cache hit.
[2024-05-29 05:16:44] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-29 05:16:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:16:46] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:16:46] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:16:47] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:16:48] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:16:49] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:16:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:16:50] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:16:50] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:16:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:16:50] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:16:51] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:16:51] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:16:51] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:16:51] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 05:16:51] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:16:51] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:16:51] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:16:52] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:16:52] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:16:52] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 227/474 variables, 247/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:16:55] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:16:55] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:16:55] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:16:55] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-29 05:16:55] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:16:56] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 6/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:16:57] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:16:57] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2024-05-29 05:16:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:16:57] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:16:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:16:57] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:16:58] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:16:58] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:16:58] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:16:58] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 10/363 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:01] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:17:02] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-29 05:17:02] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:03] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:17:04] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:17:04] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:17:04] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:17:04] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:17:04] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:17:04] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 7/374 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:07] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:08] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:17:08] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-29 05:17:08] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:17:08] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:17:09] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:17:09] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:17:09] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:17:09] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:17:09] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:13] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:17:13] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:17:13] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/474 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/474 variables, and 387 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 95/140 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:17:16] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:17:17] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:17:17] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:17:17] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:17:17] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:17:17] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:17:17] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 17/157 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:17:18] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:17:19] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:17:19] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:19] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:17:20] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 19/191 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:17:21] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:17:22] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:17:22] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:17:22] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 227/474 variables, 247/443 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 226/669 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:27] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-29 05:17:27] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:17:27] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-29 05:17:27] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-29 05:17:28] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-29 05:17:28] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:17:28] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:17:28] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:17:28] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:17:29] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 5 ms to minimize.
[2024-05-29 05:17:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:17:32] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 12/681 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:39] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-29 05:17:39] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-29 05:17:39] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:17:39] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:17:39] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-29 05:17:40] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:17:40] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:17:40] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:17:40] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:17:40] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:17:40] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:17:41] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:17:41] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:17:41] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 14/695 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/474 variables, and 695 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 177/177 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 247/248 places, 227/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60266 ms. Remains : 247/248 places, 227/228 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-02
Product exploration explored 100000 steps with 1201 reset in 171 ms.
Product exploration explored 100000 steps with 1215 reset in 174 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 265 steps (0 resets) in 7 ms. (33 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-29 05:17:46] [INFO ] Invariant cache hit.
[2024-05-29 05:17:46] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:17:46] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-29 05:17:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:17:46] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:17:46] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-29 05:17:46] [INFO ] Computed and/alt/rep : 226/399/226 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 05:17:48] [INFO ] Added : 225 causal constraints over 45 iterations in 2023 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-29 05:17:48] [INFO ] Invariant cache hit.
[2024-05-29 05:17:48] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:17:48] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-29 05:17:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:17:49] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:17:49] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-29 05:17:49] [INFO ] Computed and/alt/rep : 226/399/226 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 05:17:50] [INFO ] Added : 203 causal constraints over 43 iterations in 1489 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 247 /247 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-29 05:17:50] [INFO ] Invariant cache hit.
[2024-05-29 05:17:50] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-29 05:17:50] [INFO ] Invariant cache hit.
[2024-05-29 05:17:50] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-29 05:17:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:17:52] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 4 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 4 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:17:53] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:17:54] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:17:55] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:17:55] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:17:55] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:17:55] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:17:55] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:17:55] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:17:55] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:56] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:17:56] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 05:17:56] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:17:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:17:56] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:17:56] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:17:56] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:17:57] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:17:57] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:17:57] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-29 05:17:57] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:17:57] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:17:58] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:17:58] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-29 05:17:58] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 227/474 variables, 247/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:01] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:18:01] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:18:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:18:01] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:18:01] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:18:02] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 6/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:03] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:18:03] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:18:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:18:03] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:18:03] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:18:03] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:18:04] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-29 05:18:04] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:18:04] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:18:04] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 10/363 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:07] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:18:08] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-29 05:18:08] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:09] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:18:10] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:18:10] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:18:10] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:18:10] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:18:10] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:18:10] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 7/374 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:13] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:18:14] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:18:14] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:18:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:18:14] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-05-29 05:18:14] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:18:15] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-29 05:18:15] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:18:15] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:19] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:18:19] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:18:19] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/474 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/474 variables, and 387 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 95/140 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:18:22] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:18:23] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:18:23] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:18:23] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:18:23] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:18:23] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 17/157 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:25] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:18:25] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:18:25] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 0 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 19/191 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:27] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:18:27] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:18:27] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:18:28] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:18:28] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 227/474 variables, 247/443 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 226/669 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:32] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:18:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:18:33] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:18:33] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-29 05:18:33] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 05:18:34] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:18:34] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:18:34] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:18:34] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:18:35] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:18:35] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:18:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 12/681 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:18:45] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-29 05:18:45] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-29 05:18:45] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-29 05:18:45] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:18:45] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:18:46] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:18:46] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:18:46] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:18:46] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:18:46] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:18:46] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:18:47] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:18:47] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:18:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 14/695 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/474 variables, and 695 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 177/177 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Finished structural reductions in LTL mode , in 1 iterations and 60293 ms. Remains : 247/247 places, 227/227 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 262 steps (0 resets) in 5 ms. (43 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-29 05:18:51] [INFO ] Invariant cache hit.
[2024-05-29 05:18:51] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-29 05:18:51] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-29 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:18:52] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-29 05:18:52] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-29 05:18:52] [INFO ] Computed and/alt/rep : 226/399/226 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 05:18:54] [INFO ] Added : 225 causal constraints over 45 iterations in 2005 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-29 05:18:54] [INFO ] Invariant cache hit.
[2024-05-29 05:18:54] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:18:54] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-29 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:18:54] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:18:54] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-29 05:18:54] [INFO ] Computed and/alt/rep : 226/399/226 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 05:18:56] [INFO ] Added : 203 causal constraints over 43 iterations in 1424 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1211 reset in 167 ms.
Product exploration explored 100000 steps with 1177 reset in 178 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 227/227 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 247 transition count 227
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 29 place count 247 transition count 228
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 247 transition count 228
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 118 place count 247 transition count 228
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 148 place count 217 transition count 198
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 178 place count 217 transition count 198
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 178 rules in 69 ms. Remains 217 /247 variables (removed 30) and now considering 198/227 (removed 29) transitions.
[2024-05-29 05:18:57] [INFO ] Redundant transitions in 5 ms returned []
Running 197 sub problems to find dead transitions.
// Phase 1: matrix 198 rows 217 cols
[2024-05-29 05:18:57] [INFO ] Computed 45 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-29 05:18:58] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 20/65 constraints. Problems are: Problem set: 66 solved, 131 unsolved
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-29 05:18:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-05-29 05:19:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD174 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 20/85 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/85 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 198/415 variables, 217/302 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:01] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:19:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:19:01] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:19:01] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 4/306 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:03] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:19:03] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:19:03] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 3/309 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/309 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:19:04] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:19:04] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/415 variables, 3/312 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 1/313 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:06] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:19:06] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:19:06] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 3/316 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/316 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:08] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:19:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:19:08] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/415 variables, 3/319 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/319 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:09] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/415 variables, 1/320 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:10] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:19:10] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:19:10] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 3/323 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 0/323 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 18 (OVERLAPS) 0/415 variables, 0/323 constraints. Problems are: Problem set: 89 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 323 constraints, problems are : Problem set: 89 solved, 108 unsolved in 15572 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 89 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 89/217 variables, 45/45 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 61/106 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/106 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 198/415 variables, 217/323 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 108/431 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:15] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 1/432 constraints. Problems are: Problem set: 89 solved, 108 unsolved
[2024-05-29 05:19:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 1/433 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/433 constraints. Problems are: Problem set: 89 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/433 constraints. Problems are: Problem set: 89 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 433 constraints, problems are : Problem set: 89 solved, 108 unsolved in 20311 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 108/197 constraints, Known Traps: 63/63 constraints]
After SMT, in 35938ms problems are : Problem set: 89 solved, 108 unsolved
Search for dead transitions found 89 dead transitions in 35942ms
Found 89 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 89 transitions
Dead transitions reduction (with SMT) removed 89 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 217/247 places, 109/227 transitions.
Graph (complete) has 333 edges and 217 vertex of which 129 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.5 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 129 /217 variables (removed 88) and now considering 109/109 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/247 places, 109/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36051 ms. Remains : 129/247 places, 109/227 transitions.
Built C files in :
/tmp/ltsmin9089335081090834956
[2024-05-29 05:19:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9089335081090834956
Running compilation step : cd /tmp/ltsmin9089335081090834956;'/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'
Compilation finished in 403 ms.
Running link step : cd /tmp/ltsmin9089335081090834956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9089335081090834956;'/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' '--hoa' '/tmp/stateBased9583352203565767022.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 227/227 transitions.
Applied a total of 0 rules in 7 ms. Remains 247 /247 variables (removed 0) and now considering 227/227 (removed 0) transitions.
// Phase 1: matrix 227 rows 247 cols
[2024-05-29 05:19:48] [INFO ] Computed 45 invariants in 4 ms
[2024-05-29 05:19:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 05:19:48] [INFO ] Invariant cache hit.
[2024-05-29 05:19:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-29 05:19:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:19:50] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:19:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:19:52] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:19:54] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:19:55] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:19:55] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2024-05-29 05:19:55] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 227/474 variables, 247/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:19:58] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:19:58] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:19:59] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:19:59] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:19:59] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:19:59] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 6/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:20:00] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:20:00] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:20:00] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:20:00] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:20:01] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:20:01] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:20:01] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:20:01] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:20:01] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:20:01] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 10/363 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:20:04] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:20:05] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:20:05] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-05-29 05:20:05] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:20:07] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:20:07] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:20:07] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:20:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:20:07] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:20:07] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:20:08] [INFO ] Deduced a trap composed of 28 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 7/374 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:20:10] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:20:11] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:20:11] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-29 05:20:11] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:20:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:20:12] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:20:12] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:20:12] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:20:12] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:20:12] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:20:16] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:20:16] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:20:16] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/474 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-29 05:20:18] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:20:18] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
SMT process timed out in 30042ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 30045ms
Finished structural reductions in LTL mode , in 1 iterations and 30287 ms. Remains : 247/247 places, 227/227 transitions.
Built C files in :
/tmp/ltsmin8891177467703355653
[2024-05-29 05:20:18] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8891177467703355653
Running compilation step : cd /tmp/ltsmin8891177467703355653;'/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'
Compilation finished in 381 ms.
Running link step : cd /tmp/ltsmin8891177467703355653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8891177467703355653;'/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' '--hoa' '/tmp/stateBased6006927747703260215.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:20:33] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:20:33] [INFO ] Flatten gal took : 8 ms
[2024-05-29 05:20:33] [INFO ] Time to serialize gal into /tmp/LTL5490362420855348376.gal : 2 ms
[2024-05-29 05:20:33] [INFO ] Time to serialize properties into /tmp/LTL15691307624868776653.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/LTL5490362420855348376.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10708931623778147798.hoa' '-atoms' '/tmp/LTL15691307624868776653.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...319
Loading property file /tmp/LTL15691307624868776653.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10708931623778147798.hoa
Detected timeout of ITS tools.
[2024-05-29 05:20:48] [INFO ] Flatten gal took : 8 ms
[2024-05-29 05:20:48] [INFO ] Flatten gal took : 8 ms
[2024-05-29 05:20:48] [INFO ] Time to serialize gal into /tmp/LTL17178901576722329176.gal : 1 ms
[2024-05-29 05:20:48] [INFO ] Time to serialize properties into /tmp/LTL1267641534753953288.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/LTL17178901576722329176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1267641534753953288.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(F((X(X(F("((p117==1)||(p12==1))"))))&&("((p94==1)||(p12==1))")))))
Formula 0 simplified : XG(!"((p94==1)||(p12==1))" | XXG!"((p117==1)||(p12==1))")
Detected timeout of ITS tools.
[2024-05-29 05:21:03] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:21:03] [INFO ] Applying decomposition
[2024-05-29 05:21:03] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12581309662536709519.txt' '-o' '/tmp/graph12581309662536709519.bin' '-w' '/tmp/graph12581309662536709519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12581309662536709519.bin' '-l' '-1' '-v' '-w' '/tmp/graph12581309662536709519.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:21:03] [INFO ] Decomposing Gal with order
[2024-05-29 05:21:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:21:03] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-29 05:21:03] [INFO ] Flatten gal took : 18 ms
[2024-05-29 05:21:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 05:21:03] [INFO ] Time to serialize gal into /tmp/LTL1322104732950643790.gal : 4 ms
[2024-05-29 05:21:03] [INFO ] Time to serialize properties into /tmp/LTL14467041627139307779.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/LTL1322104732950643790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14467041627139307779.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...255
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("((i4.u43.p117==1)||(i1.i0.i0.u5.p12==1))"))))&&("((i5.u35.p94==1)||(i1.i0.i0.u5.p12==1))")))))
Formula 0 simplified : XG(!"((i5.u35.p94==1)||(i1.i0.i0.u5.p12==1))" | XXG!"((i4.u43.p117==1)||(i1.i0.i0.u5.p12==1))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004B-LTLFireability-02 finished in 274184 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' '!((p0 U ((!p0||F(G(p1))) U X(p2))))'
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 246 transition count 226
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 226
Applied a total of 4 rules in 4 ms. Remains 246 /248 variables (removed 2) and now considering 226/228 (removed 2) transitions.
// Phase 1: matrix 226 rows 246 cols
[2024-05-29 05:21:18] [INFO ] Computed 45 invariants in 4 ms
[2024-05-29 05:21:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 05:21:19] [INFO ] Invariant cache hit.
[2024-05-29 05:21:19] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-29 05:21:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 5 ms to minimize.
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:21:23] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:21:26] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/472 variables, 246/339 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:28] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:21:29] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:21:29] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:21:29] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:21:29] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:21:29] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:21:29] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:21:29] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:21:29] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:21:30] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:21:30] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:31] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:21:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:21:32] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:32] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:21:33] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:21:34] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:21:34] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:21:34] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:21:34] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:36] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:21:36] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:21:36] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:38] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:21:39] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:42] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:21:43] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:21:44] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:21:44] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:21:44] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:21:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:21:44] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:21:44] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:21:44] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:45] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:21:45] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:21:45] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-29 05:21:45] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:47] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:21:47] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:21:47] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:21:47] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:21:48] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:21:48] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 404 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:21:50] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:21:50] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 2 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:21:51] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:52] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:53] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:21:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:21:53] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:21:53] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:21:54] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:21:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:54] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:21:55] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:21:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:21:55] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:21:55] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:56] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:21:56] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:21:57] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:21:59] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-29 05:22:00] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:22:00] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:04] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:07] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:22:08] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:11] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:15] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:22:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:22:15] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:22:15] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:22:16] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/472 variables, and 215 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/225 constraints, Known Traps: 170/170 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in LTL mode, iteration 1 : 246/248 places, 226/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60293 ms. Remains : 246/248 places, 226/228 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-03
Product exploration explored 100000 steps with 3093 reset in 160 ms.
Product exploration explored 100000 steps with 3062 reset in 167 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
RANDOM walk for 1310 steps (0 resets) in 12 ms. (100 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 9 factoid took 300 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
[2024-05-29 05:22:20] [INFO ] Invariant cache hit.
[2024-05-29 05:22:20] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-29 05:22:21] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-29 05:22:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:22:21] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:22:21] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-29 05:22:21] [INFO ] Computed and/alt/rep : 225/398/225 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 05:22:22] [INFO ] Added : 209 causal constraints over 43 iterations in 1460 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 226/226 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-29 05:22:22] [INFO ] Invariant cache hit.
[2024-05-29 05:22:22] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 05:22:22] [INFO ] Invariant cache hit.
[2024-05-29 05:22:23] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-29 05:22:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-29 05:22:25] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:22:26] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:22:26] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:22:26] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:26] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:22:26] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:22:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:22:26] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:22:26] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:22:26] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:22:27] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-05-29 05:22:29] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/472 variables, 246/339 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:32] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:22:33] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:22:33] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:22:33] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:22:33] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:22:33] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:22:33] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:22:33] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:22:33] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:22:34] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:22:34] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:35] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:22:35] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:22:36] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:36] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:22:37] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:22:38] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:22:38] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:40] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:22:40] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:22:40] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:22:42] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:44] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:22:46] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:22:47] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:22:48] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:22:48] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:22:48] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:22:48] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:22:48] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:22:48] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:22:48] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:49] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:22:49] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:22:49] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:22:49] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:51] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:22:51] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:22:51] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:22:51] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:22:52] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:22:52] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 404 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:22:54] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:22:54] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:22:54] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2024-05-29 05:22:54] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:22:55] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:56] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:22:57] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:22:57] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:22:57] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:22:57] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:22:58] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:22:58] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:22:59] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:22:59] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:22:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:22:59] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:23:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:23:00] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:23:00] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:23:01] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:23:03] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:23:03] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:23:03] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:23:08] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:23:11] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-29 05:23:11] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:23:14] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:23:18] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:23:18] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:23:18] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:23:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:23:19] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:23:22] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:23:22] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:23:22] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 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 246/472 variables, and 218 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/225 constraints, Known Traps: 173/173 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in LTL mode , in 1 iterations and 60287 ms. Remains : 246/246 places, 226/226 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
RANDOM walk for 1370 steps (0 resets) in 33 ms. (40 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 9 factoid took 264 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
[2024-05-29 05:23:24] [INFO ] Invariant cache hit.
[2024-05-29 05:23:24] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:23:24] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-29 05:23:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:23:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:23:24] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-29 05:23:24] [INFO ] Computed and/alt/rep : 225/398/225 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-29 05:23:26] [INFO ] Added : 209 causal constraints over 43 iterations in 1417 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3109 reset in 144 ms.
Product exploration explored 100000 steps with 3099 reset in 151 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 226/226 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 246 transition count 226
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 27 place count 246 transition count 227
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 36 place count 246 transition count 227
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 118 place count 246 transition count 227
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 146 place count 218 transition count 199
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 174 place count 218 transition count 199
Deduced a syphon composed of 90 places in 0 ms
Applied a total of 174 rules in 29 ms. Remains 218 /246 variables (removed 28) and now considering 199/226 (removed 27) transitions.
[2024-05-29 05:23:27] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
// Phase 1: matrix 199 rows 218 cols
[2024-05-29 05:23:27] [INFO ] Computed 45 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-29 05:23:28] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 20/65 constraints. Problems are: Problem set: 68 solved, 130 unsolved
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD154 is UNSAT
[2024-05-29 05:23:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD177 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 13/78 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/78 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 199/417 variables, 218/296 constraints. Problems are: Problem set: 91 solved, 107 unsolved
[2024-05-29 05:23:30] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:23:30] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:23:31] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:23:31] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:23:31] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 5/301 constraints. Problems are: Problem set: 91 solved, 107 unsolved
[2024-05-29 05:23:32] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 1/302 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/302 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/302 constraints. Problems are: Problem set: 91 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 302 constraints, problems are : Problem set: 91 solved, 107 unsolved in 7489 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 91 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 91/218 variables, 45/45 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 39/84 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/84 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 199/417 variables, 218/302 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 107/409 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/409 constraints. Problems are: Problem set: 91 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/417 variables, 0/409 constraints. Problems are: Problem set: 91 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 409 constraints, problems are : Problem set: 91 solved, 107 unsolved in 9158 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 107/198 constraints, Known Traps: 39/39 constraints]
After SMT, in 16674ms problems are : Problem set: 91 solved, 107 unsolved
Search for dead transitions found 91 dead transitions in 16677ms
Found 91 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 91 transitions
Dead transitions reduction (with SMT) removed 91 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 218/246 places, 108/226 transitions.
Graph (complete) has 333 edges and 218 vertex of which 128 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 128 /218 variables (removed 90) and now considering 108/108 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/246 places, 108/226 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16726 ms. Remains : 128/246 places, 108/226 transitions.
Built C files in :
/tmp/ltsmin16905377842048093327
[2024-05-29 05:23:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16905377842048093327
Running compilation step : cd /tmp/ltsmin16905377842048093327;'/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'
Compilation finished in 386 ms.
Running link step : cd /tmp/ltsmin16905377842048093327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16905377842048093327;'/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' '--hoa' '/tmp/stateBased7172955185295775502.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 226/226 transitions.
Applied a total of 0 rules in 5 ms. Remains 246 /246 variables (removed 0) and now considering 226/226 (removed 0) transitions.
// Phase 1: matrix 226 rows 246 cols
[2024-05-29 05:23:58] [INFO ] Computed 45 invariants in 3 ms
[2024-05-29 05:23:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-29 05:23:58] [INFO ] Invariant cache hit.
[2024-05-29 05:23:59] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-29 05:23:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:24:01] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:24:02] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:24:03] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:24:05] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 05:24:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:24:05] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:24:05] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:24:05] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:24:05] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:24:05] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:24:05] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:06] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/472 variables, 246/339 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:08] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:24:09] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:24:09] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-05-29 05:24:09] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:24:09] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:24:09] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:24:09] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:24:09] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:24:09] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:24:10] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:24:10] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:11] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:24:11] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:24:12] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:12] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:24:13] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:24:13] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:24:13] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:24:13] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:24:13] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:24:13] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:13] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:24:13] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:24:14] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:24:14] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:14] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:24:14] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:24:14] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:24:14] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:16] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:24:16] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:24:16] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:18] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:24:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:20] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:23] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:24:23] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:23] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:24:23] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:24:23] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:24:23] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:24:23] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:24:23] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:24:24] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:24:24] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:24:24] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:24:24] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:24:24] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:24:24] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:24:24] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:24:24] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:24:25] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:24:25] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:24:25] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:24:25] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:25] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:24:25] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:24:26] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:24:26] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:27] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-29 05:24:27] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:24:27] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:24:28] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:28] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:24:28] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 404 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:30] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:24:30] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:24:30] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:24:30] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:24:31] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:32] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:33] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:24:33] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:24:33] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:24:33] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:24:34] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:24:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:34] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:24:35] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:24:35] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:24:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:24:35] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:24:36] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:24:37] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:39] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:24:39] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 3 ms to minimize.
[2024-05-29 05:24:40] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:44] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:47] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:24:47] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:51] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:54] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:24:54] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:24:54] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:24:55] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:24:55] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:24:58] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/472 variables, and 216 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/225 constraints, Known Traps: 171/171 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in LTL mode , in 1 iterations and 60307 ms. Remains : 246/246 places, 226/226 transitions.
Built C files in :
/tmp/ltsmin9465002075250422181
[2024-05-29 05:24:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9465002075250422181
Running compilation step : cd /tmp/ltsmin9465002075250422181;'/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'
Compilation finished in 409 ms.
Running link step : cd /tmp/ltsmin9465002075250422181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9465002075250422181;'/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' '--hoa' '/tmp/stateBased2686179901030353618.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:25:14] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:25:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:25:14] [INFO ] Time to serialize gal into /tmp/LTL3121192472811442360.gal : 1 ms
[2024-05-29 05:25:14] [INFO ] Time to serialize properties into /tmp/LTL4907416355222585637.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/LTL3121192472811442360.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13106044513906913806.hoa' '-atoms' '/tmp/LTL4907416355222585637.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/LTL4907416355222585637.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13106044513906913806.hoa
Detected timeout of ITS tools.
[2024-05-29 05:25:29] [INFO ] Flatten gal took : 8 ms
[2024-05-29 05:25:29] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:25:29] [INFO ] Time to serialize gal into /tmp/LTL11890206389668171165.gal : 2 ms
[2024-05-29 05:25:29] [INFO ] Time to serialize properties into /tmp/LTL8132085909638059013.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/LTL11890206389668171165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8132085909638059013.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 : !((("(p191!=1)")U((("(p191==1)")||(F(G("(p93==1)"))))U(X("((p262==1)||(p93==1))")))))
Formula 0 simplified : !"(p191!=1)" R ((!"(p191==1)" & GF!"(p93==1)") R X!"((p262==1)||(p93==1))")
Detected timeout of ITS tools.
[2024-05-29 05:25:44] [INFO ] Flatten gal took : 13 ms
[2024-05-29 05:25:44] [INFO ] Applying decomposition
[2024-05-29 05:25:44] [INFO ] Flatten gal took : 7 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/graph12635672411374485975.txt' '-o' '/tmp/graph12635672411374485975.bin' '-w' '/tmp/graph12635672411374485975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12635672411374485975.bin' '-l' '-1' '-v' '-w' '/tmp/graph12635672411374485975.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:25:44] [INFO ] Decomposing Gal with order
[2024-05-29 05:25:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:25:44] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-29 05:25:44] [INFO ] Flatten gal took : 13 ms
[2024-05-29 05:25:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 05:25:44] [INFO ] Time to serialize gal into /tmp/LTL2842445556017058634.gal : 4 ms
[2024-05-29 05:25:44] [INFO ] Time to serialize properties into /tmp/LTL14872526126650711252.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/LTL2842445556017058634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14872526126650711252.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...255
Read 1 LTL properties
Checking formula 0 : !((("(i8.u68.p191!=1)")U((("(i8.u68.p191==1)")||(F(G("(i4.i1.i0.u34.p93==1)"))))U(X("((i11.u91.p262==1)||(i4.i1.i0.u34.p93==1))")))))
Formula 0 simplified : !"(i8.u68.p191!=1)" R ((!"(i8.u68.p191==1)" & GF!"(i4.i1.i0.u34.p93==1)") R X!"((i11.u91.p262==1)||(i4.i1.i0.u34.p93==1))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004B-LTLFireability-03 finished in 280583 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)))'
Support contains 1 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 247 transition count 197
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 217 transition count 197
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 60 place count 217 transition count 177
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 100 place count 197 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 195 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 195 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 195 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 194 transition count 174
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 242 place count 126 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 124 transition count 104
Applied a total of 244 rules in 21 ms. Remains 124 /248 variables (removed 124) and now considering 104/228 (removed 124) transitions.
// Phase 1: matrix 104 rows 124 cols
[2024-05-29 05:25:59] [INFO ] Computed 45 invariants in 0 ms
[2024-05-29 05:25:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 05:25:59] [INFO ] Invariant cache hit.
[2024-05-29 05:25:59] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-29 05:25:59] [INFO ] Redundant transitions in 0 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-29 05:25:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 05:26:00] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:26:00] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:26:00] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:26:00] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/173 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 05:26:00] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 05:26:01] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:26:01] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 176 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2710 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 102/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 278 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3266 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
After SMT, in 5985ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 5986ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/248 places, 104/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6160 ms. Remains : 124/248 places, 104/228 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-04
Stuttering criterion allowed to conclude after 308 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-004B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004B-LTLFireability-04 finished in 6234 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||X(p0)))&&X(p1)))'
Support contains 2 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 246 transition count 226
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 226
Applied a total of 4 rules in 7 ms. Remains 246 /248 variables (removed 2) and now considering 226/228 (removed 2) transitions.
// Phase 1: matrix 226 rows 246 cols
[2024-05-29 05:26:05] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 05:26:05] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 05:26:05] [INFO ] Invariant cache hit.
[2024-05-29 05:26:05] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-29 05:26:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:07] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:26:08] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:26:09] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:09] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:26:09] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:26:09] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:26:09] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:26:09] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 05:26:09] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:26:09] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-29 05:26:09] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:26:10] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:11] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:26:11] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 05:26:12] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:26:12] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:26:12] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:26:12] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:26:12] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:26:12] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:26:12] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-29 05:26:12] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/472 variables, 246/339 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:15] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:26:16] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:26:16] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:26:16] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:26:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:26:16] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:26:16] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:26:16] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:26:16] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:26:17] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:26:17] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:18] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:26:18] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:26:19] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:19] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:26:20] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:26:20] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:26:20] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:26:20] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:26:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:26:20] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:26:20] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:26:20] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:26:20] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:26:21] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:26:21] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:26:21] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:26:21] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:26:21] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:23] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:26:23] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:26:23] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:25] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:26:26] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:27] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:29] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:26:30] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:26:31] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:26:31] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:26:31] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:26:31] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:26:31] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:26:31] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:26:31] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:26:31] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:32] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:26:32] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:26:32] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:26:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:34] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:26:34] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:26:34] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:26:34] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:26:35] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:26:35] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.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 1.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 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.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 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 404 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:37] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:26:37] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:26:37] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:26:37] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:26:37] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:26:37] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-29 05:26:37] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:26:38] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:40] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:26:40] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:26:40] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:26:40] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:26:40] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:26:41] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:41] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:26:42] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:26:42] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:26:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:26:42] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:26:43] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:26:44] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:26:44] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:26:44] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:26:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:26:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:26:44] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:26:44] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:26:44] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:26:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:26:46] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:26:46] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:48] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:26:48] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:26:48] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:52] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:26:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:26:56] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:00] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:03] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:27:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:27:03] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:27:03] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:27:04] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/472 variables, and 215 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/225 constraints, Known Traps: 170/170 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 246/248 places, 226/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60294 ms. Remains : 246/248 places, 226/228 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 490 steps with 2 reset in 3 ms.
FORMULA ShieldPPPs-PT-004B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004B-LTLFireability-06 finished in 60567 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(F(p0))&&F(p1))))'
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 246 transition count 226
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 226
Applied a total of 4 rules in 4 ms. Remains 246 /248 variables (removed 2) and now considering 226/228 (removed 2) transitions.
[2024-05-29 05:27:06] [INFO ] Invariant cache hit.
[2024-05-29 05:27:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 05:27:06] [INFO ] Invariant cache hit.
[2024-05-29 05:27:06] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-29 05:27:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:27:08] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:27:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:27:10] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:11] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:27:11] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:27:11] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:12] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:27:12] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 05:27:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:27:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:12] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:27:13] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:27:13] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:27:13] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:27:13] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:27:13] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/472 variables, 246/339 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:16] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:27:16] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:16] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:27:16] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:27:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:27:16] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:27:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:27:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:27:17] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:27:17] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:27:17] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:18] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:27:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:27:19] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:19] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:27:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:27:20] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:27:20] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:27:20] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:27:21] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:24] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:27:24] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:27:24] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:26] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:27:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:27] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:30] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:27:30] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:27:31] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:27:32] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:27:32] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:27:32] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:27:32] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:27:32] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:27:32] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:32] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:27:33] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:27:33] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:27:33] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:35] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:27:35] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:27:35] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:27:35] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:27:36] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:27:36] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 404 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:37] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:27:38] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:27:39] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:27:39] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:27:39] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:39] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:27:39] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:27:39] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:40] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:41] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:27:41] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
[2024-05-29 05:27:41] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:27:41] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:27:41] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:27:41] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:42] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:27:42] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:27:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:27:42] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:27:42] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:44] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:27:44] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
[2024-05-29 05:27:44] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:27:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:27:44] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:27:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:27:44] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:27:44] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:27:44] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:27:45] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:27:45] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:27:45] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:27:45] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:47] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-29 05:27:47] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:27:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:51] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:54] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:27:55] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:27:58] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:28:02] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:28:02] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:28:02] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:28:03] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:06] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/472 variables, and 216 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/225 constraints, Known Traps: 171/171 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60039ms
Starting structural reductions in LTL mode, iteration 1 : 246/248 places, 226/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60252 ms. Remains : 246/248 places, 226/228 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-08
Product exploration explored 100000 steps with 420 reset in 190 ms.
Product exploration explored 100000 steps with 416 reset in 209 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 876 steps (0 resets) in 7 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 05:28:07] [INFO ] Invariant cache hit.
[2024-05-29 05:28:07] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:28:07] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-29 05:28:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:28:07] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:28:08] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-05-29 05:28:08] [INFO ] Computed and/alt/rep : 225/398/225 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 05:28:09] [INFO ] Added : 223 causal constraints over 48 iterations in 1474 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 246 /246 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-29 05:28:09] [INFO ] Invariant cache hit.
[2024-05-29 05:28:09] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 05:28:09] [INFO ] Invariant cache hit.
[2024-05-29 05:28:09] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-29 05:28:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:11] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:28:11] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:28:11] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:28:12] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:28:13] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-29 05:28:14] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:28:14] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:28:14] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:28:14] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:28:14] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:28:14] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:28:14] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:15] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:28:15] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-29 05:28:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:28:16] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:28:16] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:28:16] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:28:16] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:28:16] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:28:16] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:28:16] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/472 variables, 246/339 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:19] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:28:19] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:28:19] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:28:19] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:28:20] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:28:20] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:28:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:28:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:28:20] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-29 05:28:20] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:28:21] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:28:22] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:28:22] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:23] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:28:23] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:28:23] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:28:24] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:27] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:28:27] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:28:27] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:29] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:28:29] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:30] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:33] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:28:33] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:28:34] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:28:35] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:28:35] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:28:35] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:28:35] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:28:35] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:28:35] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:28:35] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:35] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:28:36] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:28:36] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:28:36] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:37] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:28:38] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:28:38] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:28:38] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:28:38] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:28:38] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 404 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:41] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:28:41] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:28:41] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:28:41] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:28:41] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:28:41] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:28:41] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:28:41] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:28:41] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:28:42] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:43] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:44] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:28:44] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:28:44] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:28:44] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:28:44] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:28:44] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:45] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:28:45] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:28:45] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:28:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:28:46] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:47] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:28:47] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
[2024-05-29 05:28:47] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:28:47] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:28:47] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:28:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:28:47] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:28:47] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:28:47] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:28:48] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:28:48] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:28:48] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:28:48] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:50] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 05:28:50] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:28:50] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:54] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:28:57] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:28:58] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:29:01] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:29:05] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:29:05] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:29:05] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:29:05] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:29:06] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:29:09] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:29:09] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/472 variables, and 217 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/225 constraints, Known Traps: 172/172 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Finished structural reductions in LTL mode , in 1 iterations and 60302 ms. Remains : 246/246 places, 226/226 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 892 steps (0 resets) in 9 ms. (89 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 05:29:10] [INFO ] Invariant cache hit.
[2024-05-29 05:29:10] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-29 05:29:10] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-29 05:29:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:29:10] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 05:29:11] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-29 05:29:11] [INFO ] Computed and/alt/rep : 225/398/225 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 05:29:12] [INFO ] Added : 223 causal constraints over 48 iterations in 1467 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 423 reset in 197 ms.
Product exploration explored 100000 steps with 413 reset in 213 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 226/226 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 246 transition count 226
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 27 place count 246 transition count 227
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 37 place count 246 transition count 227
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 118 place count 246 transition count 227
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 148 place count 216 transition count 197
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 178 place count 216 transition count 197
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 178 rules in 21 ms. Remains 216 /246 variables (removed 30) and now considering 197/226 (removed 29) transitions.
[2024-05-29 05:29:13] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
// Phase 1: matrix 197 rows 216 cols
[2024-05-29 05:29:13] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 05:29:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 05:29:14] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-29 05:29:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-29 05:29:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-29 05:29:14] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-29 05:29:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-29 05:29:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-29 05:29:14] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 20/65 constraints. Problems are: Problem set: 64 solved, 132 unsolved
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-05-29 05:29:15] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-29 05:29:16] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:29:16] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:29:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:29:16] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-29 05:29:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD128 is UNSAT
[2024-05-29 05:29:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD151 is UNSAT
[2024-05-29 05:29:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD173 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 18/83 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/83 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 197/413 variables, 216/299 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-05-29 05:29:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:29:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 2/301 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-05-29 05:29:18] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:29:19] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 2/303 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/303 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/303 constraints. Problems are: Problem set: 89 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 303 constraints, problems are : Problem set: 89 solved, 107 unsolved in 7589 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 89 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 89/216 variables, 45/45 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 42/87 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/87 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 197/413 variables, 216/303 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 107/410 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/410 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/410 constraints. Problems are: Problem set: 89 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 410 constraints, problems are : Problem set: 89 solved, 107 unsolved in 6194 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 107/196 constraints, Known Traps: 42/42 constraints]
After SMT, in 13813ms problems are : Problem set: 89 solved, 107 unsolved
Search for dead transitions found 89 dead transitions in 13816ms
Found 89 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 89 transitions
Dead transitions reduction (with SMT) removed 89 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 216/246 places, 108/226 transitions.
Graph (complete) has 335 edges and 216 vertex of which 128 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.1 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 128 /216 variables (removed 88) and now considering 108/108 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/246 places, 108/226 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13863 ms. Remains : 128/246 places, 108/226 transitions.
Built C files in :
/tmp/ltsmin8747177214292870117
[2024-05-29 05:29:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8747177214292870117
Running compilation step : cd /tmp/ltsmin8747177214292870117;'/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'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin8747177214292870117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8747177214292870117;'/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' '--hoa' '/tmp/stateBased3482695166146472094.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 246 /246 variables (removed 0) and now considering 226/226 (removed 0) transitions.
// Phase 1: matrix 226 rows 246 cols
[2024-05-29 05:29:42] [INFO ] Computed 45 invariants in 3 ms
[2024-05-29 05:29:42] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 05:29:42] [INFO ] Invariant cache hit.
[2024-05-29 05:29:42] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-29 05:29:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:29:44] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:29:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:29:44] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 05:29:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:29:45] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-29 05:29:46] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:29:46] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:29:46] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:29:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:29:46] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:29:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:29:46] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:29:46] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:29:47] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:29:49] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/472 variables, 246/339 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:29:52] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:29:53] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:29:53] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:29:53] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:29:53] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:29:53] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:29:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:29:53] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:29:53] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:29:54] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:29:54] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:29:55] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:29:55] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:29:56] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:29:56] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:29:57] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:29:57] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:29:57] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:29:57] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:29:57] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:29:57] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:29:57] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:29:57] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:29:57] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:29:58] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:29:58] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-05-29 05:29:58] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:29:58] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:29:58] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:30:00] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:30:00] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:30:00] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:30:02] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:30:03] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:30:04] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:30:07] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:30:07] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:30:07] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:30:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:30:07] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:30:07] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:30:07] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:30:07] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:30:08] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:30:08] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:30:08] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:30:08] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:30:08] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:30:08] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:30:08] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:30:08] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:30:08] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:30:09] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:30:09] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:30:09] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:30:09] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:30:09] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:30:10] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:30:10] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:30:11] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:30:11] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:30:11] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 5 ms to minimize.
[2024-05-29 05:30:11] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 402 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:30:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:30:14] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:30:14] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:30:14] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/472 variables, 246/406 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 225/631 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:30:19] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 05:30:19] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:30:19] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:30:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:30:20] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:30:20] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:30:21] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:30:21] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:30:21] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-29 05:30:21] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:30:22] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:30:22] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:30:22] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:30:22] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:30:23] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 15/646 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:30:30] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-29 05:30:31] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:30:31] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:30:31] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:30:32] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:30:32] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:30:32] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:30:32] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:30:33] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:30:35] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 10/656 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 656 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 140/140 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Finished structural reductions in LTL mode , in 1 iterations and 60318 ms. Remains : 246/246 places, 226/226 transitions.
Built C files in :
/tmp/ltsmin4501459226107504500
[2024-05-29 05:30:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4501459226107504500
Running compilation step : cd /tmp/ltsmin4501459226107504500;'/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'
Compilation finished in 389 ms.
Running link step : cd /tmp/ltsmin4501459226107504500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4501459226107504500;'/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' '--hoa' '/tmp/stateBased12080810754002338770.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:30:57] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:30:57] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:30:57] [INFO ] Time to serialize gal into /tmp/LTL17575411640659119829.gal : 2 ms
[2024-05-29 05:30:57] [INFO ] Time to serialize properties into /tmp/LTL14223039952188032333.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/LTL17575411640659119829.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17467149362020171944.hoa' '-atoms' '/tmp/LTL14223039952188032333.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/LTL14223039952188032333.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17467149362020171944.hoa
Detected timeout of ITS tools.
[2024-05-29 05:31:12] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:31:12] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:31:12] [INFO ] Time to serialize gal into /tmp/LTL14828103250742790312.gal : 1 ms
[2024-05-29 05:31:12] [INFO ] Time to serialize properties into /tmp/LTL5626052679700504688.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/LTL14828103250742790312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5626052679700504688.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((X(F("(((p41==1)&&(p92==1))||(p19==1))")))&&(F("((p41!=1)||(p92!=1))")))))
Formula 0 simplified : X(XG!"(((p41==1)&&(p92==1))||(p19==1))" | G!"((p41!=1)||(p92!=1))")
Detected timeout of ITS tools.
[2024-05-29 05:31:27] [INFO ] Flatten gal took : 12 ms
[2024-05-29 05:31:27] [INFO ] Applying decomposition
[2024-05-29 05:31:27] [INFO ] Flatten gal took : 6 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/graph17775027037789248181.txt' '-o' '/tmp/graph17775027037789248181.bin' '-w' '/tmp/graph17775027037789248181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17775027037789248181.bin' '-l' '-1' '-v' '-w' '/tmp/graph17775027037789248181.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:31:27] [INFO ] Decomposing Gal with order
[2024-05-29 05:31:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:31:27] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-29 05:31:27] [INFO ] Flatten gal took : 24 ms
[2024-05-29 05:31:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 05:31:27] [INFO ] Time to serialize gal into /tmp/LTL15110481178369983632.gal : 3 ms
[2024-05-29 05:31:27] [INFO ] Time to serialize properties into /tmp/LTL1258181643366137281.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/LTL15110481178369983632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1258181643366137281.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...255
Read 1 LTL properties
Checking formula 0 : !((X((X(F("(((i3.u17.p41==1)&&(i6.u33.p92==1))||(i1.i1.i0.u7.p19==1))")))&&(F("((i3.u17.p41!=1)||(i6.u33.p92!=1))")))))
Formula 0 simplified : X(XG!"(((i3.u17.p41==1)&&(i6.u33.p92==1))||(i1.i1.i0.u7.p19==1))" | G!"((i3.u17.p41!=1)||(i6.u33.p92!=1))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004B-LTLFireability-08 finished in 276663 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(G(p0))&&F(p1))))'
Support contains 4 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 247 transition count 197
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 217 transition count 197
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 60 place count 217 transition count 177
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 100 place count 197 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 195 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 195 transition count 175
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 236 place count 129 transition count 109
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 127 transition count 107
Applied a total of 238 rules in 19 ms. Remains 127 /248 variables (removed 121) and now considering 107/228 (removed 121) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 05:31:43] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 05:31:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 05:31:43] [INFO ] Invariant cache hit.
[2024-05-29 05:31:43] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-29 05:31:43] [INFO ] Redundant transitions in 0 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-29 05:31:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:31:43] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:31:44] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:31:44] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:31:44] [INFO ] Deduced a trap composed of 59 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/176 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/234 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 176 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2705 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/176 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 104/280 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 280 constraints, problems are : Problem set: 0 solved, 104 unsolved in 6339 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 4/4 constraints]
After SMT, in 9055ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 9057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/248 places, 107/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9232 ms. Remains : 127/248 places, 107/228 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-09
Stuttering criterion allowed to conclude after 541 steps with 1 reset in 2 ms.
FORMULA ShieldPPPs-PT-004B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004B-LTLFireability-09 finished in 9385 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((G(!p0)||(!p0&&F(G(p1)))))))'
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 247 transition count 199
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 219 transition count 199
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 56 place count 219 transition count 179
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 96 place count 199 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 197 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 197 transition count 177
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 234 place count 130 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 128 transition count 108
Applied a total of 236 rules in 21 ms. Remains 128 /248 variables (removed 120) and now considering 108/228 (removed 120) transitions.
// Phase 1: matrix 108 rows 128 cols
[2024-05-29 05:31:52] [INFO ] Computed 45 invariants in 0 ms
[2024-05-29 05:31:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 05:31:52] [INFO ] Invariant cache hit.
[2024-05-29 05:31:52] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-29 05:31:52] [INFO ] Redundant transitions in 0 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-29 05:31:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:31:53] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:31:53] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:31:53] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:31:53] [INFO ] Deduced a trap composed of 60 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 108/236 variables, 128/177 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:31:54] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 178 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3436 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 108/236 variables, 128/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 104/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 282 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4636 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 5/5 constraints]
After SMT, in 8083ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 8087ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/248 places, 108/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8285 ms. Remains : 128/248 places, 108/228 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-10
Product exploration explored 100000 steps with 315 reset in 295 ms.
Product exploration explored 100000 steps with 317 reset in 299 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 511 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 1861 steps (5 resets) in 23 ms. (77 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 800 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 99 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-29 05:32:03] [INFO ] Invariant cache hit.
[2024-05-29 05:32:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 05:32:03] [INFO ] Invariant cache hit.
[2024-05-29 05:32:03] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-29 05:32:03] [INFO ] Redundant transitions in 0 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-29 05:32:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:32:03] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:32:04] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:32:04] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:32:04] [INFO ] Deduced a trap composed of 60 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 108/236 variables, 128/177 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:32:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 178 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3422 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 108/236 variables, 128/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 104/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 282 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4558 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 5/5 constraints]
After SMT, in 7991ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 7992ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8162 ms. Remains : 128/128 places, 108/108 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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 493 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 1652 steps (4 resets) in 14 ms. (110 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 774 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 106 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 148 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 315 reset in 303 ms.
Product exploration explored 100000 steps with 316 reset in 274 ms.
Built C files in :
/tmp/ltsmin5905607947649347893
[2024-05-29 05:32:13] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2024-05-29 05:32:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:32:13] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2024-05-29 05:32:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:32:13] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2024-05-29 05:32:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:32:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5905607947649347893
Running compilation step : cd /tmp/ltsmin5905607947649347893;'/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'
Compilation finished in 259 ms.
Running link step : cd /tmp/ltsmin5905607947649347893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5905607947649347893;'/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' '--hoa' '/tmp/stateBased14721575592040233261.hoa' '--buchi-type=spotba'
LTSmin run took 444 ms.
FORMULA ShieldPPPs-PT-004B-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-004B-LTLFireability-10 finished in 22054 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)))'
Support contains 1 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 247 transition count 197
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 217 transition count 197
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 60 place count 217 transition count 177
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 100 place count 197 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 195 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 195 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 195 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 194 transition count 174
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 242 place count 126 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 124 transition count 104
Applied a total of 244 rules in 21 ms. Remains 124 /248 variables (removed 124) and now considering 104/228 (removed 124) transitions.
// Phase 1: matrix 104 rows 124 cols
[2024-05-29 05:32:14] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 05:32:14] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 05:32:14] [INFO ] Invariant cache hit.
[2024-05-29 05:32:14] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-29 05:32:14] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-29 05:32:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 05:32:15] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:32:15] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:32:15] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:32:15] [INFO ] Deduced a trap composed of 58 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/173 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 05:32:15] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:32:15] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:32:15] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 176 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2547 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 102/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 278 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3171 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
After SMT, in 5729ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 5730ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/248 places, 104/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5913 ms. Remains : 124/248 places, 104/228 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-12
Product exploration explored 100000 steps with 335 reset in 227 ms.
Product exploration explored 100000 steps with 337 reset in 249 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 based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 378 steps (0 resets) in 4 ms. (75 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 104/104 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-29 05:32:21] [INFO ] Invariant cache hit.
[2024-05-29 05:32:21] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 05:32:21] [INFO ] Invariant cache hit.
[2024-05-29 05:32:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-29 05:32:21] [INFO ] Redundant transitions in 0 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-29 05:32:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 05:32:21] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:32:21] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:32:21] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:32:21] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/173 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-29 05:32:22] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:32:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:32:22] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 176 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2654 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 102/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 278 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3246 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
After SMT, in 5910ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 5911ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6081 ms. Remains : 124/124 places, 104/104 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 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 424 steps (0 resets) in 6 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 334 reset in 225 ms.
Product exploration explored 100000 steps with 337 reset in 249 ms.
Built C files in :
/tmp/ltsmin1846062562595672750
[2024-05-29 05:32:28] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2024-05-29 05:32:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:32:28] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2024-05-29 05:32:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:32:28] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2024-05-29 05:32:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:32:28] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1846062562595672750
Running compilation step : cd /tmp/ltsmin1846062562595672750;'/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'
Compilation finished in 247 ms.
Running link step : cd /tmp/ltsmin1846062562595672750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1846062562595672750;'/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' '--hoa' '/tmp/stateBased16607321503512582294.hoa' '--buchi-type=spotba'
LTSmin run took 306 ms.
FORMULA ShieldPPPs-PT-004B-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-004B-LTLFireability-12 finished in 14374 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((G(p0)||(p1&&X(p2)))))'
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 246 transition count 226
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 226
Applied a total of 4 rules in 11 ms. Remains 246 /248 variables (removed 2) and now considering 226/228 (removed 2) transitions.
// Phase 1: matrix 226 rows 246 cols
[2024-05-29 05:32:28] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 05:32:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 05:32:28] [INFO ] Invariant cache hit.
[2024-05-29 05:32:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-29 05:32:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-29 05:32:31] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:32:32] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:32:32] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:32:32] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:32] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:32:32] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:32:32] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:32:32] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:32:32] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:32:32] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:32:33] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:32:35] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/472 variables, 246/339 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:38] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:32:39] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:32:39] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:32:39] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:32:39] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:32:39] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:32:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:32:39] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:32:39] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:32:40] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:32:40] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:41] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:32:41] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:32:42] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:42] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:32:43] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:32:44] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:32:44] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:32:44] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:32:44] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:46] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:32:46] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:32:46] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:48] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:32:48] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:50] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:52] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:32:53] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:32:54] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:32:54] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:32:54] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:32:54] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:32:54] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:32:54] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:32:54] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:55] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:32:55] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:32:55] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:32:55] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:32:57] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:32:57] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:32:57] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:32:57] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:32:58] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:32:58] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 404 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:00] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:33:00] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:33:00] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:33:00] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:33:00] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:33:01] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:02] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:03] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:33:03] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:33:03] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:33:03] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:33:04] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:33:04] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:05] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:33:05] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:33:05] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:33:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:33:05] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:33:06] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:33:07] [INFO ] Deduced a trap composed of 20 places in 16 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:09] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-29 05:33:09] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-29 05:33:10] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:14] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:17] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:33:17] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:21] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 05:33:25] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:33:25] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:33:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:33:25] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:33:25] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/472 variables, and 215 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/225 constraints, Known Traps: 170/170 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in LTL mode, iteration 1 : 246/248 places, 226/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60278 ms. Remains : 246/248 places, 226/228 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004B-LTLFireability-13 finished in 60469 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((p0||F(p1))))'
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 247 transition count 198
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 218 transition count 198
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 58 place count 218 transition count 179
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 96 place count 199 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 198 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 198 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 98 place count 198 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 197 transition count 177
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 238 place count 128 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 126 transition count 106
Applied a total of 240 rules in 20 ms. Remains 126 /248 variables (removed 122) and now considering 106/228 (removed 122) transitions.
// Phase 1: matrix 106 rows 126 cols
[2024-05-29 05:33:29] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 05:33:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 05:33:29] [INFO ] Invariant cache hit.
[2024-05-29 05:33:29] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-29 05:33:29] [INFO ] Redundant transitions in 0 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-29 05:33:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:33:29] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:33:29] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:33:30] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:33:30] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 106/232 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:33:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:33:31] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 05:33:31] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:33:31] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 179 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3161 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 106/232 variables, 126/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 104/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/232 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 283 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3033 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 8/8 constraints]
After SMT, in 6205ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 6207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/248 places, 106/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6384 ms. Remains : 126/248 places, 106/228 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-14
Product exploration explored 100000 steps with 2712 reset in 181 ms.
Product exploration explored 100000 steps with 2722 reset in 201 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 (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 246 steps (0 resets) in 10 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-29 05:33:36] [INFO ] Invariant cache hit.
[2024-05-29 05:33:36] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:33:36] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-29 05:33:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:33:36] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:33:36] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-29 05:33:36] [INFO ] Computed and/alt/rep : 104/195/104 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 05:33:36] [INFO ] Added : 65 causal constraints over 13 iterations in 147 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 106/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-05-29 05:33:36] [INFO ] Invariant cache hit.
[2024-05-29 05:33:37] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 05:33:37] [INFO ] Invariant cache hit.
[2024-05-29 05:33:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-29 05:33:37] [INFO ] Redundant transitions in 0 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-29 05:33:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:33:37] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:33:37] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:33:37] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:33:37] [INFO ] Deduced a trap composed of 58 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 106/232 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:33:38] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:33:38] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:33:39] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:33:39] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 179 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3224 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 106/232 variables, 126/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 104/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/232 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 283 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3045 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 8/8 constraints]
After SMT, in 6282ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 6283ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6445 ms. Remains : 126/126 places, 106/106 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 (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 182 steps (0 resets) in 6 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-29 05:33:43] [INFO ] Invariant cache hit.
[2024-05-29 05:33:43] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:33:43] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-29 05:33:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:33:44] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:33:44] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-29 05:33:44] [INFO ] Computed and/alt/rep : 104/195/104 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 05:33:44] [INFO ] Added : 65 causal constraints over 13 iterations in 143 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2673 reset in 192 ms.
Product exploration explored 100000 steps with 2667 reset in 201 ms.
Built C files in :
/tmp/ltsmin6260879649635173235
[2024-05-29 05:33:44] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2024-05-29 05:33:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:33:44] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2024-05-29 05:33:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:33:44] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2024-05-29 05:33:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:33:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6260879649635173235
Running compilation step : cd /tmp/ltsmin6260879649635173235;'/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'
Compilation finished in 244 ms.
Running link step : cd /tmp/ltsmin6260879649635173235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6260879649635173235;'/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' '--hoa' '/tmp/stateBased9492691371405059689.hoa' '--buchi-type=spotba'
LTSmin run took 365 ms.
FORMULA ShieldPPPs-PT-004B-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-004B-LTLFireability-14 finished in 16132 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)))'
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(F((p0&&X(X(F(p1)))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-004B-LTLFireability-02
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 247 transition count 197
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 217 transition count 197
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 60 place count 217 transition count 178
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 98 place count 198 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 197 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 197 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 100 place count 197 transition count 176
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 196 transition count 176
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 234 place count 130 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 128 transition count 108
Applied a total of 236 rules in 27 ms. Remains 128 /248 variables (removed 120) and now considering 108/228 (removed 120) transitions.
// Phase 1: matrix 108 rows 128 cols
[2024-05-29 05:33:45] [INFO ] Computed 45 invariants in 0 ms
[2024-05-29 05:33:45] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 05:33:45] [INFO ] Invariant cache hit.
[2024-05-29 05:33:45] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-29 05:33:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:33:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 05:33:46] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:33:46] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:33:46] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:33:46] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 108/236 variables, 128/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:33:48] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/236 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 179 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3548 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 108/236 variables, 128/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 105/284 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:33:50] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:33:51] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:33:51] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:33:54] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:33:54] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:33:57] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:33:57] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 291 constraints, problems are : Problem set: 0 solved, 105 unsolved in 15164 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 13/13 constraints]
After SMT, in 18722ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 18723ms
Starting structural reductions in LI_LTL mode, iteration 1 : 128/248 places, 108/228 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 18899 ms. Remains : 128/248 places, 108/228 transitions.
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-02
Product exploration explored 100000 steps with 2713 reset in 197 ms.
Product exploration explored 100000 steps with 2636 reset in 215 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 42 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 214 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-29 05:34:05] [INFO ] Invariant cache hit.
[2024-05-29 05:34:05] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:34:05] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-29 05:34:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:34:05] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:34:06] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-29 05:34:06] [INFO ] Computed and/alt/rep : 105/208/105 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 05:34:06] [INFO ] Added : 105 causal constraints over 21 iterations in 211 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-29 05:34:06] [INFO ] Invariant cache hit.
[2024-05-29 05:34:06] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:34:06] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-29 05:34:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:34:06] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:34:06] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-29 05:34:06] [INFO ] Computed and/alt/rep : 105/208/105 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 05:34:06] [INFO ] Added : 74 causal constraints over 15 iterations in 183 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-29 05:34:06] [INFO ] Invariant cache hit.
[2024-05-29 05:34:06] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 05:34:06] [INFO ] Invariant cache hit.
[2024-05-29 05:34:06] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-29 05:34:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:34:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:34:07] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:34:07] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:34:07] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 108/236 variables, 128/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:09] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/236 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 179 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3467 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 108/236 variables, 128/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 105/284 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:11] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:34:11] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:34:11] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:14] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:34:14] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:17] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 05:34:17] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 291 constraints, problems are : Problem set: 0 solved, 105 unsolved in 14982 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 13/13 constraints]
After SMT, in 18463ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 18465ms
Finished structural reductions in LTL mode , in 1 iterations and 18632 ms. Remains : 128/128 places, 108/108 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-29 05:34:26] [INFO ] Invariant cache hit.
[2024-05-29 05:34:26] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:34:26] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-29 05:34:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:34:26] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:34:26] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-29 05:34:26] [INFO ] Computed and/alt/rep : 105/208/105 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 05:34:26] [INFO ] Added : 105 causal constraints over 21 iterations in 221 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-29 05:34:26] [INFO ] Invariant cache hit.
[2024-05-29 05:34:26] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:34:26] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-29 05:34:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:34:26] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:34:26] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-29 05:34:26] [INFO ] Computed and/alt/rep : 105/208/105 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 05:34:26] [INFO ] Added : 74 causal constraints over 15 iterations in 177 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2756 reset in 193 ms.
Product exploration explored 100000 steps with 2847 reset in 210 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-29 05:34:27] [INFO ] Redundant transitions in 0 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-29 05:34:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:34:28] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:34:28] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:34:28] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:34:28] [INFO ] Deduced a trap composed of 53 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 108/236 variables, 128/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:29] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/236 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 179 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3507 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 108/236 variables, 128/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 105/284 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:32] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:34:32] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:34:32] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:35] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:34:35] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:34:38] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 05:34:38] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 291 constraints, problems are : Problem set: 0 solved, 105 unsolved in 15077 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 13/13 constraints]
After SMT, in 18611ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 18612ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18620 ms. Remains : 128/128 places, 108/108 transitions.
Built C files in :
/tmp/ltsmin7510906669682952802
[2024-05-29 05:34:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7510906669682952802
Running compilation step : cd /tmp/ltsmin7510906669682952802;'/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'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin7510906669682952802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7510906669682952802;'/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' '--hoa' '/tmp/stateBased17820734146941933200.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 108/108 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-29 05:35:01] [INFO ] Invariant cache hit.
[2024-05-29 05:35:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 05:35:01] [INFO ] Invariant cache hit.
[2024-05-29 05:35:01] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-29 05:35:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:35:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:35:02] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:35:02] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:35:02] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:35:02] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 108/236 variables, 128/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:35:03] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/236 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 179 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3505 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 108/236 variables, 128/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 105/284 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:35:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:35:06] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:35:06] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:35:09] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:35:09] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 291 constraints, problems are : Problem set: 0 solved, 105 unsolved in 15010 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 13/13 constraints]
After SMT, in 18525ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 18526ms
Finished structural reductions in LTL mode , in 1 iterations and 18695 ms. Remains : 128/128 places, 108/108 transitions.
Built C files in :
/tmp/ltsmin17071513522184418066
[2024-05-29 05:35:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17071513522184418066
Running compilation step : cd /tmp/ltsmin17071513522184418066;'/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'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin17071513522184418066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17071513522184418066;'/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' '--hoa' '/tmp/stateBased3313244173312653497.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:35:35] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:35:35] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:35:35] [INFO ] Time to serialize gal into /tmp/LTL5418283698616883179.gal : 1 ms
[2024-05-29 05:35:35] [INFO ] Time to serialize properties into /tmp/LTL2618506006734665706.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/LTL5418283698616883179.gal' '-t' 'CGAL' '-hoa' '/tmp/aut748618982448073598.hoa' '-atoms' '/tmp/LTL2618506006734665706.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...316
Loading property file /tmp/LTL2618506006734665706.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut748618982448073598.hoa
Detected timeout of ITS tools.
[2024-05-29 05:35:50] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:35:50] [INFO ] Flatten gal took : 3 ms
[2024-05-29 05:35:50] [INFO ] Time to serialize gal into /tmp/LTL3270746996379128177.gal : 1 ms
[2024-05-29 05:35:50] [INFO ] Time to serialize properties into /tmp/LTL2131650003077706283.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/LTL3270746996379128177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2131650003077706283.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...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("((p117==1)||(p12==1))"))))&&("((p94==1)||(p12==1))")))))
Formula 0 simplified : XG(!"((p94==1)||(p12==1))" | XXG!"((p117==1)||(p12==1))")
Detected timeout of ITS tools.
[2024-05-29 05:36:05] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:36:05] [INFO ] Applying decomposition
[2024-05-29 05:36:05] [INFO ] Flatten gal took : 6 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/graph3382402548295396732.txt' '-o' '/tmp/graph3382402548295396732.bin' '-w' '/tmp/graph3382402548295396732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3382402548295396732.bin' '-l' '-1' '-v' '-w' '/tmp/graph3382402548295396732.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:36:05] [INFO ] Decomposing Gal with order
[2024-05-29 05:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:36:05] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-29 05:36:05] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2024-05-29 05:36:05] [INFO ] Time to serialize gal into /tmp/LTL14130008817347091867.gal : 1 ms
[2024-05-29 05:36:05] [INFO ] Time to serialize properties into /tmp/LTL3905988043980896723.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/LTL14130008817347091867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3905988043980896723.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...255
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("((i5.i1.u21.p117==1)||(i0.u1.p12==1))"))))&&("((i4.i0.u16.p94==1)||(i0.u1.p12==1))")))))
Formula 0 simplified : XG(!"((i4.i0.u16.p94==1)||(i0.u1.p12==1))" | XXG!"((i5.i1.u21.p117==1)||(i0.u1.p12==1))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004B-LTLFireability-02 finished in 154896 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' '!((p0 U ((!p0||F(G(p1))) U X(p2))))'
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(F(p0))&&F(p1))))'
Found a Shortening insensitive property : ShieldPPPs-PT-004B-LTLFireability-08
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 248/248 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 247 transition count 199
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 219 transition count 199
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 56 place count 219 transition count 178
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 98 place count 198 transition count 178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 196 transition count 176
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 196 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 102 place count 196 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 195 transition count 175
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 236 place count 129 transition count 109
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 127 transition count 107
Applied a total of 238 rules in 22 ms. Remains 127 /248 variables (removed 121) and now considering 107/228 (removed 121) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 05:36:20] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 05:36:20] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 05:36:20] [INFO ] Invariant cache hit.
[2024-05-29 05:36:20] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-29 05:36:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:21] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:36:21] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:36:21] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:22] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:36:22] [INFO ] Deduced a trap composed of 28 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/177 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:23] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 178 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3420 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 104/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 283 constraints, problems are : Problem set: 0 solved, 104 unsolved in 9401 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 7/7 constraints]
After SMT, in 12831ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 12832ms
Starting structural reductions in LI_LTL mode, iteration 1 : 127/248 places, 107/228 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13014 ms. Remains : 127/248 places, 107/228 transitions.
Running random walk in product with property : ShieldPPPs-PT-004B-LTLFireability-08
Product exploration explored 100000 steps with 1033 reset in 212 ms.
Product exploration explored 100000 steps with 1028 reset in 242 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 352 steps (0 resets) in 5 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 05:36:34] [INFO ] Invariant cache hit.
[2024-05-29 05:36:34] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-29 05:36:34] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-29 05:36:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:36:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:36:34] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-29 05:36:34] [INFO ] Computed and/alt/rep : 104/201/104 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 05:36:35] [INFO ] Added : 88 causal constraints over 18 iterations in 200 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 05:36:35] [INFO ] Invariant cache hit.
[2024-05-29 05:36:35] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 05:36:35] [INFO ] Invariant cache hit.
[2024-05-29 05:36:35] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-29 05:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:35] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:36:36] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:36:36] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:36] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:36:36] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/177 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:37] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 178 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3381 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 104/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:41] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 283 constraints, problems are : Problem set: 0 solved, 104 unsolved in 9385 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 7/7 constraints]
After SMT, in 12777ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 12778ms
Finished structural reductions in LTL mode , in 1 iterations and 12934 ms. Remains : 127/127 places, 107/107 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 356 steps (0 resets) in 7 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 05:36:48] [INFO ] Invariant cache hit.
[2024-05-29 05:36:48] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:36:48] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-29 05:36:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:36:48] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-29 05:36:48] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-29 05:36:48] [INFO ] Computed and/alt/rep : 104/201/104 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 05:36:49] [INFO ] Added : 88 causal constraints over 18 iterations in 203 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1036 reset in 209 ms.
Product exploration explored 100000 steps with 1030 reset in 230 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 05:36:49] [INFO ] Redundant transitions in 5 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-29 05:36:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:50] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:36:50] [INFO ] Deduced a trap composed of 43 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:36:50] [INFO ] Deduced a trap composed of 58 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:51] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:36:51] [INFO ] Deduced a trap composed of 28 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/177 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:52] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 178 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3345 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 104/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:36:55] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 283 constraints, problems are : Problem set: 0 solved, 104 unsolved in 9450 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 7/7 constraints]
After SMT, in 12811ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 12812ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12831 ms. Remains : 127/127 places, 107/107 transitions.
Built C files in :
/tmp/ltsmin14716657179159027003
[2024-05-29 05:37:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14716657179159027003
Running compilation step : cd /tmp/ltsmin14716657179159027003;'/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'
Compilation finished in 228 ms.
Running link step : cd /tmp/ltsmin14716657179159027003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14716657179159027003;'/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' '--hoa' '/tmp/stateBased10338531519328576063.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 05:37:17] [INFO ] Invariant cache hit.
[2024-05-29 05:37:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 05:37:17] [INFO ] Invariant cache hit.
[2024-05-29 05:37:17] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-29 05:37:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:37:18] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:37:18] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:37:18] [INFO ] Deduced a trap composed of 58 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:37:19] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:37:19] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/177 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:37:20] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 178 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3382 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 104/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 05:37:24] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 283 constraints, problems are : Problem set: 0 solved, 104 unsolved in 9361 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 7/7 constraints]
After SMT, in 12751ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 12752ms
Finished structural reductions in LTL mode , in 1 iterations and 12896 ms. Remains : 127/127 places, 107/107 transitions.
Built C files in :
/tmp/ltsmin13261034550632184601
[2024-05-29 05:37:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13261034550632184601
Running compilation step : cd /tmp/ltsmin13261034550632184601;'/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'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin13261034550632184601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13261034550632184601;'/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' '--hoa' '/tmp/stateBased1197788492976448876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:37:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 05:37:45] [INFO ] Flatten gal took : 15 ms
[2024-05-29 05:37:45] [INFO ] Time to serialize gal into /tmp/LTL9602889704650651890.gal : 1 ms
[2024-05-29 05:37:45] [INFO ] Time to serialize properties into /tmp/LTL12555429165048823935.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/LTL9602889704650651890.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8846931945359643350.hoa' '-atoms' '/tmp/LTL12555429165048823935.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/LTL12555429165048823935.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8846931945359643350.hoa
Detected timeout of ITS tools.
[2024-05-29 05:38:00] [INFO ] Flatten gal took : 8 ms
[2024-05-29 05:38:00] [INFO ] Flatten gal took : 4 ms
[2024-05-29 05:38:00] [INFO ] Time to serialize gal into /tmp/LTL17705034343144579751.gal : 1 ms
[2024-05-29 05:38:00] [INFO ] Time to serialize properties into /tmp/LTL9420868787605896761.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/LTL17705034343144579751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9420868787605896761.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((X(F("(((p41==1)&&(p92==1))||(p19==1))")))&&(F("((p41!=1)||(p92!=1))")))))
Formula 0 simplified : X(XG!"(((p41==1)&&(p92==1))||(p19==1))" | G!"((p41!=1)||(p92!=1))")
Detected timeout of ITS tools.
[2024-05-29 05:38:15] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:38:15] [INFO ] Applying decomposition
[2024-05-29 05:38:15] [INFO ] Flatten gal took : 3 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/graph8485177196193833029.txt' '-o' '/tmp/graph8485177196193833029.bin' '-w' '/tmp/graph8485177196193833029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8485177196193833029.bin' '-l' '-1' '-v' '-w' '/tmp/graph8485177196193833029.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:38:15] [INFO ] Decomposing Gal with order
[2024-05-29 05:38:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:38:15] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 05:38:15] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:38:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 1 ms.
[2024-05-29 05:38:15] [INFO ] Time to serialize gal into /tmp/LTL11022974900116558299.gal : 4 ms
[2024-05-29 05:38:15] [INFO ] Time to serialize properties into /tmp/LTL12982868487182978601.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/LTL11022974900116558299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12982868487182978601.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 : !((X((X(F("(((i0.u9.p41==1)&&(i3.i0.u16.p92==1))||(i1.u2.p19==1))")))&&(F("((i0.u9.p41!=1)||(i3.i0.u16.p92!=1))")))))
Formula 0 simplified : X(XG!"(((i0.u9.p41==1)&&(i3.i0.u16.p92==1))||(i1.u2.p19==1))" | G!"((i0.u9.p41!=1)||(i3.i0.u16.p92!=1))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004B-LTLFireability-08 finished in 130485 ms.
[2024-05-29 05:38:30] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13501939655215108771
[2024-05-29 05:38:30] [INFO ] Applying decomposition
[2024-05-29 05:38:30] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2024-05-29 05:38:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:30] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2024-05-29 05:38:30] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:38:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:31] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
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/graph262338685839227822.txt' '-o' '/tmp/graph262338685839227822.bin' '-w' '/tmp/graph262338685839227822.weights'
[2024-05-29 05:38:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph262338685839227822.bin' '-l' '-1' '-v' '-w' '/tmp/graph262338685839227822.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:38:31] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13501939655215108771
Running compilation step : cd /tmp/ltsmin13501939655215108771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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-29 05:38:31] [INFO ] Decomposing Gal with order
[2024-05-29 05:38:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:38:31] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-29 05:38:31] [INFO ] Flatten gal took : 14 ms
[2024-05-29 05:38:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 05:38:31] [INFO ] Time to serialize gal into /tmp/LTLFireability6066638840612254948.gal : 2 ms
[2024-05-29 05:38:31] [INFO ] Time to serialize properties into /tmp/LTLFireability11159880703476126544.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/LTLFireability6066638840612254948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11159880703476126544.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 4 LTL properties
Checking formula 0 : !((G(F("(i4.u47.p131==1)"))))
Formula 0 simplified : FG!"(i4.u47.p131==1)"
Compilation finished in 500 ms.
Running link step : cd /tmp/ltsmin13501939655215108771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13501939655215108771;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13501939655215108771;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13501939655215108771;'/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(<>(((LTLAPp1==true)&&X(X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13501939655215108771;'/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(<>(((LTLAPp1==true)&&X(X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13501939655215108771;'/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' '((LTLAPp3==true) U ((!(LTLAPp3==true)||<>([]((LTLAPp4==true)))) U X((LTLAPp5==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13501939655215108771;'/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' '((LTLAPp3==true) U ((!(LTLAPp3==true)||<>([]((LTLAPp4==true)))) U X((LTLAPp5==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13501939655215108771;'/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(<>((LTLAPp6==true)))&&<>((LTLAPp7==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13501939655215108771;'/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(<>((LTLAPp6==true)))&&<>((LTLAPp7==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin13501939655215108771;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 06:07:08] [INFO ] Applying decomposition
[2024-05-29 06:07:08] [INFO ] Flatten gal took : 6 ms
[2024-05-29 06:07:08] [INFO ] Decomposing Gal with order
[2024-05-29 06:07:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:07:08] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 06:07:08] [INFO ] Flatten gal took : 26 ms
[2024-05-29 06:07:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3 ms.
[2024-05-29 06:07:08] [INFO ] Time to serialize gal into /tmp/LTLFireability4505870072084334926.gal : 3 ms
[2024-05-29 06:07:08] [INFO ] Time to serialize properties into /tmp/LTLFireability5689659612173355568.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/LTLFireability4505870072084334926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5689659612173355568.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...276
Read 4 LTL properties
Checking formula 0 : !((G(F("(i0.i0.i1.u46.p131==1)"))))
Formula 0 simplified : FG!"(i0.i0.i1.u46.p131==1)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Initializing POR dependencies: labels 236, guards 228
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.441: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.441: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.441: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.481: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.508: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.513: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.533: There are 238 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.533: State length is 249, there are 231 groups
pins2lts-mc-linux64( 0/ 8), 0.533: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.533: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.533: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.533: Visible groups: 0 / 231, labels: 1 / 238
pins2lts-mc-linux64( 0/ 8), 0.533: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.533: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.553: [Blue] ~120 levels ~960 states ~1160 transitions
pins2lts-mc-linux64( 0/ 8), 0.578: [Blue] ~229 levels ~1920 states ~3104 transitions
pins2lts-mc-linux64( 7/ 8), 0.621: [Blue] ~362 levels ~3840 states ~6808 transitions
pins2lts-mc-linux64( 2/ 8), 0.665: [Blue] ~435 levels ~7680 states ~11032 transitions
pins2lts-mc-linux64( 0/ 8), 0.748: [Blue] ~428 levels ~15360 states ~20248 transitions
pins2lts-mc-linux64( 2/ 8), 0.961: [Blue] ~438 levels ~30720 states ~39496 transitions
pins2lts-mc-linux64( 2/ 8), 1.305: [Blue] ~438 levels ~61440 states ~79224 transitions
pins2lts-mc-linux64( 2/ 8), 1.973: [Blue] ~438 levels ~122880 states ~155016 transitions
pins2lts-mc-linux64( 5/ 8), 3.171: [Blue] ~469 levels ~245760 states ~315320 transitions
pins2lts-mc-linux64( 2/ 8), 5.197: [Blue] ~438 levels ~491520 states ~618680 transitions
pins2lts-mc-linux64( 6/ 8), 8.637: [Blue] ~368 levels ~983040 states ~1258440 transitions
pins2lts-mc-linux64( 6/ 8), 15.012: [Blue] ~368 levels ~1966080 states ~2526096 transitions
pins2lts-mc-linux64( 6/ 8), 27.731: [Blue] ~371 levels ~3932160 states ~5100416 transitions
pins2lts-mc-linux64( 6/ 8), 53.271: [Blue] ~387 levels ~7864320 states ~10320592 transitions
pins2lts-mc-linux64( 6/ 8), 104.893: [Blue] ~390 levels ~15728640 states ~20682608 transitions
pins2lts-mc-linux64( 1/ 8), 210.448: [Blue] ~383 levels ~31457280 states ~40596472 transitions
pins2lts-mc-linux64( 1/ 8), 415.074: [Blue] ~383 levels ~62914560 states ~79679280 transitions
pins2lts-mc-linux64( 1/ 8), 839.559: [Blue] ~391 levels ~125829120 states ~161529016 transitions
pins2lts-mc-linux64( 2/ 8), 926.764: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 926.800:
pins2lts-mc-linux64( 0/ 8), 926.800: Explored 134215529 states 177855802 transitions, fanout: 1.325
pins2lts-mc-linux64( 0/ 8), 926.800: Total exploration time 926.230 sec (926.200 sec minimum, 926.219 sec on average)
pins2lts-mc-linux64( 0/ 8), 926.800: States per second: 144905, Transitions per second: 192021
pins2lts-mc-linux64( 0/ 8), 926.800:
pins2lts-mc-linux64( 0/ 8), 926.800: State space has 134217394 states, 134212663 are accepting
pins2lts-mc-linux64( 0/ 8), 926.800: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 926.800: blue states: 134215529 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 926.800: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 926.800: all-red states: 134212663 (100.00%), bogus 2 (0.00%)
pins2lts-mc-linux64( 0/ 8), 926.800:
pins2lts-mc-linux64( 0/ 8), 926.800: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 926.800:
pins2lts-mc-linux64( 0/ 8), 926.800: Queue width: 8B, total height: 3483, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 926.800: Tree memory: 1054.7MB, 8.2 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 926.800: Tree fill ratio (roots/leafs): 99.0%/11.0%
pins2lts-mc-linux64( 0/ 8), 926.800: Stored 228 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 926.800: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 926.800: Est. total memory use: 1054.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13501939655215108771;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13501939655215108771;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)

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="ShieldPPPs-PT-004B"
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 ShieldPPPs-PT-004B, 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 r356-tall-171683761000412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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