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.r091-tall-171624188300732.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 greatspnxred
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 r091-tall-171624188300732
=====================================================================

--------------------
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 1716325415049

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 21:03:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 21:03:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:03:36] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-21 21:03:36] [INFO ] Transformed 314 places.
[2024-05-21 21:03:36] [INFO ] Transformed 271 transitions.
[2024-05-21 21:03:36] [INFO ] Found NUPN structural information;
[2024-05-21 21:03:36] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 191 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-21 21:03:36] [INFO ] Computed 59 invariants in 27 ms
[2024-05-21 21:03:37] [INFO ] Implicit Places using invariants in 433 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 464 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 16 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 548 ms. Remains : 313/314 places, 257/257 transitions.
Support contains 44 out of 313 places after structural reductions.
[2024-05-21 21:03:37] [INFO ] Flatten gal took : 57 ms
[2024-05-21 21:03:37] [INFO ] Flatten gal took : 28 ms
[2024-05-21 21:03:37] [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 (895 resets) in 2332 ms. (17 steps per ms) remains 18/27 properties
BEST_FIRST walk for 4004 steps (17 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (18 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (26 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (18 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (23 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (18 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (20 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (18 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (19 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
// Phase 1: matrix 257 rows 313 cols
[2024-05-21 21:03:38] [INFO ] Computed 58 invariants in 16 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-21 21:03:41] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 21 ms to minimize.
[2024-05-21 21:03:41] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 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-21 21:03:44] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-21 21:03:44] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 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-21 21:03:46] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:03:46] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 3 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 5008 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 10157ms 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 53 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 54 ms. Remains : 312/313 places, 254/257 transitions.
RANDOM walk for 40000 steps (540 resets) in 674 ms. (59 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (27 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (26 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (10 resets) in 44 ms. (88 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (13 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 529928 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 17
Probabilistic random walk after 529928 steps, saw 75964 distinct states, run finished after 3004 ms. (steps per millisecond=176 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:03:52] [INFO ] Computed 60 invariants in 5 ms
[2024-05-21 21:03:52] [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-21 21:03:53] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:03:53] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-05-21 21:03:53] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:03:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 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-21 21:03:54] [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 3753 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-21 21:04:04] [INFO ] Deduced a trap composed of 9 places in 67 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-21 21:04:19] [INFO ] Deduced a trap composed of 12 places in 79 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-21 21:04:31] [INFO ] Deduced a trap composed of 11 places in 59 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
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 566/566 variables, and 399 constraints, problems are : Problem set: 0 solved, 17 unsolved in 45012 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 48809ms 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 13 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 13 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-21 21:04:40] [INFO ] Invariant cache hit.
[2024-05-21 21:04:41] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 21:04:41] [INFO ] Invariant cache hit.
[2024-05-21 21:04:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:04:41] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-21 21:04:41] [INFO ] Redundant transitions in 13 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:04:41] [INFO ] Invariant cache hit.
[2024-05-21 21:04:41] [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-21 21:04:48] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:04:48] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-21 21:04:49] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-21 21:04:49] [INFO ] Deduced a trap composed of 13 places in 59 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-21 21:04:52] [INFO ] Deduced a trap composed of 13 places in 61 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-21 21:05:00] [INFO ] Deduced a trap composed of 15 places in 47 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 28877 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-21 21:05:12] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:05:13] [INFO ] Deduced a trap composed of 12 places in 33 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-21 21:05:15] [INFO ] Deduced a trap composed of 6 places in 24 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-21 21:05:16] [INFO ] Deduced a trap composed of 8 places in 31 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 30025 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 59116ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 59121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59652 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 19 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:05:40] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 21:05:41] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-21 21:05:41] [INFO ] Invariant cache hit.
[2024-05-21 21:05:41] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2024-05-21 21:05:41] [INFO ] Redundant transitions in 14 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:05:41] [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-21 21:05:44] [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-21 21:05:49] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:05:49] [INFO ] Deduced a trap composed of 12 places in 48 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-21 21:05:52] [INFO ] Deduced a trap composed of 11 places in 86 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-21 21:05:54] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:05:55] [INFO ] Deduced a trap composed of 12 places in 52 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 21369 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-21 21:06:06] [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-21 21:06:31] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 17 places in 75 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 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 51616ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51619ms
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 52385 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-00
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 3 ms.
FORMULA DES-PT-50a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-00 finished in 52596 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 20 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:06:33] [INFO ] Invariant cache hit.
[2024-05-21 21:06:33] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 21:06:33] [INFO ] Invariant cache hit.
[2024-05-21 21:06:33] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-21 21:06:33] [INFO ] Redundant transitions in 4 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:06:33] [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-21 21:06:36] [INFO ] Deduced a trap composed of 13 places in 37 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-21 21:06:41] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:06:41] [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-21 21:06:44] [INFO ] Deduced a trap composed of 11 places in 80 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-21 21:06:46] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:06:48] [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 21111 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-21 21:06:58] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 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-21 21:07:23] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:07:23] [INFO ] Deduced a trap composed of 17 places in 81 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 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 51323ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51326ms
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 51906 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 133 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 2238 reset in 341 ms.
Product exploration explored 100000 steps with 2231 reset in 286 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 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (901 resets) in 1194 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (223 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (203 resets) in 400 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (204 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (248 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 552503 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 4
Probabilistic random walk after 552503 steps, saw 89269 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-05-21 21:07:30] [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 539 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-21 21:07:31] [INFO ] Deduced a trap composed of 18 places in 94 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 1296 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 1855ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5828 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 24 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 24 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (542 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (269 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (99 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (80 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (289 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 809620 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 4
Probabilistic random walk after 809620 steps, saw 115638 distinct states, run finished after 3002 ms. (steps per millisecond=269 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:07:40] [INFO ] Computed 60 invariants in 8 ms
[2024-05-21 21:07:40] [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-21 21:07:41] [INFO ] Deduced a trap composed of 7 places in 29 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 418 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-21 21:07:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 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 914 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 1355ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6488 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 9 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 9 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-21 21:07:48] [INFO ] Invariant cache hit.
[2024-05-21 21:07:48] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 21:07:48] [INFO ] Invariant cache hit.
[2024-05-21 21:07:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:07:49] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2024-05-21 21:07:49] [INFO ] Redundant transitions in 2 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:07:49] [INFO ] Invariant cache hit.
[2024-05-21 21:07:49] [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-21 21:07:56] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:07:56] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:07:56] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:07:57] [INFO ] Deduced a trap composed of 13 places in 59 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-21 21:08:00] [INFO ] Deduced a trap composed of 13 places in 71 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-21 21:08:08] [INFO ] Deduced a trap composed of 15 places in 50 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 29567 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-21 21:08:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:08:22] [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-21 21:08:24] [INFO ] Deduced a trap composed of 6 places in 29 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-21 21:08:25] [INFO ] Deduced a trap composed of 8 places in 33 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 30012 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 59772ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 59780ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60385 ms. Remains : 312/312 places, 254/254 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 21:08:49] [INFO ] Invariant cache hit.
[2024-05-21 21:08:49] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:08:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2024-05-21 21:08:49] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 21:08:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:08:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-21 21:08:49] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 21:08:49] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 21:08:50] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 879 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 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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-21 21:08:50] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 21:08:50] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 21:08:50] [INFO ] Invariant cache hit.
[2024-05-21 21:08:50] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-21 21:08:50] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:08: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-21 21:08:53] [INFO ] Deduced a trap composed of 13 places in 35 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-21 21:08:58] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:08:58] [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-21 21:09:01] [INFO ] Deduced a trap composed of 11 places in 72 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-21 21:09:03] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 21:09:04] [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 20919 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-21 21:09: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-21 21:09:40] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:09:40] [INFO ] Deduced a trap composed of 17 places in 87 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 30027 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 51136ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51659 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 182 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (880 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (223 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (203 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (206 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (252 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 670961 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 4
Probabilistic random walk after 670961 steps, saw 104371 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
[2024-05-21 21:09:45] [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 458 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-21 21:09:46] [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 1103 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 1581ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5954 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 19 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 19 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (523 resets) in 437 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (272 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (288 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 739404 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 4
Probabilistic random walk after 739404 steps, saw 106230 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:09:56] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 21:09:56] [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-21 21:09:56] [INFO ] Deduced a trap composed of 7 places in 35 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 422 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-21 21:09:56] [INFO ] Deduced a trap composed of 8 places in 26 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 925 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 1364ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7719 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 21 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 21 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-21 21:10:05] [INFO ] Invariant cache hit.
[2024-05-21 21:10:05] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 21:10:05] [INFO ] Invariant cache hit.
[2024-05-21 21:10:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:10:06] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2024-05-21 21:10:06] [INFO ] Redundant transitions in 0 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:10:06] [INFO ] Invariant cache hit.
[2024-05-21 21:10:06] [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-21 21:10:13] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:10:13] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:10:14] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:10:14] [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-21 21:10:17] [INFO ] Deduced a trap composed of 13 places in 58 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-21 21:10:25] [INFO ] Deduced a trap composed of 15 places in 49 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 29870 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-21 21:10:37] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:10:39] [INFO ] Deduced a trap composed of 12 places in 39 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-21 21:10:41] [INFO ] Deduced a trap composed of 6 places in 25 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-21 21:10:42] [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
[2024-05-21 21:11:02] [INFO ] Deduced a trap composed of 8 places in 67 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 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: 11/11 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60714 ms. Remains : 312/312 places, 254/254 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 21:11:06] [INFO ] Invariant cache hit.
[2024-05-21 21:11:06] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:11:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-21 21:11:06] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 21:11:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:11:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-21 21:11:06] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 21:11:06] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 21:11:07] [INFO ] After 709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 849 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 160 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2230 reset in 231 ms.
Product exploration explored 100000 steps with 2233 reset in 278 ms.
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 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:11:08] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 21:11:08] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 21:11:08] [INFO ] Invariant cache hit.
[2024-05-21 21:11:08] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-21 21:11:08] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:11:08] [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-21 21:11:11] [INFO ] Deduced a trap composed of 13 places in 40 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-21 21:11:16] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:11:16] [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-21 21:11:19] [INFO ] Deduced a trap composed of 11 places in 61 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-21 21:11:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-21 21:11:22] [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 20828 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-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 34 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-21 21:11:58] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:11:58] [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 30064 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 51082ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51086ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51629 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-01 finished in 326471 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 10 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:11:59] [INFO ] Invariant cache hit.
[2024-05-21 21:12:00] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-21 21:12:00] [INFO ] Invariant cache hit.
[2024-05-21 21:12:00] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:12:00] [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-21 21:12:03] [INFO ] Deduced a trap composed of 13 places in 37 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-21 21:12:08] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:12:08] [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-21 21:12:11] [INFO ] Deduced a trap composed of 11 places in 75 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-21 21:12:13] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:12:15] [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 21490 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-21 21:12:25] [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-21 21:12:50] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:12:50] [INFO ] Deduced a trap composed of 17 places in 84 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 30020 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 51705ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51708ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52487 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 212 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 2206 reset in 232 ms.
Product exploration explored 100000 steps with 2200 reset in 244 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 89 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 235 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 (891 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (251 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (188 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 933864 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :0 out of 2
Probabilistic random walk after 933864 steps, saw 135375 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
[2024-05-21 21:12:56] [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 250 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-21 21:12:56] [INFO ] Deduced a trap composed of 11 places in 29 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-21 21:12:57] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:12:57] [INFO ] Deduced a trap composed of 12 places in 54 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 1020 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 1277ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2703 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 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 27 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (540 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (291 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (95 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 928822 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :0 out of 2
Probabilistic random walk after 928822 steps, saw 132155 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:13:03] [INFO ] Computed 60 invariants in 9 ms
[2024-05-21 21:13:03] [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 244 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-21 21:13:03] [INFO ] Deduced a trap composed of 11 places in 72 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-21 21:13:04] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:13:04] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:13:04] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:13:04] [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 1296 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 1557ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3111 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 6 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 6 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 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-21 21:13:08] [INFO ] Invariant cache hit.
[2024-05-21 21:13:08] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 21:13:08] [INFO ] Invariant cache hit.
[2024-05-21 21:13:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 21:13:08] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-21 21:13:08] [INFO ] Redundant transitions in 2 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:13:08] [INFO ] Invariant cache hit.
[2024-05-21 21:13:08] [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-21 21:13:19] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 18 places in 66 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 22179 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-21 21:13:32] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 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 30011 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 52372ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 52376ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52887 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 16 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-21 21:14:01] [INFO ] Computed 60 invariants in 10 ms
[2024-05-21 21:14:01] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:14:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-21 21:14:01] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:14:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 21:14:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-21 21:14:01] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:14:01] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:14:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 1
[2024-05-21 21:14:01] [INFO ] After 430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:14:01] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 736 ms.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 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 228 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 196 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 6 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:14:02] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 21:14:02] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 21:14:02] [INFO ] Invariant cache hit.
[2024-05-21 21:14:02] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:14:02] [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-21 21:14:05] [INFO ] Deduced a trap composed of 13 places in 39 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-21 21:14:10] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:14:10] [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-21 21:14: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-21 21:14:15] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:14:16] [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 21135 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-21 21:14:27] [INFO ] Deduced a trap composed of 9 places in 34 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-21 21:14:52] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:14:52] [INFO ] Deduced a trap composed of 17 places in 80 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 51338ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51342ms
Finished structural reductions in LTL mode , in 1 iterations and 51834 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 90 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 209 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 (904 resets) in 405 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (259 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (182 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 957189 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :0 out of 2
Probabilistic random walk after 957189 steps, saw 137890 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
[2024-05-21 21:14:57] [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 266 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-21 21:14:58] [INFO ] Deduced a trap composed of 11 places in 30 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-21 21:14:58] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:14:58] [INFO ] Deduced a trap composed of 12 places in 54 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 1036 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 1311ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2665 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 (550 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (290 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1027794 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 2
Probabilistic random walk after 1027794 steps, saw 145186 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:15:05] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 21:15:05] [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 271 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-21 21:15:05] [INFO ] Deduced a trap composed of 11 places in 68 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-21 21:15:05] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:15:06] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-21 21:15:06] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:15:06] [INFO ] Deduced a trap composed of 16 places in 63 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 1286 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 1574ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3161 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 14 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 14 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 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-21 21:15:09] [INFO ] Invariant cache hit.
[2024-05-21 21:15:09] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 21:15:09] [INFO ] Invariant cache hit.
[2024-05-21 21:15:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 21:15:10] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-21 21:15:10] [INFO ] Redundant transitions in 2 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:15:10] [INFO ] Invariant cache hit.
[2024-05-21 21:15:10] [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-21 21:15:21] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:15:21] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:15:21] [INFO ] Deduced a trap composed of 18 places in 93 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 22514 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-21 21:15:34] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:15:34] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 8 places in 38 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 30022 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 52722ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 52726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53278 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-21 21:16:03] [INFO ] Computed 60 invariants in 8 ms
[2024-05-21 21:16:03] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:16:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-21 21:16:03] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:16:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:16:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2024-05-21 21:16:03] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:16:03] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:16:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
TRAPS : Iteration 1
[2024-05-21 21:16:03] [INFO ] After 434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:16:03] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 744 ms.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 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 225 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 205 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 196 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 2245 reset in 209 ms.
Product exploration explored 100000 steps with 2236 reset in 233 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 197 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 27 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 21:16:05] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:16:05] [INFO ] Computed 58 invariants in 4 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-21 21:16:08] [INFO ] Deduced a trap composed of 13 places in 39 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
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/568 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:16:19] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 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-21 21:16:24] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/568 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-21 21:16:27] [INFO ] Deduced a trap composed of 18 places in 64 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 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: 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-21 21:16:50] [INFO ] Deduced a trap composed of 12 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 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 60201ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60241 ms. Remains : 312/312 places, 256/256 transitions.
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 7 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 21:17:05] [INFO ] Invariant cache hit.
[2024-05-21 21:17:05] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 21:17:05] [INFO ] Invariant cache hit.
[2024-05-21 21:17:06] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:17: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-21 21:17:09] [INFO ] Deduced a trap composed of 13 places in 48 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-21 21:17:13] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:17:13] [INFO ] Deduced a trap composed of 12 places in 43 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-21 21:17:17] [INFO ] Deduced a trap composed of 11 places in 65 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-21 21:17:19] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-21 21:17:20] [INFO ] Deduced a trap composed of 12 places in 51 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 21114 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-21 21:17:30] [INFO ] Deduced a trap composed of 9 places in 31 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-21 21:17:55] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:17:55] [INFO ] Deduced a trap composed of 17 places in 82 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 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 51308ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51313ms
Finished structural reductions in LTL mode , in 1 iterations and 51877 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-03 finished in 357690 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 21 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:17:57] [INFO ] Invariant cache hit.
[2024-05-21 21:17:57] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-21 21:17:57] [INFO ] Invariant cache hit.
[2024-05-21 21:17:58] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:17:58] [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-21 21:18:01] [INFO ] Deduced a trap composed of 13 places in 37 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-21 21:18:06] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:18:06] [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-21 21:18:09] [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-21 21:18:11] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-21 21:18:12] [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 21727 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-21 21:18:23] [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-21 21:18:48] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:18:48] [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 51927ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51930ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52587 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 197 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 44 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 52810 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 18 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:18:50] [INFO ] Invariant cache hit.
[2024-05-21 21:18:50] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 21:18:50] [INFO ] Invariant cache hit.
[2024-05-21 21:18:50] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-05-21 21:18:50] [INFO ] Redundant transitions in 2 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:18: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-21 21:18:53] [INFO ] Deduced a trap composed of 13 places in 36 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-21 21:18:58] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:18:58] [INFO ] Deduced a trap composed of 12 places in 52 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-21 21:19:01] [INFO ] Deduced a trap composed of 11 places in 82 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-21 21:19:03] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:19:04] [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 21169 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-21 21:19:15] [INFO ] Deduced a trap composed of 9 places in 35 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-21 21:19:41] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:19:41] [INFO ] Deduced a trap composed of 17 places in 75 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 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 51387ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51391ms
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 51924 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 102 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 44 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-05 finished in 52048 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 12 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:19:42] [INFO ] Invariant cache hit.
[2024-05-21 21:19:42] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 21:19:42] [INFO ] Invariant cache hit.
[2024-05-21 21:19:42] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-21 21:19:42] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:19: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-21 21:19:45] [INFO ] Deduced a trap composed of 13 places in 39 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-21 21:19:50] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:19:50] [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-21 21:19:53] [INFO ] Deduced a trap composed of 11 places in 82 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-21 21:19:55] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:19:56] [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 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-21 21:20:07] [INFO ] Deduced a trap composed of 9 places in 46 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-21 21:20:32] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-21 21:20:32] [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 30009 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 51111ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51113ms
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 51683 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-06
Product exploration explored 100000 steps with 2222 reset in 202 ms.
Product exploration explored 100000 steps with 2208 reset in 292 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 94 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 34 ms :[(NOT p0)]
RANDOM walk for 901 steps (20 resets) in 7 ms. (112 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 109 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 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 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 12 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 21:20:34] [INFO ] Invariant cache hit.
[2024-05-21 21:20:35] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 21:20:35] [INFO ] Invariant cache hit.
[2024-05-21 21:20:35] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-21 21:20:35] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:20:35] [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-21 21:20:38] [INFO ] Deduced a trap composed of 13 places in 39 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-21 21:20:43] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:20:43] [INFO ] Deduced a trap composed of 12 places in 43 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-21 21:20:46] [INFO ] Deduced a trap composed of 11 places in 85 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-21 21:20:48] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:20:49] [INFO ] Deduced a trap composed of 12 places in 38 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 21148 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-21 21:20:59] [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-21 21:21:25] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:21: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 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 51341ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51344ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51855 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 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 524 steps (12 resets) in 8 ms. (58 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 84 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2197 reset in 215 ms.
Product exploration explored 100000 steps with 2244 reset in 231 ms.
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 6 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 21:21:27] [INFO ] Invariant cache hit.
[2024-05-21 21:21:27] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 21:21:27] [INFO ] Invariant cache hit.
[2024-05-21 21:21:28] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2024-05-21 21:21:28] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:21:28] [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-21 21:21:31] [INFO ] Deduced a trap composed of 13 places in 38 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-21 21:21:35] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:21:35] [INFO ] Deduced a trap composed of 12 places in 62 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-21 21:21:38] [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-21 21:21:40] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:21:42] [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 20658 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-21 21:21:51] [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-21 21:22:17] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:22:17] [INFO ] Deduced a trap composed of 17 places in 72 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 30014 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 50868ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50870ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51480 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-06 finished in 156748 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 5 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-21 21:22:19] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 21:22:19] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-21 21:22:19] [INFO ] Invariant cache hit.
[2024-05-21 21:22:19] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2024-05-21 21:22:19] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 21:22:19] [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-21 21:22:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:22:28] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:22:29] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:22:29] [INFO ] Deduced a trap composed of 12 places in 81 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 21289 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-21 21:22:44] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-21 21:22:44] [INFO ] Deduced a trap composed of 9 places in 41 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 30017 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 51484ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 51486ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52203 ms. Remains : 313/313 places, 257/257 transitions.
Stuttering acceptance computed with spot in 71 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 2209 reset in 236 ms.
Product exploration explored 100000 steps with 2217 reset in 259 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 147 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (895 resets) in 272 ms. (146 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (191 resets) in 464 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (256 resets) in 261 ms. (152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (183 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
[2024-05-21 21:23:12] [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 520 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-21 21:23:13] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:23:13] [INFO ] Deduced a trap composed of 9 places in 76 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 4193 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 4741ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2403 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 13 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 (542 resets) in 700 ms. (57 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (85 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (292 resets) in 338 ms. (118 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (69 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 621721 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 3
Probabilistic random walk after 621721 steps, saw 89330 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
// Phase 1: matrix 255 rows 313 cols
[2024-05-21 21:23:23] [INFO ] Computed 60 invariants in 9 ms
[2024-05-21 21:23:23] [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 306 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-21 21:23:24] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:23:24] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:23:24] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:23:24] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:23:24] [INFO ] Deduced a trap composed of 16 places in 79 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-21 21:23:24] [INFO ] Deduced a trap composed of 8 places in 84 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-21 21:23:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:23:25] [INFO ] Deduced a trap composed of 18 places in 50 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-21 21:23:28] [INFO ] Deduced a trap composed of 12 places in 62 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 13496 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 13821ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 6579 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 6 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 6 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-21 21:23:43] [INFO ] Invariant cache hit.
[2024-05-21 21:23:43] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-21 21:23:43] [INFO ] Invariant cache hit.
[2024-05-21 21:23:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 21:23:45] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2024-05-21 21:23:45] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-21 21:23:45] [INFO ] Invariant cache hit.
[2024-05-21 21:23:45] [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-21 21:23:55] [INFO ] Deduced a trap composed of 9 places in 44 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-21 21:24:04] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:24:06] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:24:08] [INFO ] Deduced a trap composed of 8 places in 48 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 30021 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-21 21:24:17] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:24:18] [INFO ] Deduced a trap composed of 9 places in 31 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-21 21:24:19] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:24:20] [INFO ] Deduced a trap composed of 17 places in 53 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 30026 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 60219ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61749 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-21 21:24:45] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 21:24:45] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 21:24:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:24:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-21 21:24:46] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-21 21:24:46] [INFO ] After 1047ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-21 21:24:46] [INFO ] After 1460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1563 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 258 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 69 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)]
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 6 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-21 21:24:47] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 21:24:47] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 21:24:47] [INFO ] Invariant cache hit.
[2024-05-21 21:24:48] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-05-21 21:24:48] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 21:24:48] [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-21 21:24:57] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-21 21:24:57] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:24:57] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:24:57] [INFO ] Deduced a trap composed of 12 places in 67 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 21898 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-21 21:25:13] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
[2024-05-21 21:25:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 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 30022 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 52097ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 52100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52835 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 155 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (893 resets) in 583 ms. (68 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (203 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (250 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (152 resets) in 244 ms. (163 steps per ms) remains 3/3 properties
[2024-05-21 21:25:40] [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 397 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-21 21:25:41] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:25:41] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:25:42] [INFO ] Deduced a trap composed of 9 places in 87 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 4032 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 4468ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 4737 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 639 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (82 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (289 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 688583 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 3
Probabilistic random walk after 688583 steps, saw 98807 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
// Phase 1: matrix 255 rows 313 cols
[2024-05-21 21:25:53] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 21:25:53] [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 289 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-21 21:25:54] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:25:54] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:25:54] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:25:54] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:25:54] [INFO ] Deduced a trap composed of 16 places in 80 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-21 21:25:55] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 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-21 21:25:55] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:25:55] [INFO ] Deduced a trap composed of 18 places in 40 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-21 21:25:58] [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 13571 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 13895ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 6591 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 10 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 11 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 11 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 21:26:14] [INFO ] Invariant cache hit.
[2024-05-21 21:26:14] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 21:26:14] [INFO ] Invariant cache hit.
[2024-05-21 21:26:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 21:26:15] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
[2024-05-21 21:26:15] [INFO ] Redundant transitions in 1 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-21 21:26:15] [INFO ] Invariant cache hit.
[2024-05-21 21:26:15] [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-21 21:26:25] [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-21 21:26:35] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:26:36] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2024-05-21 21:26:38] [INFO ] Deduced a trap composed of 8 places in 49 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 30023 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-21 21:26:47] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-21 21:26:49] [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-21 21:26:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:26:51] [INFO ] Deduced a trap composed of 17 places in 49 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 30017 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 60210ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61697 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-21 21:27:15] [INFO ] Computed 60 invariants in 9 ms
[2024-05-21 21:27:15] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 21:27:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 21:27:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-21 21:27:16] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-21 21:27:17] [INFO ] After 1040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-21 21:27:17] [INFO ] After 1464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1582 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 268 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)]
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 70 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 2234 reset in 236 ms.
Product exploration explored 100000 steps with 2228 reset in 265 ms.
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 6 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-21 21:27:18] [INFO ] Computed 58 invariants in 9 ms
[2024-05-21 21:27:18] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-21 21:27:18] [INFO ] Invariant cache hit.
[2024-05-21 21:27:19] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2024-05-21 21:27:19] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 21:27:19] [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-21 21:27:28] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-21 21:27:28] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 5 ms to minimize.
[2024-05-21 21:27:29] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:27:29] [INFO ] Deduced a trap composed of 12 places in 77 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 22865 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-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:27:45] [INFO ] Deduced a trap composed of 9 places in 31 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 30016 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 53071ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53853 ms. Remains : 313/313 places, 257/257 transitions.
Treatment of property DES-PT-50a-LTLFireability-08 finished in 353115 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 9 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:28:12] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 21:28:12] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 21:28:12] [INFO ] Invariant cache hit.
[2024-05-21 21:28:12] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:28:12] [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-21 21:28:15] [INFO ] Deduced a trap composed of 13 places in 40 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-21 21:28:20] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:28:20] [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-21 21:28:24] [INFO ] Deduced a trap composed of 11 places in 74 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-21 21:28:26] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:28:27] [INFO ] Deduced a trap composed of 12 places in 54 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 22007 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-21 21:28:37] [INFO ] Deduced a trap composed of 9 places in 40 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-21 21:29:04] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:29:04] [INFO ] Deduced a trap composed of 17 places in 76 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 52204ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 52207ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52784 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 121 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 415 ms.
Product exploration explored 100000 steps with 50000 reset in 412 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 24 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 53797 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-21 21:29:06] [INFO ] Invariant cache hit.
[2024-05-21 21:29:06] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 21:29:06] [INFO ] Invariant cache hit.
[2024-05-21 21:29:06] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:29: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-21 21:29:09] [INFO ] Deduced a trap composed of 13 places in 46 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-21 21:29:14] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:29:14] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 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-21 21:29:17] [INFO ] Deduced a trap composed of 11 places in 63 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-21 21:29:19] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:29:20] [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 21179 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-21 21:29:31] [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-21 21:29:57] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:29:57] [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 30016 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 51371ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51373ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51961 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 181 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 5 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-12 finished in 52164 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 9 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:29:58] [INFO ] Invariant cache hit.
[2024-05-21 21:29:58] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 21:29:58] [INFO ] Invariant cache hit.
[2024-05-21 21:29:58] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:29:58] [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-21 21:30:01] [INFO ] Deduced a trap composed of 13 places in 33 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-21 21:30:06] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:30:06] [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-21 21:30:09] [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-21 21:30:11] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:30:13] [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 21497 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-21 21:30:23] [INFO ] Deduced a trap composed of 9 places in 30 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-21 21:30:48] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:30:48] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
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 51676ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51678ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52182 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 150 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 2231 reset in 233 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 110 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 40 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (906 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (197 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1541781 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :0 out of 1
Probabilistic random walk after 1541781 steps, saw 214193 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :0
[2024-05-21 21:30:54] [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 177 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 324 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 538ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 312 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 10 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 11 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (527 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (94 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1507261 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :0 out of 1
Probabilistic random walk after 1507261 steps, saw 210576 distinct states, run finished after 3001 ms. (steps per millisecond=502 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:30:58] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 21:30:58] [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 185 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 381 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 580ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 299 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 9 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 10 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-21 21:30:59] [INFO ] Invariant cache hit.
[2024-05-21 21:30:59] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 21:30:59] [INFO ] Invariant cache hit.
[2024-05-21 21:30:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 21:30:59] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-05-21 21:30:59] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:30:59] [INFO ] Invariant cache hit.
[2024-05-21 21:30:59] [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-21 21:31:08] [INFO ] Deduced a trap composed of 9 places in 65 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 19568 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-21 21:31:20] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-21 21:31:22] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:31:22] [INFO ] Deduced a trap composed of 12 places in 33 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-21 21:31:35] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:31:39] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:31:46] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:31:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:31:46] [INFO ] Deduced a trap composed of 51 places in 42 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 30016 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 49744ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 49746ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50322 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 10 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-21 21:31:49] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 21:31:49] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:31:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 21:31:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-21 21:31:49] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:31:49] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:31:49] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 421 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 101 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 51 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 35 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 6 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:31:50] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 21:31:50] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-21 21:31:50] [INFO ] Invariant cache hit.
[2024-05-21 21:31:50] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2024-05-21 21:31:50] [INFO ] Redundant transitions in 0 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:31: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-21 21:31:53] [INFO ] Deduced a trap composed of 13 places in 34 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-21 21:31:58] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:31:58] [INFO ] Deduced a trap composed of 12 places in 99 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-21 21:32:01] [INFO ] Deduced a trap composed of 11 places in 71 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-21 21:32:03] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:32:04] [INFO ] Deduced a trap composed of 12 places in 47 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 21550 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-21 21:32:15] [INFO ] Deduced a trap composed of 9 places in 39 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-21 21:32:42] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:32:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
SMT process timed out in 51785ms, After SMT, problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51795ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52447 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 68 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 42 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (892 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (210 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1507285 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :0 out of 1
Probabilistic random walk after 1507285 steps, saw 209864 distinct states, run finished after 3001 ms. (steps per millisecond=502 ) properties seen :0
[2024-05-21 21:32:45] [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 212 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 367 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 596ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 280 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 11 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (528 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (97 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1458888 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :0 out of 1
Probabilistic random walk after 1458888 steps, saw 203691 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:32:49] [INFO ] Computed 60 invariants in 10 ms
[2024-05-21 21:32:49] [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 180 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 399 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 628ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 268 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 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-21 21:32:50] [INFO ] Invariant cache hit.
[2024-05-21 21:32:50] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 21:32:50] [INFO ] Invariant cache hit.
[2024-05-21 21:32:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 21:32:51] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-05-21 21:32:51] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:32:51] [INFO ] Invariant cache hit.
[2024-05-21 21:32:51] [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-21 21:33:00] [INFO ] Deduced a trap composed of 9 places in 52 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 20425 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-21 21:33:13] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-21 21:33:14] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:33:14] [INFO ] Deduced a trap composed of 12 places in 31 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-21 21:33:28] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:33:32] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:33:39] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:33:39] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:33:39] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 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 30014 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 50644ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 50646ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51253 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 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:33:41] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 21:33:41] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:33:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:33:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-21 21:33:42] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:33:42] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:33:42] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 424 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 109 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 2224 reset in 224 ms.
Product exploration explored 100000 steps with 2220 reset in 260 ms.
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 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:33:42] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 21:33:43] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 21:33:43] [INFO ] Invariant cache hit.
[2024-05-21 21:33:43] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-21 21:33:43] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:33:43] [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-21 21:33:46] [INFO ] Deduced a trap composed of 13 places in 35 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-21 21:33:51] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:33:51] [INFO ] Deduced a trap composed of 12 places in 58 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-21 21:33:54] [INFO ] Deduced a trap composed of 11 places in 74 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-21 21:33:56] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:33:57] [INFO ] Deduced a trap composed of 12 places in 51 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 21103 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-21 21:34:07] [INFO ] Deduced a trap composed of 9 places in 25 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-21 21:34:33] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:34:33] [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 30016 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 51303ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51305ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51867 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-13 finished in 276693 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 5 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-21 21:34:34] [INFO ] Invariant cache hit.
[2024-05-21 21:34:35] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 21:34:35] [INFO ] Invariant cache hit.
[2024-05-21 21:34:35] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:34:35] [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-21 21:34:38] [INFO ] Deduced a trap composed of 13 places in 43 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-21 21:34:43] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:34:43] [INFO ] Deduced a trap composed of 12 places in 62 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-21 21:34:46] [INFO ] Deduced a trap composed of 11 places in 80 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-21 21:34:48] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:34: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, 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 21053 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-21 21:34:59] [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-21 21:35:24] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:35:24] [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 30014 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 51233ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51235ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51797 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 98 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 34 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 51914 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-21 21:35:26] [INFO ] Invariant cache hit.
[2024-05-21 21:35:26] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 21:35:26] [INFO ] Invariant cache hit.
[2024-05-21 21:35:27] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:35:27] [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-21 21:35:30] [INFO ] Deduced a trap composed of 13 places in 34 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-21 21:35:34] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:35:34] [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-21 21:35:37] [INFO ] Deduced a trap composed of 11 places in 75 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-21 21:35:39] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:35:40] [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 20395 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-21 21:35:50] [INFO ] Deduced a trap composed of 9 places in 32 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-21 21:36:15] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:36:16] [INFO ] Deduced a trap composed of 17 places in 80 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 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 50593ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50595ms
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51094 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 231 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 402 ms.
Product exploration explored 100000 steps with 50000 reset in 423 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 28 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 52209 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)))))))'
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)))'
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)))))))'
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))))'
Found a Lengthening insensitive property : DES-PT-50a-LTLFireability-13
Stuttering acceptance computed with spot in 141 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_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-21 21:36:19] [INFO ] Invariant cache hit.
[2024-05-21 21:36:19] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 21:36:19] [INFO ] Invariant cache hit.
[2024-05-21 21:36:20] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 21:36:20] [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-21 21:36:23] [INFO ] Deduced a trap composed of 13 places in 41 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-21 21:36:27] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:36:27] [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-21 21:36:31] [INFO ] Deduced a trap composed of 11 places in 84 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-21 21:36:33] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:36:34] [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 21287 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-21 21:36:44] [INFO ] Deduced a trap composed of 9 places in 29 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-21 21:37:10] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:37:10] [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 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 51490ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51492ms
Starting structural reductions in LI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 52044 ms. Remains : 312/313 places, 256/257 transitions.
Running random walk in product with property : DES-PT-50a-LTLFireability-13
Product exploration explored 100000 steps with 2216 reset in 208 ms.
Product exploration explored 100000 steps with 2203 reset in 232 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 100 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 38 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (890 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (194 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1531052 steps, run timeout after 3001 ms. (steps per millisecond=510 ) properties seen :0 out of 1
Probabilistic random walk after 1531052 steps, saw 212987 distinct states, run finished after 3001 ms. (steps per millisecond=510 ) properties seen :0
[2024-05-21 21:37:15] [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 316 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 552ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 273 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 10 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 10 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (530 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (98 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1494455 steps, run timeout after 3001 ms. (steps per millisecond=497 ) properties seen :0 out of 1
Probabilistic random walk after 1494455 steps, saw 208375 distinct states, run finished after 3001 ms. (steps per millisecond=497 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:37:19] [INFO ] Computed 60 invariants in 9 ms
[2024-05-21 21:37:19] [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 186 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 377 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 606ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 261 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 4 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 4 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-21 21:37:20] [INFO ] Invariant cache hit.
[2024-05-21 21:37:20] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 21:37:20] [INFO ] Invariant cache hit.
[2024-05-21 21:37:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 21:37:20] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2024-05-21 21:37:20] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:37:20] [INFO ] Invariant cache hit.
[2024-05-21 21:37:20] [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-21 21:37:29] [INFO ] Deduced a trap composed of 9 places in 53 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 20090 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-21 21:37:42] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:37:44] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:37:44] [INFO ] Deduced a trap composed of 12 places in 28 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-21 21:37:58] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:38:01] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:38:08] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:38:08] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:38:08] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 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 30022 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 50313ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 50315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50902 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-21 21:38:11] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 21:38:11] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:38:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 21:38:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-21 21:38:11] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:38:11] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:38:11] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 397 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 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 41 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 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:38:11] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 21:38:11] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 21:38:11] [INFO ] Invariant cache hit.
[2024-05-21 21:38:12] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-21 21:38:12] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:38:12] [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-21 21:38:15] [INFO ] Deduced a trap composed of 13 places in 40 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-21 21:38:19] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:38:19] [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-21 21:38:22] [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-21 21:38:24] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:38:26] [INFO ] Deduced a trap composed of 12 places in 42 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 20958 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-21 21:38:36] [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-21 21:39:01] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:39:01] [INFO ] Deduced a trap composed of 17 places in 84 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 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 51130ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 51134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51697 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 58 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 46 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (886 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (200 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1551564 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :0 out of 1
Probabilistic random walk after 1551564 steps, saw 215338 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
[2024-05-21 21:39:06] [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 212 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 318 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 544ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 274 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 9 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 9 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 40000 steps (522 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (99 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1515002 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :0 out of 1
Probabilistic random walk after 1515002 steps, saw 211845 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:39:10] [INFO ] Computed 60 invariants in 9 ms
[2024-05-21 21:39:10] [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 179 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 362 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 591ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 264 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 4 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 4 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-21 21:39:11] [INFO ] Invariant cache hit.
[2024-05-21 21:39:11] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 21:39:11] [INFO ] Invariant cache hit.
[2024-05-21 21:39:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 21:39:11] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-21 21:39:11] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:39:11] [INFO ] Invariant cache hit.
[2024-05-21 21:39:11] [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-21 21:39:20] [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 19389 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-21 21:39:33] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-21 21:39:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:39:34] [INFO ] Deduced a trap composed of 12 places in 33 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-21 21:39:48] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:39:51] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-21 21:39:58] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:39:58] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:39:58] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 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 30016 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 49595ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 49598ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50151 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 8 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-21 21:40:01] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 21:40:01] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:40:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:40:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-21 21:40:01] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:40:01] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:40:01] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 412 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 62 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 2242 reset in 236 ms.
Product exploration explored 100000 steps with 2239 reset in 251 ms.
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 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 21:40:02] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 21:40:02] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 21:40:02] [INFO ] Invariant cache hit.
[2024-05-21 21:40:03] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-21 21:40:03] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-21 21:40: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-21 21:40:06] [INFO ] Deduced a trap composed of 13 places in 35 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-21 21:40:10] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:40:10] [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-21 21:40:13] [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-21 21:40:15] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:40:16] [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 20511 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-21 21:40:26] [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-21 21:40:52] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:40:52] [INFO ] Deduced a trap composed of 17 places in 64 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 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 50727ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 50730ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51266 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-13 finished in 274557 ms.
[2024-05-21 21:40:53] [INFO ] Flatten gal took : 28 ms
[2024-05-21 21:40:54] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-21 21:40:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 257 transitions and 1239 arcs took 5 ms.
Total runtime 2237742 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-50a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 313
TRANSITIONS: 257
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3342
MODEL NAME: /home/mcc/execution/405/model
313 places, 257 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-50a-LTLFireability-01 CANNOT_COMPUTE
FORMULA DES-PT-50a-LTLFireability-03 CANNOT_COMPUTE
FORMULA DES-PT-50a-LTLFireability-06 CANNOT_COMPUTE
FORMULA DES-PT-50a-LTLFireability-08 CANNOT_COMPUTE
FORMULA DES-PT-50a-LTLFireability-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716328136278

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r091-tall-171624188300732"
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 ;