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-171624188200700.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-30a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200700
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.3K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:38 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 70K 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-30a-LTLFireability-00
FORMULA_NAME DES-PT-30a-LTLFireability-01
FORMULA_NAME DES-PT-30a-LTLFireability-02
FORMULA_NAME DES-PT-30a-LTLFireability-03
FORMULA_NAME DES-PT-30a-LTLFireability-04
FORMULA_NAME DES-PT-30a-LTLFireability-05
FORMULA_NAME DES-PT-30a-LTLFireability-06
FORMULA_NAME DES-PT-30a-LTLFireability-07
FORMULA_NAME DES-PT-30a-LTLFireability-08
FORMULA_NAME DES-PT-30a-LTLFireability-09
FORMULA_NAME DES-PT-30a-LTLFireability-10
FORMULA_NAME DES-PT-30a-LTLFireability-11
FORMULA_NAME DES-PT-30a-LTLFireability-12
FORMULA_NAME DES-PT-30a-LTLFireability-13
FORMULA_NAME DES-PT-30a-LTLFireability-14
FORMULA_NAME DES-PT-30a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716319685086

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-30a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 19:28:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 19:28:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:28:06] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-21 19:28:06] [INFO ] Transformed 234 places.
[2024-05-21 19:28:06] [INFO ] Transformed 191 transitions.
[2024-05-21 19:28:06] [INFO ] Found NUPN structural information;
[2024-05-21 19:28:06] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 185 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 4 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Applied a total of 0 rules in 37 ms. Remains 234 /234 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 234 cols
[2024-05-21 19:28:06] [INFO ] Computed 59 invariants in 23 ms
[2024-05-21 19:28:07] [INFO ] Implicit Places using invariants in 365 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/234 places, 177/177 transitions.
Applied a total of 0 rules in 14 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 465 ms. Remains : 233/234 places, 177/177 transitions.
Support contains 53 out of 233 places after structural reductions.
[2024-05-21 19:28:07] [INFO ] Flatten gal took : 45 ms
[2024-05-21 19:28:07] [INFO ] Flatten gal took : 20 ms
[2024-05-21 19:28:07] [INFO ] Input system was already deterministic with 177 transitions.
Support contains 50 out of 233 places (down from 53) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (888 resets) in 2390 ms. (16 steps per ms) remains 16/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (18 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
// Phase 1: matrix 177 rows 233 cols
[2024-05-21 19:28:08] [INFO ] Computed 58 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 10/32 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 62/94 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 62/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 104/198 variables, 25/151 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 104/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 3/201 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 176/377 variables, 201/460 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 14 ms to minimize.
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/377 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/377 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 33/410 variables, 32/499 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 32/531 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 0/410 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 531 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3950 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 10/32 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 62/94 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 62/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 104/198 variables, 25/152 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 104/256 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 3/201 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 176/377 variables, 201/467 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/377 variables, 5/472 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/377 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 33/410 variables, 32/504 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 32/536 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 547 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5020 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 7/7 constraints]
After SMT, in 9052ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 177/177 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 232 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 232 transition count 175
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 7 place count 232 transition count 175
Applied a total of 7 rules in 38 ms. Remains 232 /233 variables (removed 1) and now considering 175/177 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 232/233 places, 175/177 transitions.
RANDOM walk for 40000 steps (651 resets) in 677 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (14 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 600772 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 16
Probabilistic random walk after 600772 steps, saw 84537 distinct states, run finished after 3005 ms. (steps per millisecond=199 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-21 19:28:20] [INFO ] Computed 59 invariants in 5 ms
[2024-05-21 19:28:20] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 10/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 66/98 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 102/200 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 3/203 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 175/378 variables, 203/262 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 19:28:21] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:28:21] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 29/407 variables, 29/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 295 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1719 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 10/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 66/98 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 102/200 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 3/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 175/378 variables, 203/264 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 29/407 variables, 29/300 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 11/311 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 19:28:25] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 19:28:26] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:28:26] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/407 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/407 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 0/407 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 314 constraints, problems are : Problem set: 0 solved, 16 unsolved in 9222 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 10979ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 3462 ms.
Support contains 22 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-21 19:28:35] [INFO ] Invariant cache hit.
[2024-05-21 19:28:35] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-21 19:28:35] [INFO ] Invariant cache hit.
[2024-05-21 19:28:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:28:35] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-21 19:28:35] [INFO ] Redundant transitions in 6 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 19:28:35] [INFO ] Invariant cache hit.
[2024-05-21 19:28:35] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:28:37] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:28:37] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/407 variables, 232/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:28:38] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:28:39] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:28:39] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 298 constraints, problems are : Problem set: 0 solved, 174 unsolved in 8532 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:28:45] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:28:45] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:28:45] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/475 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:28:55] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:28:56] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:28:56] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:29:07] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 479 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 12/12 constraints]
After SMT, in 38652ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 38655ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39056 ms. Remains : 232/232 places, 175/175 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 16 properties.
[2024-05-21 19:29:14] [INFO ] Invariant cache hit.
[2024-05-21 19:29:14] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-21 19:29:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 19:29:14] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-21 19:29:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-21 19:29:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 19:29:15] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-05-21 19:29:15] [INFO ] After 995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-05-21 19:29:16] [INFO ] After 1592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Over-approximation ignoring read arcs solved 0 properties in 1789 ms.
FORMULA DES-PT-30a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 136 stabilizing places and 131 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' '!(!(!p0 U (X(p0)&&p1)))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 5 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:29:16] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 19:29:16] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 19:29:16] [INFO ] Invariant cache hit.
[2024-05-21 19:29:16] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:29:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:29:19] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-21 19:29:20] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:29:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:29:20] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:29:20] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:29:20] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:29:20] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:29:21] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:29:21] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7699 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37794ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37796ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38147 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND p0 p1), p0, true]
Running random walk in product with property : DES-PT-30a-LTLFireability-00
Product exploration explored 100000 steps with 3033 reset in 386 ms.
Product exploration explored 100000 steps with 3062 reset in 390 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 118 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND p0 p1), p0, true]
RANDOM walk for 40000 steps (899 resets) in 304 ms. (131 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (191 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
[2024-05-21 19:29:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:29:56] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:29:56] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/408 variables, 33/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1548 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=387 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 p1), p0, true]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:29:56] [INFO ] Invariant cache hit.
[2024-05-21 19:29:57] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 19:29:57] [INFO ] Invariant cache hit.
[2024-05-21 19:29:57] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:29:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:30:00] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-21 19:30:01] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:30:01] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:30:01] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-21 19:30:01] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 6 ms to minimize.
[2024-05-21 19:30:01] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:30:01] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-21 19:30:02] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-21 19:30:02] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8303 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 38430ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38433ms
Finished structural reductions in LTL mode , in 1 iterations and 38849 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p1), p0, true]
RANDOM walk for 40000 steps (890 resets) in 278 ms. (143 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (168 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
[2024-05-21 19:30:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:30:36] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:30:36] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/408 variables, 33/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 527ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1547 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=309 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 91 ms :[(AND p0 p1), p0, true]
Product exploration explored 100000 steps with 3037 reset in 216 ms.
Product exploration explored 100000 steps with 3049 reset in 220 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), p0, true]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 21 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:30:37] [INFO ] Redundant transitions in 7 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:30:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:30:40] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:30:41] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:30:41] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:30:41] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:30:41] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 11 ms to minimize.
[2024-05-21 19:30:41] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 19:30:41] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-21 19:30:42] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:30:42] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7742 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37831ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37832ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37877 ms. Remains : 232/232 places, 176/176 transitions.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:31:15] [INFO ] Invariant cache hit.
[2024-05-21 19:31:15] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 19:31:15] [INFO ] Invariant cache hit.
[2024-05-21 19:31:16] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:31:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:31:18] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:31:19] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:31:19] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:31:19] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:31:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:31:19] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:31:19] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:31:20] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:31:20] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7460 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37556ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37559ms
Finished structural reductions in LTL mode , in 1 iterations and 37919 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-00 finished in 157347 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 U p1))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 32 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:31:53] [INFO ] Invariant cache hit.
[2024-05-21 19:31:54] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-21 19:31:54] [INFO ] Invariant cache hit.
[2024-05-21 19:31:54] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-05-21 19:31:54] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:31:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-21 19:31:58] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:31:58] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-21 19:31:58] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-21 19:31:58] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-21 19:31:58] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7564 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37683ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37685ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38430 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-01
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-01 finished in 38578 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((G(p0)||F(G(p1))))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 6 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:32:32] [INFO ] Invariant cache hit.
[2024-05-21 19:32:32] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 19:32:32] [INFO ] Invariant cache hit.
[2024-05-21 19:32:32] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:32:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:32:35] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-21 19:32:36] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:32:36] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:32:36] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:32:36] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:32:36] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-21 19:32:36] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:32:37] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:32:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7997 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 38083ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38086ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38470 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-02
Product exploration explored 100000 steps with 2198 reset in 314 ms.
Product exploration explored 100000 steps with 2230 reset in 365 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
RANDOM walk for 262 steps (6 resets) in 4 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 104 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 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 2 out of 232 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 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:33:12] [INFO ] Invariant cache hit.
[2024-05-21 19:33:12] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 19:33:12] [INFO ] Invariant cache hit.
[2024-05-21 19:33:12] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-05-21 19:33:12] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:33:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:33:15] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:33:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:33:15] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:33:16] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-21 19:33:16] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:33:16] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:33:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:33:16] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:33:16] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7868 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37960ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37964ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38408 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
RANDOM walk for 131 steps (1 resets) in 6 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2229 reset in 220 ms.
Product exploration explored 100000 steps with 2236 reset in 240 ms.
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:33:51] [INFO ] Invariant cache hit.
[2024-05-21 19:33:51] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 19:33:51] [INFO ] Invariant cache hit.
[2024-05-21 19:33:51] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-21 19:33:51] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:33:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:33:54] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7694 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37797ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37800ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38182 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-02 finished in 117209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))||(G(p3)&&F(p4))))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 14 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:34:29] [INFO ] Invariant cache hit.
[2024-05-21 19:34:29] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 19:34:29] [INFO ] Invariant cache hit.
[2024-05-21 19:34:29] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-21 19:34:29] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:34:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:34:32] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-21 19:34:33] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:34:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:34:33] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:34:33] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:34:33] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:34:33] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:34:34] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-21 19:34:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7679 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37763ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37765ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38141 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 588 ms :[true, (OR (NOT p3) (NOT p4)), (OR (AND p0 p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p2) (NOT p4))), (AND (NOT p2) p1 p0 (NOT p3)), (NOT p3), (AND p0 (NOT p3)), (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p2) p1), p0, (OR (AND p0 (NOT p3)) (AND p0 (NOT p4))), (AND p0 (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-03
Product exploration explored 100000 steps with 2241 reset in 287 ms.
Product exploration explored 100000 steps with 2226 reset in 308 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/5 atomic propositions.
Knowledge obtained : [(AND p3 p4 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0))), (X p4), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (AND p3 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p4 p0))), (X (NOT (AND p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0)))), (X (AND p3 p4)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 p4 (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X p3), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1))))), (X (X p4)), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p4 p0)))), (X (X (NOT (AND p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0))))), (X (X (AND p3 p4))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0)))), (X (X (AND p3 p4 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X p3)), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0)))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 76 factoid took 388 ms. Reduced automaton from 12 states, 60 edges and 5 AP (stutter insensitive) to 17 states, 118 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 756 ms :[true, (AND (NOT p3) p0 p1 (NOT p2)), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (NOT p3), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2)), p0, (AND p0 (NOT p3))]
RANDOM walk for 40000 steps (889 resets) in 534 ms. (74 steps per ms) remains 23/32 properties
BEST_FIRST walk for 4004 steps (18 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (15 resets) in 57 ms. (69 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (21 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (19 resets) in 69 ms. (57 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 51 ms. (76 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (19 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 51 ms. (76 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (17 resets) in 58 ms. (67 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (20 resets) in 73 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (21 resets) in 68 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (20 resets) in 78 ms. (50 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (20 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (18 resets) in 55 ms. (71 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (18 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (19 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (19 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (19 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (21 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
[2024-05-21 19:35:10] [INFO ] Invariant cache hit.
Problem apf8 is UNSAT
Problem apf14 is UNSAT
Problem apf15 is UNSAT
Problem apf20 is UNSAT
Problem apf26 is UNSAT
Problem apf29 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/32 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 116/196 variables, 25/57 constraints. Problems are: Problem set: 6 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 3/199 variables, 1/58 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem apf6 is UNSAT
Problem apf13 is UNSAT
Problem apf17 is UNSAT
Problem apf22 is UNSAT
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 10 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 10 solved, 13 unsolved in 914 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/32 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 116/196 variables, 25/57 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 3/199 variables, 1/58 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 10 solved, 13 unsolved
Problem apf12 is UNSAT
Problem apf24 is UNSAT
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 12 solved, 11 unsolved
[2024-05-21 19:35:12] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/258 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/258 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 34/408 variables, 33/291 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 11/302 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/302 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/302 constraints. Problems are: Problem set: 12 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 302 constraints, problems are : Problem set: 12 solved, 11 unsolved in 1791 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/23 constraints, Known Traps: 1/1 constraints]
After SMT, in 2727ms problems are : Problem set: 12 solved, 11 unsolved
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 26887 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 7 place count 232 transition count 175
Applied a total of 7 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (674 resets) in 752 ms. (53 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (105 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (121 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (95 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (96 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (111 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (129 resets) in 222 ms. (179 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (122 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (118 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (126 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (104 resets) in 267 ms. (149 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (101 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 389660 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 11
Probabilistic random walk after 389660 steps, saw 58179 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-21 19:35:44] [INFO ] Computed 59 invariants in 4 ms
[2024-05-21 19:35:44] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 72/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 117/199 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 3/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 175/377 variables, 202/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 30/407 variables, 30/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1187 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 72/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 117/199 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 3/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 175/377 variables, 202/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:35:46] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:35:46] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 30/407 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 11/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 307 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 2950ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
Finished Parikh walk after 19125 steps, including 65 resets, run visited all 2 properties in 155 ms. (steps per millisecond=123 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 7016 ms.
Found 12 invariant AP formulas.
Knowledge obtained : [(AND p3 p4 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0))), (X p4), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (AND p3 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p4 p0))), (X (NOT (AND p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0)))), (X (AND p3 p4)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 p4 (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X p3), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1))))), (X (X p4)), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p4 p0)))), (X (X (NOT (AND p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0))))), (X (X (AND p3 p4))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0)))), (X (X (AND p3 p4 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X p3)), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0)))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR p0 p1 p2 p3)), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 p2 p3)), (G (OR (NOT p0) (NOT p1) (NOT p2) p3)), (G (OR (NOT p0) p1 (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) p3)), (G (OR p1 p2 p3)), (G (OR (NOT p0) (NOT p1) p2 p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p3))), (F p2), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT p3)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F p1), (F p0)]
Knowledge based reduction with 88 factoid took 2297 ms. Reduced automaton from 17 states, 118 edges and 4 AP (stutter insensitive) to 20 states, 66 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 888 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), p1, (AND p0 p1), (AND (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3)), false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 862 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), p1, (AND p0 p1), (AND (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3)), false, false, false, false, false, false, false, false, false, false, false]
Support contains 5 out of 232 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 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:35:58] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 19:35:58] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 19:35:58] [INFO ] Invariant cache hit.
[2024-05-21 19:35:58] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-21 19:35:58] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:35:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:36:01] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:36:02] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:36:02] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:36:02] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:36:02] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:36:02] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:36:02] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:36:03] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:36:03] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7830 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37925ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37927ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38309 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)))), (X (AND (NOT p0) (NOT p1) p3)), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 52 factoid took 238 ms. Reduced automaton from 20 states, 66 edges and 4 AP (stutter insensitive) to 20 states, 74 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 825 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p0, p0, (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3)), p1, (AND p0 p1), p1, p1, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (892 resets) in 1137 ms. (35 steps per ms) remains 18/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (19 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (14 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (20 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 62 ms. (63 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (21 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (17 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (18 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
[2024-05-21 19:36:38] [INFO ] Invariant cache hit.
Problem apf6 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/32 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 116/196 variables, 25/57 constraints. Problems are: Problem set: 2 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 3/199 variables, 1/58 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 16 unsolved
Problem apf5 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 6 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 6 solved, 12 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/32 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 116/196 variables, 25/57 constraints. Problems are: Problem set: 6 solved, 12 unsolved
[2024-05-21 19:36:39] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/58 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/58 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 3/199 variables, 1/59 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Problem apf18 is UNSAT
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/258 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/258 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 34/408 variables, 33/291 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 11/302 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/302 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/302 constraints. Problems are: Problem set: 7 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 302 constraints, problems are : Problem set: 7 solved, 11 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/18 constraints, Known Traps: 1/1 constraints]
After SMT, in 2454ms problems are : Problem set: 7 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 4 properties in 19209 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 7 place count 232 transition count 175
Applied a total of 7 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (667 resets) in 662 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (111 resets) in 332 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (124 resets) in 145 ms. (273 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (92 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (95 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (125 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (125 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (113 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 416478 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 7
Probabilistic random walk after 416478 steps, saw 61692 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-21 19:37:04] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 19:37:04] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 72/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 117/199 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 175/377 variables, 202/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 30/407 variables, 30/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 7 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 72/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 117/199 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 175/377 variables, 202/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 30/407 variables, 30/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 7/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 301 constraints, problems are : Problem set: 0 solved, 7 unsolved in 981 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1643ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 12875 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-21 19:37:18] [INFO ] Invariant cache hit.
[2024-05-21 19:37:18] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 19:37:18] [INFO ] Invariant cache hit.
[2024-05-21 19:37:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 19:37:18] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-21 19:37:18] [INFO ] Redundant transitions in 0 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 19:37:18] [INFO ] Invariant cache hit.
[2024-05-21 19:37:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6586 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:37:27] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:37:27] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:37:27] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-21 19:37:28] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:37:28] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 175/407 variables, 232/296 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 174/473 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:37:36] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:37:38] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 475 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints]
After SMT, in 36684ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 36687ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37086 ms. Remains : 232/232 places, 175/175 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 232 transition count 175
Applied a total of 1 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 175 rows 232 cols
[2024-05-21 19:37:55] [INFO ] Computed 59 invariants in 5 ms
[2024-05-21 19:37:55] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 19:37:55] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-21 19:37:55] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-21 19:37:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 19:37:55] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-21 19:37:56] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-21 19:37:56] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-21 19:37:56] [INFO ] After 794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 934 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)))), (X (AND (NOT p0) (NOT p1) p3)), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (AND (OR (NOT p0) (NOT p1) p3) (OR (NOT p0) p2 p3))), (G (OR (NOT p0) p1 (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR p0 p1 p2 p3)), (G (OR (NOT p0) p1 p2 p3)), (G (OR (NOT p0) p3))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p3)))), (F p1), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT (AND (NOT p1) p3)))]
Knowledge based reduction with 59 factoid took 816 ms. Reduced automaton from 20 states, 74 edges and 4 AP (stutter insensitive) to 17 states, 56 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 731 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p0, (AND p0 (NOT p3)), p1, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 745 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p0, (AND p0 (NOT p3)), p1, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 737 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p0, (AND p0 (NOT p3)), p1, (AND p0 p1), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 2235 reset in 265 ms.
Product exploration explored 100000 steps with 2221 reset in 281 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:38:00] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 19:38:00] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-21 19:38:00] [INFO ] Invariant cache hit.
[2024-05-21 19:38:00] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-21 19:38:00] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:38:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7569 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37652ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37662ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38041 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-03 finished in 248728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((!p1 U (G(!p1)||(!p1&&(p2 U p3))))))))'
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 3 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:38:38] [INFO ] Invariant cache hit.
[2024-05-21 19:38:38] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 19:38:38] [INFO ] Invariant cache hit.
[2024-05-21 19:38:38] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:38:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:38:41] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:38:42] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:38:42] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:38:42] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 19:38:42] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:38:42] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-21 19:38:42] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-21 19:38:42] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:38:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7722 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37820ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37825ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38211 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : DES-PT-30a-LTLFireability-06
Product exploration explored 100000 steps with 2223 reset in 317 ms.
Product exploration explored 100000 steps with 2216 reset in 258 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 245 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
RANDOM walk for 40000 steps (888 resets) in 925 ms. (43 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40002 steps (256 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (180 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (178 resets) in 256 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (252 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (142 resets) in 300 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (215 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (249 resets) in 204 ms. (195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (250 resets) in 371 ms. (107 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (179 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (217 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (176 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
[2024-05-21 19:39:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 32/408 variables, 32/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 11 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/408 variables, 32/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 9/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 301 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1303 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1881ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 23884 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 6 place count 232 transition count 175
Applied a total of 6 rules in 29 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (898 resets) in 520 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (328 resets) in 278 ms. (143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (167 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (163 resets) in 173 ms. (229 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (337 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (147 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (288 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (330 resets) in 214 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (342 resets) in 274 ms. (145 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (167 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (284 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (185 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 358344 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 11
Probabilistic random walk after 358344 steps, saw 52155 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-21 19:39:49] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 19:39:49] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 32/407 variables, 32/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:39:50] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/407 variables, 32/297 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:39:50] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 307 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1926 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 2517ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 19011 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-21 19:40:10] [INFO ] Invariant cache hit.
[2024-05-21 19:40:10] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 19:40:10] [INFO ] Invariant cache hit.
[2024-05-21 19:40:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 19:40:11] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-05-21 19:40:11] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 19:40:11] [INFO ] Invariant cache hit.
[2024-05-21 19:40:11] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5556 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:40:17] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-21 19:40:17] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-21 19:40:17] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 19:40:18] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 19:40:18] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:40:18] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:40:18] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:40:19] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/476 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:40:24] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 19:40:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:40:26] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:40:26] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:40:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:40:29] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:40:30] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:40:35] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 484 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 16/16 constraints]
After SMT, in 35653ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 35656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36064 ms. Remains : 232/232 places, 175/175 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 17 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 11 properties.
[2024-05-21 19:40:46] [INFO ] Invariant cache hit.
[2024-05-21 19:40:47] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-21 19:40:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 19:40:47] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 19:40:47] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-21 19:40:47] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-21 19:40:47] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:40:47] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:40:48] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:40:48] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:40:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 461 ms
[2024-05-21 19:40:48] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:40:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 1
[2024-05-21 19:40:49] [INFO ] After 1882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-21 19:40:49] [INFO ] After 2411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 2550 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p1 (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 23 factoid took 468 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:40:50] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 19:40:50] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 19:40:50] [INFO ] Invariant cache hit.
[2024-05-21 19:40:50] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:40:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:40:53] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-21 19:40:54] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:40:54] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 19:40:54] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:40:54] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:40:54] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-21 19:40:54] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:40:55] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:40:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8055 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 38161ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38164ms
Finished structural reductions in LTL mode , in 1 iterations and 38568 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 231 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
RANDOM walk for 40000 steps (905 resets) in 866 ms. (46 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40004 steps (179 resets) in 228 ms. (174 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (248 resets) in 290 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (257 resets) in 248 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (250 resets) in 341 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (143 resets) in 303 ms. (131 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (188 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (254 resets) in 249 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (219 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (219 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (184 resets) in 210 ms. (189 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (178 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
[2024-05-21 19:41:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 32/408 variables, 32/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 11 unsolved in 614 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:41:31] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/200 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 176/376 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 32/408 variables, 32/293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 9/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 302 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1864 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 2494ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 25266 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 6 place count 232 transition count 175
Applied a total of 6 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (845 resets) in 626 ms. (63 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (170 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (332 resets) in 238 ms. (167 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (336 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (336 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (161 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (185 resets) in 235 ms. (169 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (332 resets) in 321 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (282 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (287 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (177 resets) in 253 ms. (157 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (190 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 539275 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 11
Probabilistic random walk after 539275 steps, saw 76663 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-21 19:42:02] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 19:42:02] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 32/407 variables, 32/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:42:03] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/407 variables, 32/297 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 306 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1743 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 2377ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 18243 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-21 19:42:22] [INFO ] Invariant cache hit.
[2024-05-21 19:42:23] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 19:42:23] [INFO ] Invariant cache hit.
[2024-05-21 19:42:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 19:42:23] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-21 19:42:23] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 19:42:23] [INFO ] Invariant cache hit.
[2024-05-21 19:42:23] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5601 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:42:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:42:29] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-21 19:42:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-21 19:42:30] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:42:30] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:42:30] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:42:30] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:42:31] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/476 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:42:37] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:42:37] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:42:38] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:42:38] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:42:39] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:42:42] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:42:42] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 19:42:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 484 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 16/16 constraints]
After SMT, in 35690ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 35693ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36104 ms. Remains : 232/232 places, 175/175 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 11 properties.
[2024-05-21 19:42:59] [INFO ] Invariant cache hit.
[2024-05-21 19:42:59] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-21 19:42:59] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 19:42:59] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-21 19:42:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 19:42:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 19:42:59] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-21 19:43:00] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:43:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-21 19:43:00] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:43:00] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:43:00] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:43:00] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:43:00] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:43:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 420 ms
TRAPS : Iteration 1
[2024-05-21 19:43:01] [INFO ] After 1714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-21 19:43:01] [INFO ] After 2240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 2376 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 23 factoid took 531 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 2221 reset in 236 ms.
Product exploration explored 100000 steps with 2230 reset in 272 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:43:03] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 19:43:03] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 19:43:03] [INFO ] Invariant cache hit.
[2024-05-21 19:43:03] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:43:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:43:06] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:43:06] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:43:06] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:43:07] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:43:07] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-21 19:43:07] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 19:43:07] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:43:07] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-21 19:43:07] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7816 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37909ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37911ms
Finished structural reductions in LTL mode , in 1 iterations and 38253 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-06 finished in 303170 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))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 11 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:43:41] [INFO ] Invariant cache hit.
[2024-05-21 19:43:41] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 19:43:41] [INFO ] Invariant cache hit.
[2024-05-21 19:43:41] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:43:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:43:44] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7663 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37764ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37767ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38134 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30a-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-08 finished in 38938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0)) U p1)))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 19 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:44:20] [INFO ] Invariant cache hit.
[2024-05-21 19:44:20] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 19:44:20] [INFO ] Invariant cache hit.
[2024-05-21 19:44:20] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-21 19:44:20] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:44:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:44:23] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:44:24] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:44:24] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:44:24] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:44:24] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-21 19:44:24] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:44:24] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:44:25] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:44:25] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8008 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 38102ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38490 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-09
Product exploration explored 100000 steps with 2225 reset in 214 ms.
Product exploration explored 100000 steps with 2201 reset in 237 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), p0, (NOT p1)]
RANDOM walk for 291 steps (5 resets) in 4 ms. (58 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), p0, (NOT p1)]
[2024-05-21 19:45:00] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-09 finished in 40282 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((p0&&X(X(F(p1)))))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 9 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:45:00] [INFO ] Invariant cache hit.
[2024-05-21 19:45:00] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 19:45:00] [INFO ] Invariant cache hit.
[2024-05-21 19:45:01] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:45:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:45:03] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:45:04] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:45:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:45:04] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:45:04] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-21 19:45:04] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-21 19:45:04] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:45:05] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:45:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7934 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 38026ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38028ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38401 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-10
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-10 finished in 38651 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((((!p1 U G(!p2))||X(p3))&&p0)))'
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 233 cols
[2024-05-21 19:45:39] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 19:45:39] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 19:45:39] [INFO ] Invariant cache hit.
[2024-05-21 19:45:39] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-21 19:45:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 12/244 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 176 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/233 variables, 32/276 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 14/291 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 177/410 variables, 233/524 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 19:45:43] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:45:44] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:45:44] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:45:44] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:45:44] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 19:45:47] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/410 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 0/410 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 530 constraints, problems are : Problem set: 0 solved, 176 unsolved in 13879 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 12/244 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 1/233 variables, 32/276 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 14/291 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 19:45:55] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 19:45:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (OVERLAPS) 177/410 variables, 233/532 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 176/708 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 708 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30014 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints]
After SMT, in 43970ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 43973ms
Finished structural reductions in LTL mode , in 1 iterations and 44594 ms. Remains : 233/233 places, 177/177 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), true, (NOT p3), (AND p2 (NOT p3)), (AND p2 (NOT p3)), p2, p2]
Running random walk in product with property : DES-PT-30a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-11 finished in 44919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p1&&X((p1 U (!p2||G(p1)))))))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 5 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:46:24] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 19:46:24] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 19:46:24] [INFO ] Invariant cache hit.
[2024-05-21 19:46:24] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:46:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:46:27] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 3 ms to minimize.
[2024-05-21 19:46:28] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:46:28] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:46:28] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-21 19:46:28] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 19:46:28] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-21 19:46:28] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:46:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 4 ms to minimize.
[2024-05-21 19:46:29] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8255 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 38338ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38339ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38764 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-12
Product exploration explored 100000 steps with 2231 reset in 215 ms.
Product exploration explored 100000 steps with 2219 reset in 259 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 315 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (899 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (180 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1631031 steps, run timeout after 3001 ms. (steps per millisecond=543 ) properties seen :0 out of 1
Probabilistic random walk after 1631031 steps, saw 224885 distinct states, run finished after 3001 ms. (steps per millisecond=543 ) properties seen :0
[2024-05-21 19:47:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:47:07] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/408 variables, 33/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 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 232 transition count 174
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 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 231 transition count 173
Applied a total of 9 rules in 15 ms. Remains 231 /232 variables (removed 1) and now considering 173/176 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 231/232 places, 173/176 transitions.
RANDOM walk for 40000 steps (531 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (85 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1569016 steps, run timeout after 3001 ms. (steps per millisecond=522 ) properties seen :0 out of 1
Probabilistic random walk after 1569016 steps, saw 219631 distinct states, run finished after 3001 ms. (steps per millisecond=522 ) properties seen :0
// Phase 1: matrix 173 rows 231 cols
[2024-05-21 19:47:10] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 19:47:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 122/127 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/158 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/183 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/190 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 140/330 variables, 190/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/342 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/343 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/343 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/343 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/375 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/404 variables, 29/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/404 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/404 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/127 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/158 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/183 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/190 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 140/330 variables, 190/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/342 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/342 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/343 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/343 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/343 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/375 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/404 variables, 29/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/404 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/404 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 552ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 33818 steps, including 64 resets, run visited all 1 properties in 72 ms. (steps per millisecond=469 )
Parikh walk visited 1 properties in 71 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 11 factoid took 280 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-12 finished in 47588 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(F(p0))&&F(p1))) U (p2 U p3)))'
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 16 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:47:11] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 19:47:12] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 19:47:12] [INFO ] Invariant cache hit.
[2024-05-21 19:47:12] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-21 19:47:12] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:47:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:47:15] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:47:16] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:47:16] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 19:47:16] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-21 19:47:16] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-21 19:47:16] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:47:16] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8383 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 38491ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38493ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39021 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p3), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DES-PT-30a-LTLFireability-14
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-14 finished in 39394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U (X(p0)&&p1)))'
Found a Lengthening insensitive property : DES-PT-30a-LTLFireability-00
Stuttering acceptance computed with spot in 92 ms :[(AND p0 p1), p0, true]
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 9 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:47:51] [INFO ] Invariant cache hit.
[2024-05-21 19:47:51] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 19:47:51] [INFO ] Invariant cache hit.
[2024-05-21 19:47:51] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:47:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:47:54] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:47:55] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:47:55] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-21 19:47:55] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-21 19:47:55] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-21 19:47:55] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-21 19:47:55] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:47:56] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-21 19:47:56] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7934 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 38033ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38036ms
Starting structural reductions in LI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38401 ms. Remains : 232/233 places, 176/177 transitions.
Running random walk in product with property : DES-PT-30a-LTLFireability-00
Product exploration explored 100000 steps with 3052 reset in 212 ms.
Product exploration explored 100000 steps with 3040 reset in 246 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 p1), p0, true]
RANDOM walk for 40000 steps (898 resets) in 145 ms. (273 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (177 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2024-05-21 19:48:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:48:30] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:48:30] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/408 variables, 33/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1546 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=220 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 p1), p0, true]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:48:31] [INFO ] Invariant cache hit.
[2024-05-21 19:48:31] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 19:48:31] [INFO ] Invariant cache hit.
[2024-05-21 19:48:31] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:48:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:48:34] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:48:35] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-21 19:48:35] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:48:35] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:48:35] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-21 19:48:35] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-21 19:48:35] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-21 19:48:36] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:48:36] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7734 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37821ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37823ms
Finished structural reductions in LTL mode , in 1 iterations and 38188 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p1), p0, true]
RANDOM walk for 40000 steps (892 resets) in 125 ms. (317 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (176 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2024-05-21 19:49:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:49:10] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:49:10] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/408 variables, 33/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1550 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=387 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p1), p0, true]
Product exploration explored 100000 steps with 3050 reset in 184 ms.
Product exploration explored 100000 steps with 3046 reset in 216 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 97 ms :[(AND p0 p1), p0, true]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:49:11] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:49:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:49:14] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-21 19:49:14] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:49:14] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:49:14] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:49:14] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:49:15] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-21 19:49:15] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:49:15] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-21 19:49:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7838 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37928ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37929ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37952 ms. Remains : 232/232 places, 176/176 transitions.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:49:49] [INFO ] Invariant cache hit.
[2024-05-21 19:49:49] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 19:49:49] [INFO ] Invariant cache hit.
[2024-05-21 19:49:49] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:49:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:49:52] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2024-05-21 19:49:53] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:49:53] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-21 19:49:53] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:49:53] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:49:53] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:49:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:49:54] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:49:54] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7895 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37977ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37978ms
Finished structural reductions in LTL mode , in 1 iterations and 38376 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-00 finished in 156560 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((G(p0)||F(G(p1))))))'
Found a Lengthening insensitive property : DES-PT-30a-LTLFireability-02
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 6 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:50:28] [INFO ] Invariant cache hit.
[2024-05-21 19:50:28] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-21 19:50:28] [INFO ] Invariant cache hit.
[2024-05-21 19:50:28] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:50:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:50:31] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:50:31] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:50:31] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:50:32] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:50:32] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-21 19:50:32] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:50:32] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 19:50:32] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:50:32] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7650 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37744ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37745ms
Starting structural reductions in LI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38308 ms. Remains : 232/233 places, 176/177 transitions.
Running random walk in product with property : DES-PT-30a-LTLFireability-02
Product exploration explored 100000 steps with 2258 reset in 192 ms.
Product exploration explored 100000 steps with 2185 reset in 227 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
RANDOM walk for 259 steps (6 resets) in 5 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 2 out of 232 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 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:51:07] [INFO ] Invariant cache hit.
[2024-05-21 19:51:07] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 19:51:07] [INFO ] Invariant cache hit.
[2024-05-21 19:51:07] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-21 19:51:07] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:51:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 19:51:11] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:51:11] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:51:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-21 19:51:11] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7577 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37700ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37702ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38090 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 28 ms :[(NOT p1)]
RANDOM walk for 194 steps (3 resets) in 6 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 106 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 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2222 reset in 194 ms.
Product exploration explored 100000 steps with 2226 reset in 214 ms.
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:51:45] [INFO ] Invariant cache hit.
[2024-05-21 19:51:46] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-21 19:51:46] [INFO ] Invariant cache hit.
[2024-05-21 19:51:46] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-21 19:51:46] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:51:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 6 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-21 19:51:50] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:51:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:51:50] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7648 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37734ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37737ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38193 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-02 finished in 116307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))||(G(p3)&&F(p4))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((!p1 U (G(!p1)||(!p1&&(p2 U p3))))))))'
Found a Shortening insensitive property : DES-PT-30a-LTLFireability-06
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 10 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-21 19:52:24] [INFO ] Invariant cache hit.
[2024-05-21 19:52:24] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 19:52:24] [INFO ] Invariant cache hit.
[2024-05-21 19:52:24] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:52:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:52:27] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7720 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37820ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37822ms
Starting structural reductions in LI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38237 ms. Remains : 232/233 places, 176/177 transitions.
Running random walk in product with property : DES-PT-30a-LTLFireability-06
Product exploration explored 100000 steps with 2168 reset in 232 ms.
Product exploration explored 100000 steps with 2225 reset in 248 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 201 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
RANDOM walk for 40000 steps (881 resets) in 369 ms. (108 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40003 steps (255 resets) in 255 ms. (156 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (181 resets) in 271 ms. (147 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (177 resets) in 316 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (255 resets) in 328 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (146 resets) in 442 ms. (90 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (215 resets) in 279 ms. (142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (253 resets) in 504 ms. (79 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (251 resets) in 220 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (177 resets) in 397 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (215 resets) in 550 ms. (72 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (175 resets) in 378 ms. (105 steps per ms) remains 11/11 properties
[2024-05-21 19:53:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 32/408 variables, 32/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 11 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/408 variables, 32/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 9/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 301 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1285 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1969ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 31922 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 6 place count 232 transition count 175
Applied a total of 6 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (893 resets) in 1315 ms. (30 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (339 resets) in 311 ms. (128 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (164 resets) in 352 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (171 resets) in 499 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (333 resets) in 388 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (153 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (287 resets) in 527 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (327 resets) in 595 ms. (67 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (334 resets) in 302 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (182 resets) in 367 ms. (108 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (285 resets) in 267 ms. (149 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (176 resets) in 252 ms. (158 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 377497 steps, run timeout after 6001 ms. (steps per millisecond=62 ) properties seen :0 out of 11
Probabilistic random walk after 377497 steps, saw 55251 distinct states, run finished after 6001 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-21 19:53:47] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 19:53:47] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 32/407 variables, 32/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:53:48] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/407 variables, 32/297 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:53:49] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 307 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1961 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 2552ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 28718 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 14 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-21 19:54:18] [INFO ] Invariant cache hit.
[2024-05-21 19:54:18] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 19:54:18] [INFO ] Invariant cache hit.
[2024-05-21 19:54:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 19:54:19] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-21 19:54:19] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 19:54:19] [INFO ] Invariant cache hit.
[2024-05-21 19:54:19] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5529 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:54:25] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 19:54:25] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-21 19:54:25] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-21 19:54:26] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:54:26] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:54:26] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-21 19:54:26] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:54:27] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/476 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:54:32] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:54:33] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:54:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:54:34] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:54:35] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-21 19:54:37] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:54:38] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:54:42] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 174 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 407/407 variables, and 484 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 16/16 constraints]
After SMT, in 35626ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 35627ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36121 ms. Remains : 232/232 places, 175/175 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p1 (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 23 factoid took 490 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:54:55] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 19:54:55] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 19:54:55] [INFO ] Invariant cache hit.
[2024-05-21 19:54:56] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:54:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:54:58] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:54:59] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:54:59] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-21 19:54:59] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:54:59] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-21 19:54:59] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-21 19:54:59] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-21 19:55:00] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-21 19:55:00] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7587 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37672ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37678ms
Finished structural reductions in LTL mode , in 1 iterations and 38030 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 204 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
RANDOM walk for 40000 steps (893 resets) in 1087 ms. (36 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40003 steps (184 resets) in 299 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (251 resets) in 329 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (254 resets) in 501 ms. (79 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (257 resets) in 300 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (144 resets) in 364 ms. (109 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (180 resets) in 290 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (257 resets) in 491 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (214 resets) in 319 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (216 resets) in 472 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (183 resets) in 172 ms. (231 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (179 resets) in 392 ms. (101 steps per ms) remains 11/11 properties
[2024-05-21 19:55:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 32/408 variables, 32/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 11 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:55:36] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/200 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 176/376 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 32/408 variables, 32/293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 9/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 302 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1849 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 2508ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 35830 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 6 place count 232 transition count 175
Applied a total of 6 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (889 resets) in 1152 ms. (34 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (169 resets) in 660 ms. (60 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (335 resets) in 625 ms. (63 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (331 resets) in 471 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (336 resets) in 538 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (152 resets) in 429 ms. (93 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (166 resets) in 474 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (332 resets) in 544 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (284 resets) in 340 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (286 resets) in 241 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (170 resets) in 290 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (173 resets) in 400 ms. (99 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 506550 steps, run timeout after 6032 ms. (steps per millisecond=83 ) properties seen :0 out of 11
Probabilistic random walk after 506550 steps, saw 73106 distinct states, run finished after 6033 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-21 19:56:22] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 19:56:22] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 32/407 variables, 32/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:56:23] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/407 variables, 32/297 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 306 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 2361ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 24727 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-21 19:56:49] [INFO ] Invariant cache hit.
[2024-05-21 19:56:50] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 19:56:50] [INFO ] Invariant cache hit.
[2024-05-21 19:56:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 19:56:50] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-21 19:56:50] [INFO ] Redundant transitions in 0 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 19:56:50] [INFO ] Invariant cache hit.
[2024-05-21 19:56:50] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5732 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:56:57] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-21 19:56:57] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-21 19:56:57] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-21 19:56:57] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 19:56:57] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:56:57] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-21 19:56:57] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:56:58] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/476 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:57:04] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:57:04] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 19:57:05] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:57:05] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:57:06] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:57:09] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:57:09] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:57:14] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 484 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 16/16 constraints]
After SMT, in 35828ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 35829ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36359 ms. Remains : 232/232 places, 175/175 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 23 factoid took 457 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 2258 reset in 218 ms.
Product exploration explored 100000 steps with 2249 reset in 252 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:57:27] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 19:57:28] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 19:57:28] [INFO ] Invariant cache hit.
[2024-05-21 19:57:28] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:57:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:57:31] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:57:31] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-21 19:57:31] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:57:31] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:57:31] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-21 19:57:31] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:57:32] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:57:32] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-21 19:57:32] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7737 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37821ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37822ms
Finished structural reductions in LTL mode , in 1 iterations and 38220 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-06 finished in 341950 ms.
[2024-05-21 19:58:06] [INFO ] Flatten gal took : 30 ms
[2024-05-21 19:58:06] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-21 19:58:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 177 transitions and 859 arcs took 3 ms.
Total runtime 1799882 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-30a

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/410/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: 4155
MODEL NAME: /home/mcc/execution/410/model
233 places, 177 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-30a-LTLFireability-00 CANNOT_COMPUTE
FORMULA DES-PT-30a-LTLFireability-02 CANNOT_COMPUTE
FORMULA DES-PT-30a-LTLFireability-03 CANNOT_COMPUTE
FORMULA DES-PT-30a-LTLFireability-06 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716321942187

--------------------
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
Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
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

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-30a"
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-30a, 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-171624188200700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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