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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 97K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716358445183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 06:14:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 06:14:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:14:06] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-22 06:14:06] [INFO ] Transformed 314 places.
[2024-05-22 06:14:06] [INFO ] Transformed 271 transitions.
[2024-05-22 06:14:06] [INFO ] Found NUPN structural information;
[2024-05-22 06:14:06] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 48 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2024-05-22 06:14:06] [INFO ] Computed 59 invariants in 31 ms
[2024-05-22 06:14:07] [INFO ] Implicit Places using invariants in 443 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 476 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/314 places, 257/257 transitions.
Applied a total of 0 rules in 17 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 558 ms. Remains : 313/314 places, 257/257 transitions.
Support contains 44 out of 313 places after structural reductions.
[2024-05-22 06:14:07] [INFO ] Flatten gal took : 54 ms
[2024-05-22 06:14:07] [INFO ] Flatten gal took : 26 ms
[2024-05-22 06:14:07] [INFO ] Input system was already deterministic with 257 transitions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (885 resets) in 2286 ms. (17 steps per ms) remains 18/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 69 ms. (57 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 61 ms. (64 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (24 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (18 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (17 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
// Phase 1: matrix 257 rows 313 cols
[2024-05-22 06:14:08] [INFO ] Computed 58 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 14/40 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 58/98 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 58/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 161/259 variables, 23/154 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 161/315 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 6/265 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 14 (OVERLAPS) 256/521 variables, 265/588 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/521 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 49/570 variables, 48/636 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/570 variables, 48/684 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-22 06:14:11] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 15 ms to minimize.
[2024-05-22 06:14:11] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/570 variables, 2/686 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/570 variables, 0/686 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 686 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5014 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 14/38 variables, 8/32 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 14/46 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 58/96 variables, 25/71 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 58/129 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 163/259 variables, 23/152 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 163/315 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/317 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-22 06:14:14] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-22 06:14:14] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 2/319 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 0/319 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 6/265 variables, 2/321 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 6/327 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/327 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 256/521 variables, 265/592 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/521 variables, 6/598 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-22 06:14:16] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:14:16] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/521 variables, 2/600 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/570 variables, and 600 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5013 ms.
Refiners :[Domain max(s): 265/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 265/313 constraints, PredecessorRefiner: 6/18 constraints, Known Traps: 6/6 constraints]
After SMT, in 10136ms problems are : Problem set: 1 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 312 transition count 254
Applied a total of 8 rules in 52 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 312/313 places, 254/257 transitions.
RANDOM walk for 40000 steps (536 resets) in 552 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (27 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 575334 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 17
Probabilistic random walk after 575334 steps, saw 82673 distinct states, run finished after 3004 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:14:22] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 06:14:22] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 14/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 66/104 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 163/267 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 254/521 variables, 267/327 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-22 06:14:22] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:14:23] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2024-05-22 06:14:23] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:14:23] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 45/566 variables, 45/378 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-22 06:14:24] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/566 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 379 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3538 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 14/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 66/104 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 163/267 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 254/521 variables, 267/332 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 45/566 variables, 45/385 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 11/396 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-22 06:14:34] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/566 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-22 06:14:49] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/566 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-22 06:15:01] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/566 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/566 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 399 constraints, problems are : Problem set: 0 solved, 17 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 8/8 constraints]
After SMT, in 48595ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 20 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 06:15:10] [INFO ] Invariant cache hit.
[2024-05-22 06:15:10] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 06:15:10] [INFO ] Invariant cache hit.
[2024-05-22 06:15:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:15:11] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-22 06:15:11] [INFO ] Redundant transitions in 17 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-22 06:15:11] [INFO ] Invariant cache hit.
[2024-05-22 06:15:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/566 variables, 312/372 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:15:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:15:18] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:15:18] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:15:18] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:15:21] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:15:29] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/566 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 380 constraints, problems are : Problem set: 0 solved, 253 unsolved in 28917 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:15:41] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:15:43] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:15:44] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:15:46] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 254/566 variables, 312/382 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 253/637 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 637 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 10/10 constraints]
After SMT, in 59172ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 59179ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59711 ms. Remains : 312/312 places, 254/254 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA DES-PT-50a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 216 stabilizing places and 211 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' '!(F((X(X(G(p0))) U p1)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 22 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 06:16:10] [INFO ] Computed 58 invariants in 11 ms
[2024-05-22 06:16:10] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 06:16:10] [INFO ] Invariant cache hit.
[2024-05-22 06:16:11] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-05-22 06:16:11] [INFO ] Redundant transitions in 17 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-22 06:16:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:16:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:16:18] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:16:18] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:16:21] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:16:23] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:16:25] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20922 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:16:35] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:17:00] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:17:00] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 51150ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51705 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-00
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 4 ms.
FORMULA DES-PT-50a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-00 finished in 51926 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(p1)||p0))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 23 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 06:17:02] [INFO ] Invariant cache hit.
[2024-05-22 06:17:02] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-22 06:17:02] [INFO ] Invariant cache hit.
[2024-05-22 06:17:03] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-22 06:17:03] [INFO ] Redundant transitions in 2 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-22 06:17:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:17:05] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:17:10] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:17:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:17:13] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:17:15] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:17:16] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20373 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:17:26] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:17:52] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:17:52] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50621ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50625ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51242 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50a-LTLFireability-01
Product exploration explored 100000 steps with 2223 reset in 293 ms.
Product exploration explored 100000 steps with 2243 reset in 314 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (886 resets) in 1390 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (226 resets) in 345 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (206 resets) in 328 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (207 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (253 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 677580 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 4
Probabilistic random walk after 677580 steps, saw 105297 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2024-05-22 06:17:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/80 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 174/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 4 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/80 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 174/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:17:59] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 53/568 variables, 52/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/568 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 375 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1188 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1875ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3482 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 312 transition count 254
Applied a total of 6 rules in 25 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (529 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (271 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (94 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (89 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (287 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 839244 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 4
Probabilistic random walk after 839244 steps, saw 119512 distinct states, run finished after 3002 ms. (steps per millisecond=279 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:18:07] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 06:18:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 81/89 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:18:07] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 174/263 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 254/517 variables, 263/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 49/566 variables, 49/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 375 constraints, problems are : Problem set: 0 solved, 4 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 81/89 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:18:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 174/263 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 254/517 variables, 263/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 49/566 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 380 constraints, problems are : Problem set: 0 solved, 4 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1739ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6485 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 06:18:15] [INFO ] Invariant cache hit.
[2024-05-22 06:18:15] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 06:18:15] [INFO ] Invariant cache hit.
[2024-05-22 06:18:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:18:16] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-22 06:18:16] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-22 06:18:16] [INFO ] Invariant cache hit.
[2024-05-22 06:18:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/566 variables, 312/372 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:18:23] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:18:23] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:18:23] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-22 06:18:23] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:18:26] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:18:34] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/566 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 380 constraints, problems are : Problem set: 0 solved, 253 unsolved in 28105 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:18:45] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:18:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:18:48] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:18:50] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 254/566 variables, 312/382 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 253/637 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:19:13] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 638 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 11/11 constraints]
After SMT, in 58302ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 58305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58973 ms. Remains : 312/312 places, 254/254 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 06:19:14] [INFO ] Invariant cache hit.
[2024-05-22 06:19:14] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 06:19:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2024-05-22 06:19:14] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 06:19:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:19:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-22 06:19:14] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 06:19:15] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 06:19:15] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 875 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 28 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 06:19:15] [INFO ] Computed 58 invariants in 11 ms
[2024-05-22 06:19:16] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 06:19:16] [INFO ] Invariant cache hit.
[2024-05-22 06:19:16] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-22 06:19:16] [INFO ] Redundant transitions in 0 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-22 06:19:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:19:19] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:19:23] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:19:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:19:26] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:19:28] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:19:30] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20705 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:19:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:20:06] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 3 ms to minimize.
[2024-05-22 06:20:06] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50926ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50929ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51498 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (888 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (231 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (201 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (205 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (255 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 822757 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 4
Probabilistic random walk after 822757 steps, saw 123033 distinct states, run finished after 3002 ms. (steps per millisecond=274 ) properties seen :0
[2024-05-22 06:20:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/80 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 174/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 53/568 variables, 52/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 4 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/80 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 174/254 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/260 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 255/515 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:20:11] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 53/568 variables, 52/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/568 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 375 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1532ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3972 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 312 transition count 254
Applied a total of 6 rules in 26 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (537 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (269 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (90 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (289 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 819250 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 4
Probabilistic random walk after 819250 steps, saw 116811 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:20:19] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 06:20:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 81/89 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:20:19] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 174/263 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 254/517 variables, 263/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 49/566 variables, 49/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 375 constraints, problems are : Problem set: 0 solved, 4 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 81/89 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:20:19] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 174/263 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 254/517 variables, 263/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 49/566 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 380 constraints, problems are : Problem set: 0 solved, 4 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1328ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6753 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 20 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 06:20:27] [INFO ] Invariant cache hit.
[2024-05-22 06:20:27] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 06:20:27] [INFO ] Invariant cache hit.
[2024-05-22 06:20:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:20:28] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-22 06:20:28] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-22 06:20:28] [INFO ] Invariant cache hit.
[2024-05-22 06:20:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/566 variables, 312/372 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:20:35] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:20:35] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-22 06:20:35] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:20:35] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:20:38] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:20:46] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/566 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 380 constraints, problems are : Problem set: 0 solved, 253 unsolved in 28710 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:20:58] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:20:59] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:21:01] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:21:02] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 254/566 variables, 312/382 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 253/637 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 637 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 10/10 constraints]
After SMT, in 58895ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 58898ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59517 ms. Remains : 312/312 places, 254/254 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 06:21:27] [INFO ] Invariant cache hit.
[2024-05-22 06:21:27] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:21:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-22 06:21:27] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 06:21:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 06:21:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 06:21:27] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 06:21:27] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 06:21:27] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 809 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 130 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2230 reset in 221 ms.
Product exploration explored 100000 steps with 2212 reset in 273 ms.
Built C files in :
/tmp/ltsmin1675986494058112732
[2024-05-22 06:21:28] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-22 06:21:28] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:21:28] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-22 06:21:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:21:28] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-22 06:21:28] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:21:28] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1675986494058112732
Running compilation step : cd /tmp/ltsmin1675986494058112732;'/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 952 ms.
Running link step : cd /tmp/ltsmin1675986494058112732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1675986494058112732;'/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/stateBased6115981830829086582.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 14 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 06:21:43] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 06:21:44] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-22 06:21:44] [INFO ] Invariant cache hit.
[2024-05-22 06:21:44] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-22 06:21:44] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-22 06:21:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:21:47] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:21:51] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:21:51] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:21:54] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:21:56] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:21:57] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20116 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:22:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:22:32] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:22:32] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50311ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50314ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50846 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin7379249785002953269
[2024-05-22 06:22:34] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-22 06:22:34] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:22:34] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-22 06:22:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:22:34] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-22 06:22:34] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:22:34] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7379249785002953269
Running compilation step : cd /tmp/ltsmin7379249785002953269;'/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 663 ms.
Running link step : cd /tmp/ltsmin7379249785002953269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7379249785002953269;'/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/stateBased13554342593855601730.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 06:22:49] [INFO ] Flatten gal took : 20 ms
[2024-05-22 06:22:49] [INFO ] Flatten gal took : 20 ms
[2024-05-22 06:22:49] [INFO ] Time to serialize gal into /tmp/LTL9643723782185687558.gal : 5 ms
[2024-05-22 06:22:49] [INFO ] Time to serialize properties into /tmp/LTL10395104348865984123.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/LTL9643723782185687558.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8450667209072553506.hoa' '-atoms' '/tmp/LTL10395104348865984123.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/LTL10395104348865984123.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8450667209072553506.hoa
Detected timeout of ITS tools.
[2024-05-22 06:23:05] [INFO ] Flatten gal took : 19 ms
[2024-05-22 06:23:05] [INFO ] Flatten gal took : 22 ms
[2024-05-22 06:23:05] [INFO ] Time to serialize gal into /tmp/LTL8350871195738475355.gal : 4 ms
[2024-05-22 06:23:05] [INFO ] Time to serialize properties into /tmp/LTL11170970330724596899.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8350871195738475355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11170970330724596899.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(("((p114!=1)||(p229!=1))")||(G("((p154!=1)||(p204!=1))"))))))
Formula 0 simplified : G(F!"((p154!=1)||(p204!=1))" & FG!"((p114!=1)||(p229!=1))")
Detected timeout of ITS tools.
[2024-05-22 06:23:20] [INFO ] Flatten gal took : 17 ms
[2024-05-22 06:23:20] [INFO ] Applying decomposition
[2024-05-22 06:23:20] [INFO ] Flatten gal took : 16 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/graph3651548564299005060.txt' '-o' '/tmp/graph3651548564299005060.bin' '-w' '/tmp/graph3651548564299005060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3651548564299005060.bin' '-l' '-1' '-v' '-w' '/tmp/graph3651548564299005060.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:23:20] [INFO ] Decomposing Gal with order
[2024-05-22 06:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:23:20] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 06:23:20] [INFO ] Flatten gal took : 51 ms
[2024-05-22 06:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-22 06:23:20] [INFO ] Time to serialize gal into /tmp/LTL9807714225550029671.gal : 5 ms
[2024-05-22 06:23:20] [INFO ] Time to serialize properties into /tmp/LTL6866520929569978075.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/LTL9807714225550029671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6866520929569978075.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u12.p114!=1)||(u12.p229!=1))")||(G("((u2.p154!=1)||(u2.p204!=1))"))))))
Formula 0 simplified : G(F!"((u2.p154!=1)||(u2.p204!=1))" & FG!"((u12.p114!=1)||(u12.p229!=1))")
Detected timeout of ITS tools.
Treatment of property DES-PT-50a-LTLFireability-01 finished in 393009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G(p1)))))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 11 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 06:23:35] [INFO ] Invariant cache hit.
[2024-05-22 06:23:35] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 06:23:35] [INFO ] Invariant cache hit.
[2024-05-22 06:23:36] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 06:23:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:23:39] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:23:43] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-22 06:23:43] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:23:46] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:23:48] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:23:49] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20693 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:23:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:24:24] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-22 06:24:25] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50886ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50892ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51466 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50a-LTLFireability-03
Product exploration explored 100000 steps with 2230 reset in 260 ms.
Product exploration explored 100000 steps with 2255 reset in 283 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (880 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (250 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (191 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1089404 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 2
Probabilistic random walk after 1089404 steps, saw 154963 distinct states, run finished after 3001 ms. (steps per millisecond=363 ) properties seen :0
[2024-05-22 06:24:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 173/253 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/259 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 255/514 variables, 259/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/568 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:24:31] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 173/253 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/259 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 255/514 variables, 259/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 54/568 variables, 53/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:24:31] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:24:32] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 375 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1302ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2406 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (535 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (291 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (99 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 978149 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 2
Probabilistic random walk after 978149 steps, saw 138650 distinct states, run finished after 3003 ms. (steps per millisecond=325 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:24:37] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 06:24:37] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 173/262 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 254/516 variables, 262/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 50/566 variables, 50/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 375 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 173/262 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:24:38] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 254/516 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 50/566 variables, 50/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:24:38] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:24:39] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:24:39] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:24:39] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 382 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1542ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2388 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 06:24:41] [INFO ] Invariant cache hit.
[2024-05-22 06:24:42] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 06:24:42] [INFO ] Invariant cache hit.
[2024-05-22 06:24:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 06:24:42] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-22 06:24:42] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-22 06:24:42] [INFO ] Invariant cache hit.
[2024-05-22 06:24:42] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/566 variables, 312/372 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:24:53] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:24:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:24:53] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/566 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 378 constraints, problems are : Problem set: 0 solved, 253 unsolved in 21919 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:25:06] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:25:06] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:25:07] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:25:07] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:25:07] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 254/566 variables, 312/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 253/636 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 636 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 8/8 constraints]
After SMT, in 52122ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 52126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52649 ms. Remains : 312/312 places, 254/254 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:25:34] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 06:25:34] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:25:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-22 06:25:34] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 06:25:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:25:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 06:25:34] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 06:25:35] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:25:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
TRAPS : Iteration 1
[2024-05-22 06:25:35] [INFO ] After 459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 06:25:35] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 758 ms.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 06:25:35] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 06:25:36] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 06:25:36] [INFO ] Invariant cache hit.
[2024-05-22 06:25:36] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 06:25:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:25:39] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:25:43] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-22 06:25:43] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:25:46] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:25:48] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:25:50] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20880 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:26:00] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:26:25] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:26:25] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 51061ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51065ms
Finished structural reductions in LTL mode , in 1 iterations and 51579 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (885 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (255 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (173 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1042877 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 2
Probabilistic random walk after 1042877 steps, saw 148711 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
[2024-05-22 06:26:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 173/253 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/259 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 255/514 variables, 259/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/568 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:26:31] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 173/253 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/259 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 255/514 variables, 259/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 54/568 variables, 53/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:26:31] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:26:31] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 375 constraints, problems are : Problem set: 0 solved, 2 unsolved in 997 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1247ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2138 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 17 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (546 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (284 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (86 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 984217 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 2
Probabilistic random walk after 984217 steps, saw 139344 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:26:37] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 06:26:37] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 173/262 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 254/516 variables, 262/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 50/566 variables, 50/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 375 constraints, problems are : Problem set: 0 solved, 2 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 173/262 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:26:37] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 254/516 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 50/566 variables, 50/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:26:38] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-22 06:26:38] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:26:38] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:26:38] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 382 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1634ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2233 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 06:26:41] [INFO ] Invariant cache hit.
[2024-05-22 06:26:41] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 06:26:41] [INFO ] Invariant cache hit.
[2024-05-22 06:26:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 06:26:41] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-05-22 06:26:41] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-22 06:26:41] [INFO ] Invariant cache hit.
[2024-05-22 06:26:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/566 variables, 312/372 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:26:52] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-22 06:26:52] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:26:52] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/566 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 378 constraints, problems are : Problem set: 0 solved, 253 unsolved in 21604 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:27:05] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-22 06:27:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:27:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-22 06:27:06] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-22 06:27:06] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 254/566 variables, 312/380 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 253/636 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 636 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 8/8 constraints]
After SMT, in 51818ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 51821ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52350 ms. Remains : 312/312 places, 254/254 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:27:33] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 06:27:33] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 06:27:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 06:27:33] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 06:27:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:27:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 06:27:34] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 06:27:34] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:27:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 1
[2024-05-22 06:27:34] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 06:27:34] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 704 ms.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2233 reset in 205 ms.
Product exploration explored 100000 steps with 2238 reset in 226 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-22 06:27:35] [INFO ] Redundant transitions in 0 ms returned []
Running 255 sub problems to find dead transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 06:27:35] [INFO ] Computed 58 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:27:38] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:27:46] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:27:46] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/568 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:27:57] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 14 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 29145 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 255/631 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:28:20] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 632 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 7/7 constraints]
After SMT, in 59324ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 59327ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59345 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin10187963418366074384
[2024-05-22 06:28:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10187963418366074384
Running compilation step : cd /tmp/ltsmin10187963418366074384;'/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 525 ms.
Running link step : cd /tmp/ltsmin10187963418366074384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10187963418366074384;'/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/stateBased17542301203282510917.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 17 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-22 06:28:50] [INFO ] Invariant cache hit.
[2024-05-22 06:28:50] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 06:28:50] [INFO ] Invariant cache hit.
[2024-05-22 06:28:50] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 06:28:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:28:53] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:28:58] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:28:58] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:29:04] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20743 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:29:14] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:29:40] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:29:40] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50950ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50953ms
Finished structural reductions in LTL mode , in 1 iterations and 51442 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin17826524792315396308
[2024-05-22 06:29:41] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17826524792315396308
Running compilation step : cd /tmp/ltsmin17826524792315396308;'/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 535 ms.
Running link step : cd /tmp/ltsmin17826524792315396308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17826524792315396308;'/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/stateBased13374490152681453153.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 06:29:56] [INFO ] Flatten gal took : 17 ms
[2024-05-22 06:29:56] [INFO ] Flatten gal took : 15 ms
[2024-05-22 06:29:56] [INFO ] Time to serialize gal into /tmp/LTL13528882335681979539.gal : 2 ms
[2024-05-22 06:29:56] [INFO ] Time to serialize properties into /tmp/LTL9190185381644247606.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/LTL13528882335681979539.gal' '-t' 'CGAL' '-hoa' '/tmp/aut394921815873180616.hoa' '-atoms' '/tmp/LTL9190185381644247606.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/LTL9190185381644247606.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut394921815873180616.hoa
Detected timeout of ITS tools.
[2024-05-22 06:30:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:30:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:30:12] [INFO ] Time to serialize gal into /tmp/LTL7388026114542171822.gal : 3 ms
[2024-05-22 06:30:12] [INFO ] Time to serialize properties into /tmp/LTL299413433283378275.ltl : 15 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/LTL7388026114542171822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL299413433283378275.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...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(G("(((p14==0)||(p232==0))||(p234==0))")))||("((p185==1)&&(p204==1))"))))))
Formula 0 simplified : XXX(!"((p185==1)&&(p204==1))" & GF!"(((p14==0)||(p232==0))||(p234==0))")
Detected timeout of ITS tools.
[2024-05-22 06:30:27] [INFO ] Flatten gal took : 29 ms
[2024-05-22 06:30:27] [INFO ] Applying decomposition
[2024-05-22 06:30:27] [INFO ] Flatten gal took : 11 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/graph6193911702914580745.txt' '-o' '/tmp/graph6193911702914580745.bin' '-w' '/tmp/graph6193911702914580745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6193911702914580745.bin' '-l' '-1' '-v' '-w' '/tmp/graph6193911702914580745.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:30:27] [INFO ] Decomposing Gal with order
[2024-05-22 06:30:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:30:27] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-22 06:30:27] [INFO ] Flatten gal took : 45 ms
[2024-05-22 06:30:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 7 ms.
[2024-05-22 06:30:27] [INFO ] Time to serialize gal into /tmp/LTL3466182152894807673.gal : 3 ms
[2024-05-22 06:30:27] [INFO ] Time to serialize properties into /tmp/LTL6871293857538335116.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/LTL3466182152894807673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6871293857538335116.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(G("(((i3.u14.p14==0)||(i3.u14.p232==0))||(i3.u15.p234==0))")))||("((u2.p185==1)&&(u2.p204==1))"))))))
Formula 0 simplified : XXX(!"((u2.p185==1)&&(u2.p204==1))" & GF!"(((i3.u14.p14==0)||(i3.u14.p232==0))||(i3.u15.p234==0))")
Detected timeout of ITS tools.
Treatment of property DES-PT-50a-LTLFireability-03 finished in 426923 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((p0&&G(F(p1)))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 06:30:42] [INFO ] Invariant cache hit.
[2024-05-22 06:30:42] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 06:30:42] [INFO ] Invariant cache hit.
[2024-05-22 06:30:42] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 06:30:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:30:45] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:30:50] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:30:50] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:30:53] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:30:55] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:30:56] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20588 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:31:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:31:31] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-22 06:31:31] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50795ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50799ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51317 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-04
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-04 finished in 51556 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)||G(F(p1))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 17 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 06:31:33] [INFO ] Invariant cache hit.
[2024-05-22 06:31:34] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 06:31:34] [INFO ] Invariant cache hit.
[2024-05-22 06:31:34] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-22 06:31:34] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-22 06:31:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:31:37] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:31:41] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:31:42] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:31:45] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:31:47] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:31:48] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20757 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:31:58] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:32:23] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:32:23] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50930ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50933ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51471 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-05
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-05 finished in 51611 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 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 18 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 06:32:25] [INFO ] Invariant cache hit.
[2024-05-22 06:32:25] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 06:32:25] [INFO ] Invariant cache hit.
[2024-05-22 06:32:26] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-22 06:32:26] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-22 06:32:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:32:28] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:32:33] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:32:33] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:32:36] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:32:38] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:32:39] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20427 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:32:49] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:33:14] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:33:15] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50610ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50613ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51177 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-06
Product exploration explored 100000 steps with 2202 reset in 215 ms.
Product exploration explored 100000 steps with 2212 reset in 284 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 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)]
RANDOM walk for 266 steps (4 resets) in 5 ms. (44 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 86 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-22 06:33:17] [INFO ] Invariant cache hit.
[2024-05-22 06:33:17] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-22 06:33:17] [INFO ] Invariant cache hit.
[2024-05-22 06:33:18] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-22 06:33:18] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-22 06:33:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:33:21] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:33:25] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:33:25] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:33:28] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:33:30] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:33:32] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20915 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:33:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:34:07] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:34:08] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 51126ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51128ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51720 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 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 51 ms :[(NOT p0)]
RANDOM walk for 346 steps (7 resets) in 7 ms. (43 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 100 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2187 reset in 202 ms.
Product exploration explored 100000 steps with 2214 reset in 229 ms.
Built C files in :
/tmp/ltsmin13959108914466164039
[2024-05-22 06:34:10] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-22 06:34:10] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:34:10] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-22 06:34:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:34:10] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-22 06:34:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:34:10] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13959108914466164039
Running compilation step : cd /tmp/ltsmin13959108914466164039;'/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 691 ms.
Running link step : cd /tmp/ltsmin13959108914466164039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13959108914466164039;'/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/stateBased5264006710393108144.hoa' '--buchi-type=spotba'
LTSmin run took 1420 ms.
FORMULA DES-PT-50a-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50a-LTLFireability-06 finished in 106898 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||(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 15 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-22 06:34:12] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 06:34:12] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-22 06:34:12] [INFO ] Invariant cache hit.
[2024-05-22 06:34:13] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-05-22 06:34:13] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-22 06:34:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 257/570 variables, 313/684 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 06:34:22] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:34:22] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:34:22] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:34:22] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 688 constraints, problems are : Problem set: 0 solved, 256 unsolved in 21144 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 06:34:37] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:34:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 257/570 variables, 313/690 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 256/946 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 946 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 6/6 constraints]
After SMT, in 51311ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 51315ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52017 ms. Remains : 313/313 places, 257/257 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-08
Product exploration explored 100000 steps with 2247 reset in 214 ms.
Product exploration explored 100000 steps with 2229 reset in 230 ms.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 173 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (891 resets) in 434 ms. (91 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (187 resets) in 543 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (252 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (179 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
[2024-05-22 06:35:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/81 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 63/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 173/254 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 173/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/260 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 256/516 variables, 260/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 54/570 variables, 53/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/570 variables, 53/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/570 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/570 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 684 constraints, problems are : Problem set: 0 solved, 3 unsolved in 349 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/81 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 63/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 173/254 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 173/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/260 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 256/516 variables, 260/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 54/570 variables, 53/634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/570 variables, 53/687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/570 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/570 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/570 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 690 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3843 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 4202ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2711 ms.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 313 transition count 255
Applied a total of 7 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 313/313 places, 255/257 transitions.
RANDOM walk for 40000 steps (533 resets) in 623 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (84 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (287 resets) in 239 ms. (166 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (70 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 714356 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 3
Probabilistic random walk after 714356 steps, saw 102690 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
// Phase 1: matrix 255 rows 313 cols
[2024-05-22 06:35:16] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 06:35:16] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 72/90 variables, 31/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 72/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 173/263 variables, 24/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 173/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 255/518 variables, 263/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 50/568 variables, 50/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 50/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 689 constraints, problems are : Problem set: 0 solved, 3 unsolved in 301 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 72/90 variables, 31/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 72/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 173/263 variables, 24/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 173/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 255/518 variables, 263/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:35:16] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:35:16] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-22 06:35:17] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:35:17] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:35:17] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 5/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:35:17] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:35:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:35:17] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 50/568 variables, 50/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 50/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/568 variables, 3/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/568 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:35:21] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/568 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/568 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/568 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 701 constraints, problems are : Problem set: 0 solved, 3 unsolved in 13255 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 13573ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 4098 ms.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 313/313 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 06:35:33] [INFO ] Invariant cache hit.
[2024-05-22 06:35:34] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-22 06:35:34] [INFO ] Invariant cache hit.
[2024-05-22 06:35:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 06:35:35] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
[2024-05-22 06:35:35] [INFO ] Redundant transitions in 1 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-22 06:35:35] [INFO ] Invariant cache hit.
[2024-05-22 06:35:35] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 11/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/313 variables, 36/359 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/373 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 255/568 variables, 313/686 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 06:35:45] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 06:35:54] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:35:55] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:35:57] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:35:58] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 4/694 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/568 variables, and 694 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30022 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 11/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 36/359 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/373 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 5/378 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 06:36:07] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-22 06:36:08] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 06:36:08] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:36:10] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 255/568 variables, 313/695 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 3/698 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 254/952 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 952 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30016 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 9/9 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61655 ms. Remains : 313/313 places, 255/255 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 313 transition count 255
Applied a total of 1 rules in 11 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 255 rows 313 cols
[2024-05-22 06:36:35] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 06:36:35] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 06:36:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 06:36:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-22 06:36:36] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 06:36:36] [INFO ] After 1021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 06:36:37] [INFO ] After 1428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1537 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 12 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-22 06:36:37] [INFO ] Computed 58 invariants in 13 ms
[2024-05-22 06:36:37] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-22 06:36:37] [INFO ] Invariant cache hit.
[2024-05-22 06:36:38] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2024-05-22 06:36:38] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-22 06:36:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 257/570 variables, 313/684 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 06:36:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:36:47] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:36:47] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:36:47] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 688 constraints, problems are : Problem set: 0 solved, 256 unsolved in 21108 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 06:37:02] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:37:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 257/570 variables, 313/690 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 256/946 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 946 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30019 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 6/6 constraints]
After SMT, in 51283ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 51288ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52003 ms. Remains : 313/313 places, 257/257 transitions.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (889 resets) in 295 ms. (135 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (182 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (255 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (173 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
[2024-05-22 06:37:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/81 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 63/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 173/254 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 173/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/260 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 256/516 variables, 260/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 54/570 variables, 53/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/570 variables, 53/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/570 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/570 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 684 constraints, problems are : Problem set: 0 solved, 3 unsolved in 357 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/81 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 63/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 173/254 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 173/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/260 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 256/516 variables, 260/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 54/570 variables, 53/634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/570 variables, 53/687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/570 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/570 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/570 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 690 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3638 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 4003ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2748 ms.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 313 transition count 255
Applied a total of 7 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 313/313 places, 255/257 transitions.
RANDOM walk for 40000 steps (540 resets) in 571 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (81 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (293 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (58 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 715653 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 3
Probabilistic random walk after 715653 steps, saw 102869 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
// Phase 1: matrix 255 rows 313 cols
[2024-05-22 06:37:40] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 06:37:40] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 72/90 variables, 31/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 72/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 173/263 variables, 24/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 173/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 255/518 variables, 263/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 50/568 variables, 50/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 50/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 689 constraints, problems are : Problem set: 0 solved, 3 unsolved in 292 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 72/90 variables, 31/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 72/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 173/263 variables, 24/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 173/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 255/518 variables, 263/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:37:40] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:37:41] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:37:41] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 3 ms to minimize.
[2024-05-22 06:37:41] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-22 06:37:41] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 5/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:37:41] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:37:42] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:37:42] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 50/568 variables, 50/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 50/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/568 variables, 3/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/568 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:37:45] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/568 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/568 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/568 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 701 constraints, problems are : Problem set: 0 solved, 3 unsolved in 13238 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 13552ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 4746 ms.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 313/313 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 06:37:58] [INFO ] Invariant cache hit.
[2024-05-22 06:37:58] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-22 06:37:58] [INFO ] Invariant cache hit.
[2024-05-22 06:37:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 06:37:59] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2024-05-22 06:37:59] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-22 06:37:59] [INFO ] Invariant cache hit.
[2024-05-22 06:37:59] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 11/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/313 variables, 36/359 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/373 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 255/568 variables, 313/686 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 06:38:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 06:38:19] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-05-22 06:38:20] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-22 06:38:22] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:38:22] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 4/694 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/568 variables, and 694 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30018 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 11/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 36/359 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/373 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 5/378 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 06:38:32] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:38:33] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 06:38:33] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:38:35] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 255/568 variables, 313/695 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 3/698 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 254/952 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 952 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30022 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 9/9 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61620 ms. Remains : 313/313 places, 255/255 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 313 transition count 255
Applied a total of 1 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 255 rows 313 cols
[2024-05-22 06:39:00] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 06:39:00] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 06:39:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:39:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-22 06:39:01] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 06:39:01] [INFO ] After 1037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 06:39:01] [INFO ] After 1453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1559 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 12 factoid took 232 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 2222 reset in 207 ms.
Product exploration explored 100000 steps with 2234 reset in 231 ms.
Built C files in :
/tmp/ltsmin4017403754706479526
[2024-05-22 06:39:02] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-22 06:39:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:39:02] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-22 06:39:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:39:02] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-22 06:39:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:39:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4017403754706479526
Running compilation step : cd /tmp/ltsmin4017403754706479526;'/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 692 ms.
Running link step : cd /tmp/ltsmin4017403754706479526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4017403754706479526;'/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/stateBased12562730212537737457.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-22 06:39:17] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 06:39:18] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-22 06:39:18] [INFO ] Invariant cache hit.
[2024-05-22 06:39:18] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-22 06:39:18] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-22 06:39:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 257/570 variables, 313/684 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 06:39:27] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:39:27] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:39:27] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:39:27] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/570 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 688 constraints, problems are : Problem set: 0 solved, 256 unsolved in 20994 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/371 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 06:39:42] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:39:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 257/570 variables, 313/690 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 256/946 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 946 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 6/6 constraints]
After SMT, in 51160ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 51164ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51855 ms. Remains : 313/313 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin8454119356784536675
[2024-05-22 06:40:09] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-22 06:40:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:40:09] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-22 06:40:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:40:09] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-22 06:40:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:40:09] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8454119356784536675
Running compilation step : cd /tmp/ltsmin8454119356784536675;'/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 665 ms.
Running link step : cd /tmp/ltsmin8454119356784536675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8454119356784536675;'/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/stateBased8975884261714953603.hoa' '--buchi-type=spotba'
LTSmin run took 3250 ms.
FORMULA DES-PT-50a-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50a-LTLFireability-08 finished in 361224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 13 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 06:40:13] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 06:40:13] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 06:40:13] [INFO ] Invariant cache hit.
[2024-05-22 06:40:14] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 06:40:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:40:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:40:21] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:40:21] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:40:24] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:40:26] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:40:28] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20732 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:40:38] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:41:03] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:41:03] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50954ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50958ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51483 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50a-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 374 ms.
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLFireability-11 finished in 52412 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||X(X((X(G(p2))&&p1))))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 11 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 06:41:06] [INFO ] Invariant cache hit.
[2024-05-22 06:41:06] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 06:41:06] [INFO ] Invariant cache hit.
[2024-05-22 06:41:06] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 06:41:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:41:14] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:41:14] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:41:17] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:41:19] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:41:20] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20429 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:41:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:41:55] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:41:55] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50596ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50599ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51104 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DES-PT-50a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-12 finished in 51298 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)||X(G(p1))))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 06:41:57] [INFO ] Invariant cache hit.
[2024-05-22 06:41:57] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 06:41:57] [INFO ] Invariant cache hit.
[2024-05-22 06:41:57] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 06:41:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:42:00] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:42:05] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:42:05] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:42:08] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:42:10] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:42:11] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20299 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:42:21] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50496ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50499ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51015 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-13
Product exploration explored 100000 steps with 2242 reset in 213 ms.
Product exploration explored 100000 steps with 2203 reset in 224 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 131 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (880 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (199 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1534182 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :0 out of 1
Probabilistic random walk after 1534182 steps, saw 213344 distinct states, run finished after 3001 ms. (steps per millisecond=511 ) properties seen :0
[2024-05-22 06:42:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/79 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/253 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/259 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/514 variables, 259/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/568 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/79 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/253 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/259 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/514 variables, 259/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/568 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 284 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 312 transition count 254
Applied a total of 8 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (513 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (103 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1513357 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :0 out of 1
Probabilistic random walk after 1513357 steps, saw 211580 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:42:56] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 06:42:56] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/85 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/262 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 254/516 variables, 262/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 50/566 variables, 50/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/85 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/262 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 254/516 variables, 262/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 50/566 variables, 50/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 246 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 06:42:57] [INFO ] Invariant cache hit.
[2024-05-22 06:42:57] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 06:42:57] [INFO ] Invariant cache hit.
[2024-05-22 06:42:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 06:42:57] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-22 06:42:57] [INFO ] Redundant transitions in 0 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-22 06:42:57] [INFO ] Invariant cache hit.
[2024-05-22 06:42:57] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/566 variables, 312/372 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:43:06] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/566 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 376 constraints, problems are : Problem set: 0 solved, 253 unsolved in 19607 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 254/566 variables, 312/376 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 253/632 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:43:34] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:43:37] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:43:44] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:43:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:43:44] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 637 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 9/9 constraints]
After SMT, in 49808ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 49819ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50373 ms. Remains : 312/312 places, 254/254 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:43:47] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 06:43:47] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 06:43:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 06:43:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 06:43:47] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 06:43:47] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 06:43:47] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 378 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p1)]
Support contains 4 out of 312 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 06:43:48] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 06:43:48] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 06:43:48] [INFO ] Invariant cache hit.
[2024-05-22 06:43:48] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-22 06:43:48] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-22 06:43:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:43:51] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:43:56] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:43:56] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:44:01] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:44:02] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20780 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:44:12] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:44:37] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:44:37] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50945ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50948ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51478 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 39 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (881 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (189 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1613950 steps, run timeout after 3001 ms. (steps per millisecond=537 ) properties seen :0 out of 1
Probabilistic random walk after 1613950 steps, saw 222861 distinct states, run finished after 3002 ms. (steps per millisecond=537 ) properties seen :0
[2024-05-22 06:44:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/79 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/253 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/259 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/514 variables, 259/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/568 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/79 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/253 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/259 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/514 variables, 259/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/568 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 514ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 272 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 312 transition count 254
Applied a total of 8 rules in 23 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (517 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (97 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1492556 steps, run timeout after 3001 ms. (steps per millisecond=497 ) properties seen :0 out of 1
Probabilistic random walk after 1492556 steps, saw 208145 distinct states, run finished after 3001 ms. (steps per millisecond=497 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:44:46] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 06:44:46] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/85 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/262 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 254/516 variables, 262/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 50/566 variables, 50/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/85 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/262 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 254/516 variables, 262/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 50/566 variables, 50/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 559ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 272 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 06:44:47] [INFO ] Invariant cache hit.
[2024-05-22 06:44:47] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 06:44:47] [INFO ] Invariant cache hit.
[2024-05-22 06:44:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 06:44:47] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-22 06:44:47] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-22 06:44:47] [INFO ] Invariant cache hit.
[2024-05-22 06:44:47] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/566 variables, 312/372 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:44:56] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/566 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 376 constraints, problems are : Problem set: 0 solved, 253 unsolved in 19893 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:45:09] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 4 ms to minimize.
[2024-05-22 06:45:10] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:45:11] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 254/566 variables, 312/376 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 253/632 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 06:45:24] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:45:28] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 637 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 9/9 constraints]
After SMT, in 50092ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 50094ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50637 ms. Remains : 312/312 places, 254/254 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 06:45:38] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 06:45:38] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 06:45:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 06:45:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 06:45:38] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 06:45:38] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 06:45:38] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 418 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 53 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 2237 reset in 223 ms.
Product exploration explored 100000 steps with 2235 reset in 237 ms.
Built C files in :
/tmp/ltsmin15379521125721672480
[2024-05-22 06:45:39] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-22 06:45:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:45:39] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-22 06:45:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:45:39] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-22 06:45:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:45:39] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15379521125721672480
Running compilation step : cd /tmp/ltsmin15379521125721672480;'/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 684 ms.
Running link step : cd /tmp/ltsmin15379521125721672480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15379521125721672480;'/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/stateBased9787821755977303793.hoa' '--buchi-type=spotba'
LTSmin run took 8705 ms.
FORMULA DES-PT-50a-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50a-LTLFireability-13 finished in 231341 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))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 10 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 06:45:48] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 06:45:48] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 06:45:48] [INFO ] Invariant cache hit.
[2024-05-22 06:45:49] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 06:45:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:45:52] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:45:56] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-22 06:45:56] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:45:59] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:46:01] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:46:02] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20853 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:46:13] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:46:38] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:46:38] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 51062ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51065ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51590 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-14
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-14 finished in 51718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||p0) U (!p1 U (p2 U !p3)))))'
Support contains 9 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 06:46:40] [INFO ] Invariant cache hit.
[2024-05-22 06:46:40] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 06:46:40] [INFO ] Invariant cache hit.
[2024-05-22 06:46:40] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 06:46:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:46:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/568 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:46:48] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:46:48] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:46:51] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:46:53] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:46:54] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 376 constraints, problems are : Problem set: 0 solved, 255 unsolved in 20371 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:47:04] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/568 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 255/632 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 06:47:29] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:47:29] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 634 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 9/9 constraints]
After SMT, in 50543ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50545ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51044 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 280 ms :[p3, p3, (NOT p1), p3, (AND (NOT p1) p3), true, p3]
Running random walk in product with property : DES-PT-50a-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Product exploration explored 100000 steps with 50000 reset in 370 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND p3 p2 p1 (NOT p0)))), (X (NOT (OR (AND p3 p1) (AND p3 p0)))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND p3 p2 p1 p0)))), (X (X (NOT (AND p3 p2 p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p3 p1) (AND p3 p0))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 26 factoid took 23 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLFireability-15 finished in 52101 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(p1)||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(X(X((p0||F(G(p1)))))))'
[2024-05-22 06:47:32] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12874966836392731503
[2024-05-22 06:47:32] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-22 06:47:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:47:32] [INFO ] Applying decomposition
[2024-05-22 06:47:32] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-22 06:47:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:47:32] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:47:32] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-22 06:47:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:47:32] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12874966836392731503
Running compilation step : cd /tmp/ltsmin12874966836392731503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
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/graph5985398974357019220.txt' '-o' '/tmp/graph5985398974357019220.bin' '-w' '/tmp/graph5985398974357019220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5985398974357019220.bin' '-l' '-1' '-v' '-w' '/tmp/graph5985398974357019220.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:47:32] [INFO ] Decomposing Gal with order
[2024-05-22 06:47:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:47:32] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 06:47:32] [INFO ] Flatten gal took : 15 ms
[2024-05-22 06:47:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 06:47:32] [INFO ] Time to serialize gal into /tmp/LTLFireability17979013892824206651.gal : 3 ms
[2024-05-22 06:47:32] [INFO ] Time to serialize properties into /tmp/LTLFireability136929443343490124.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/LTLFireability17979013892824206651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability136929443343490124.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 2 LTL properties
Checking formula 0 : !((G(F(("((u13.p114!=1)||(u13.p229!=1))")||(G("((u2.p154!=1)||(u2.p204!=1))"))))))
Formula 0 simplified : G(F!"((u2.p154!=1)||(u2.p204!=1))" & FG!"((u13.p114!=1)||(u13.p229!=1))")
Compilation finished in 696 ms.
Running link step : cd /tmp/ltsmin12874966836392731503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12874966836392731503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t216, t217, t250, u2.t8, u2.t110, u2.t114, u2.t115, u2.t116, u2.t117, u2.t118, u2.t119, u...752
Computing Next relation with stutter on 6.30884e+06 deadlock states
60 unique states visited
0 strongly connected components in search stack
118 transitions explored
60 items max in DFS search stack
8683 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,86.8751,1551644,1,0,3.33775e+06,224494,2526,4.81388e+06,5588,1.44392e+06,4406403
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-50a-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(("((u2.p185==1)&&(u2.p204==1))")||(F(G("(((u14.p14==0)||(u14.p232==0))||(u14.p234==0))"))))))))
Formula 1 simplified : XXX(!"((u2.p185==1)&&(u2.p204==1))" & GF!"(((u14.p14==0)||(u14.p232==0))||(u14.p234==0))")
Computing Next relation with stutter on 6.30884e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: Initializing POR dependencies: labels 261, guards 257
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.673: LTL layer: formula: [](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 6/ 8), 0.673: "[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.674: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.778: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.797: There are 262 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.797: State length is 314, there are 263 groups
pins2lts-mc-linux64( 0/ 8), 0.797: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.797: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.797: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.797: Visible groups: 0 / 263, labels: 2 / 262
pins2lts-mc-linux64( 0/ 8), 0.797: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.797: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.829: [Blue] ~35 levels ~960 states ~2000 transitions
pins2lts-mc-linux64( 5/ 8), 0.852: [Blue] ~43 levels ~1920 states ~3504 transitions
pins2lts-mc-linux64( 4/ 8), 0.903: [Blue] ~313 levels ~3840 states ~6056 transitions
pins2lts-mc-linux64( 4/ 8), 0.974: [Blue] ~608 levels ~7680 states ~11784 transitions
pins2lts-mc-linux64( 4/ 8), 1.114: [Blue] ~1197 levels ~15360 states ~23296 transitions
pins2lts-mc-linux64( 1/ 8), 1.348: [Blue] ~504 levels ~30720 states ~42832 transitions
pins2lts-mc-linux64( 1/ 8), 1.742: [Blue] ~926 levels ~61440 states ~84776 transitions
pins2lts-mc-linux64( 1/ 8), 2.578: [Blue] ~1814 levels ~122880 states ~168152 transitions
pins2lts-mc-linux64( 4/ 8), 4.193: [Blue] ~4884 levels ~245760 states ~335896 transitions
pins2lts-mc-linux64( 4/ 8), 6.819: [Blue] ~8006 levels ~491520 states ~662424 transitions
pins2lts-mc-linux64( 4/ 8), 11.948: [Blue] ~8266 levels ~983040 states ~1297184 transitions
pins2lts-mc-linux64( 4/ 8), 21.575: [Blue] ~8266 levels ~1966080 states ~2567496 transitions
pins2lts-mc-linux64( 4/ 8), 40.562: [Blue] ~8266 levels ~3932160 states ~5120312 transitions
pins2lts-mc-linux64( 4/ 8), 78.601: [Blue] ~8266 levels ~7864320 states ~10562912 transitions
pins2lts-mc-linux64( 4/ 8), 157.227: [Blue] ~8266 levels ~15728640 states ~21982344 transitions
pins2lts-mc-linux64( 5/ 8), 311.140: [Blue] ~454 levels ~31457280 states ~52051808 transitions
pins2lts-mc-linux64( 2/ 8), 335.989: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 336.144:
pins2lts-mc-linux64( 0/ 8), 336.144: Explored 29734066 states 41411577 transitions, fanout: 1.393
pins2lts-mc-linux64( 0/ 8), 336.144: Total exploration time 335.330 sec (335.170 sec minimum, 335.210 sec on average)
pins2lts-mc-linux64( 0/ 8), 336.144: States per second: 88671, Transitions per second: 123495
pins2lts-mc-linux64( 0/ 8), 336.144:
pins2lts-mc-linux64( 0/ 8), 336.144: State space has 29484423 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 336.144: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 336.144: blue states: 29734066 (100.85%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 336.144: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 336.144: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 336.144:
pins2lts-mc-linux64( 0/ 8), 336.144: Total memory used for local state coloring: 3.5MB
pins2lts-mc-linux64( 0/ 8), 336.144:
pins2lts-mc-linux64( 0/ 8), 336.144: Queue width: 8B, total height: 231809, memory: 1.77MB
pins2lts-mc-linux64( 0/ 8), 336.144: Tree memory: 480.9MB, 17.1 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 336.144: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 336.144: Stored 261 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 336.144: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 336.144: Est. total memory use: 482.7MB (~1025.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12874966836392731503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12874966836392731503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(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:114)
at java.base/java.lang.Thread.run(Thread.java:840)
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
68574 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,772.617,3143560,1,0,7.35336e+06,226787,606,6.28807e+06,1493,1.46826e+06,3838145
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DES-PT-50a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2982711 ms.

BK_STOP 1716361429111

--------------------
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="DES-PT-50a"
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 DES-PT-50a, 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 r092-tall-171624189900732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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