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.r553-tall-171734901100196.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 ltsminxred
Input is FireWire-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901100196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 FireWire-PT-04-LTLFireability-00
FORMULA_NAME FireWire-PT-04-LTLFireability-01
FORMULA_NAME FireWire-PT-04-LTLFireability-02
FORMULA_NAME FireWire-PT-04-LTLFireability-03
FORMULA_NAME FireWire-PT-04-LTLFireability-04
FORMULA_NAME FireWire-PT-04-LTLFireability-05
FORMULA_NAME FireWire-PT-04-LTLFireability-06
FORMULA_NAME FireWire-PT-04-LTLFireability-07
FORMULA_NAME FireWire-PT-04-LTLFireability-08
FORMULA_NAME FireWire-PT-04-LTLFireability-09
FORMULA_NAME FireWire-PT-04-LTLFireability-10
FORMULA_NAME FireWire-PT-04-LTLFireability-11
FORMULA_NAME FireWire-PT-04-LTLFireability-12
FORMULA_NAME FireWire-PT-04-LTLFireability-13
FORMULA_NAME FireWire-PT-04-LTLFireability-14
FORMULA_NAME FireWire-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717353721938

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:42:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:42:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:42:03] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-02 18:42:03] [INFO ] Transformed 113 places.
[2024-06-02 18:42:03] [INFO ] Transformed 364 transitions.
[2024-06-02 18:42:03] [INFO ] Found NUPN structural information;
[2024-06-02 18:42:03] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 308/308 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 113 transition count 302
Applied a total of 6 rules in 31 ms. Remains 113 /113 variables (removed 0) and now considering 302/308 (removed 6) transitions.
[2024-06-02 18:42:03] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 18:42:03] [INFO ] Computed 8 invariants in 7 ms
[2024-06-02 18:42:03] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-02 18:42:03] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 18:42:03] [INFO ] Invariant cache hit.
[2024-06-02 18:42:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:42:03] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [36, 106, 111]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 450 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/113 places, 302/308 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 518 ms. Remains : 110/113 places, 302/308 transitions.
Support contains 38 out of 110 places after structural reductions.
[2024-06-02 18:42:04] [INFO ] Flatten gal took : 45 ms
[2024-06-02 18:42:04] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:42:04] [INFO ] Input system was already deterministic with 302 transitions.
Reduction of identical properties reduced properties to check from 34 to 31
RANDOM walk for 40000 steps (2199 resets) in 2288 ms. (17 steps per ms) remains 18/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (64 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (39 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (57 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 13/16 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (67 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (20 resets) in 20 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (60 resets) in 13 ms. (286 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (49 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (124 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
[2024-06-02 18:42:05] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 110 cols
[2024-06-02 18:42:05] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 18:42:05] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 2 (OVERLAPS) 82/105 variables, 5/28 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 82/110 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 5 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/112 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 272/377 variables, 105/217 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 38/255 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 5/382 variables, 3/258 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 3/261 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/262 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 3/385 variables, 2/264 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 2/266 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/385 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 1/386 variables, 1/267 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/386 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/386 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 267 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1443 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 84/105 variables, 5/26 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 84/110 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/112 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 272/377 variables, 105/217 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 38/255 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 11/266 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 5/382 variables, 3/269 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 3/272 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 18:42:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 1/275 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 0/275 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 3/385 variables, 2/277 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/385 variables, 2/279 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/385 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 1/386 variables, 1/280 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/386 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 0/386 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 280 constraints, problems are : Problem set: 1 solved, 12 unsolved in 2116 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 3/3 constraints]
After SMT, in 3619ms problems are : Problem set: 1 solved, 12 unsolved
Parikh walk visited 1 properties in 7736 ms.
Support contains 19 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 302/302 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 109 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 109 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 108 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 106 transition count 301
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 106 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 106 transition count 295
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 106 transition count 295
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 25 place count 103 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 28 place count 103 transition count 290
Applied a total of 28 rules in 79 ms. Remains 103 /110 variables (removed 7) and now considering 290/302 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 103/110 places, 290/302 transitions.
RANDOM walk for 40000 steps (2376 resets) in 857 ms. (46 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (69 resets) in 82 ms. (481 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (646 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (629 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (612 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (68 resets) in 104 ms. (380 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (614 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (622 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1753 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
[2024-06-02 18:42:17] [INFO ] Flow matrix only has 263 transitions (discarded 27 similar events)
// Phase 1: matrix 263 rows 103 cols
[2024-06-02 18:42:17] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:42:17] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 86/98 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 86/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 18:42:17] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:42:17] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/100 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 262/362 variables, 100/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 40/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 4/366 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/366 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/366 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 254 constraints, problems are : Problem set: 0 solved, 7 unsolved in 630 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 86/98 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 86/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/100 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 262/362 variables, 100/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 40/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 4/366 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/366 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 18:42:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:42:18] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/366 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/366 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 263 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1030 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 1680ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 2423 ms.
Support contains 12 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 290/290 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 288
Applied a total of 2 rules in 16 ms. Remains 102 /103 variables (removed 1) and now considering 288/290 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 102/103 places, 288/290 transitions.
RANDOM walk for 40000 steps (2482 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (67 resets) in 51 ms. (769 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (630 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (635 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (755 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (636 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
[2024-06-02 18:42:21] [INFO ] Flow matrix only has 261 transitions (discarded 27 similar events)
// Phase 1: matrix 261 rows 102 cols
[2024-06-02 18:42:21] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:42:21] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 87/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:42:21] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:42:21] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/98 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 260/358 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:42:21] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 5/363 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/363 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 151 constraints, problems are : Problem set: 0 solved, 5 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 87/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 260/358 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 5/363 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/363 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 156 constraints, problems are : Problem set: 0 solved, 5 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 102/102 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1275 ms.
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 288/288 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 100 transition count 286
Applied a total of 3 rules in 33 ms. Remains 100 /102 variables (removed 2) and now considering 286/288 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 100/102 places, 286/288 transitions.
RANDOM walk for 40000 steps (2612 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (50 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (659 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (661 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (731 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (608 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 345109 steps, run visited all 5 properties in 636 ms. (steps per millisecond=542 )
Probabilistic random walk after 345109 steps, saw 78638 distinct states, run finished after 639 ms. (steps per millisecond=540 ) properties seen :5
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 6 stabilizing places and 9 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' '!((G(!p0)||(!p0&&F(!p1)&&F(G(p0)))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 299
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 107 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 106 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 106 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 103 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 103 transition count 298
Applied a total of 18 rules in 28 ms. Remains 103 /110 variables (removed 7) and now considering 298/302 (removed 4) transitions.
[2024-06-02 18:42:25] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 103 cols
[2024-06-02 18:42:25] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:42:25] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:42:25] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:42:25] [INFO ] Invariant cache hit.
[2024-06-02 18:42:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:42:25] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 211 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/110 places, 298/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 102/110 places, 298/302 transitions.
Stuttering acceptance computed with spot in 295 ms :[p0, true, false, (AND p1 p0), (NOT p0), p1]
Running random walk in product with property : FireWire-PT-04-LTLFireability-00
Product exploration explored 100000 steps with 2 reset in 159 ms.
Product exploration explored 100000 steps with 0 reset in 73 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[false, (NOT p0)]
RANDOM walk for 3598 steps (241 resets) in 27 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[false, (NOT p0)]
Support contains 2 out of 102 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 : 102/102 places, 298/298 transitions.
Applied a total of 0 rules in 14 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:42:26] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 18:42:26] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:42:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:42:26] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:42:26] [INFO ] Invariant cache hit.
[2024-06-02 18:42:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:42:26] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-02 18:42:26] [INFO ] Redundant transitions in 15 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:42:26] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:42:26] [INFO ] Invariant cache hit.
[2024-06-02 18:42:26] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:42:27] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:42:27] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:42:27] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:42:28] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:42:31] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:42:31] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:42:31] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 153 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13560 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:42:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:42:44] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 23172 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 36955ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 36959ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37196 ms. Remains : 102/102 places, 298/298 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[false, (NOT p0)]
RANDOM walk for 2638 steps (152 resets) in 16 ms. (155 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[false, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 73 ms.
Stuttering criterion allowed to conclude after 49 steps with 1 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-00 finished in 39134 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)||(F(p2)&&p1))))'
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 107 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 106 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 106 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 103 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 103 transition count 298
Applied a total of 18 rules in 23 ms. Remains 103 /110 variables (removed 7) and now considering 298/302 (removed 4) transitions.
[2024-06-02 18:43:04] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 103 cols
[2024-06-02 18:43:04] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:43:04] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:43:04] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:43:04] [INFO ] Invariant cache hit.
[2024-06-02 18:43:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:04] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 206 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/110 places, 298/302 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 102/110 places, 298/302 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-04-LTLFireability-01
Product exploration explored 100000 steps with 2 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 178 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 103 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2541 resets) in 234 ms. (170 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (668 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (668 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (682 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
[2024-06-02 18:43:05] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 18:43:05] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:43:05] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 223/279 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 82/361 variables, 42/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/365 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/366 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/366 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 146 constraints, problems are : Problem set: 0 solved, 3 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 223/279 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 82/361 variables, 42/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/362 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/365 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/366 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/366 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 149 constraints, problems are : Problem set: 0 solved, 3 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 298/298 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 292
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 292
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 97 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 97 transition count 287
Applied a total of 21 rules in 15 ms. Remains 97 /102 variables (removed 5) and now considering 287/298 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 97/102 places, 287/298 transitions.
RANDOM walk for 40000 steps (2577 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (636 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (676 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (650 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 14706 steps, run visited all 3 properties in 58 ms. (steps per millisecond=253 )
Probabilistic random walk after 14706 steps, saw 4977 distinct states, run finished after 58 ms. (steps per millisecond=253 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 17 factoid took 381 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 298/298 transitions.
Applied a total of 0 rules in 13 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:43:06] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:43:06] [INFO ] Invariant cache hit.
[2024-06-02 18:43:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:43:06] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:43:06] [INFO ] Invariant cache hit.
[2024-06-02 18:43:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:06] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 18:43:06] [INFO ] Redundant transitions in 4 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:43:06] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:43:06] [INFO ] Invariant cache hit.
[2024-06-02 18:43:06] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:43:07] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:43:07] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:43:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:43:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:43:11] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2024-06-02 18:43:11] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:43:11] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 153 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13650 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:43:24] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:43:25] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 23273 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 37097ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37327 ms. Remains : 102/102 places, 298/298 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 110 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2587 resets) in 141 ms. (281 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (640 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (713 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (662 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
[2024-06-02 18:43:44] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:43:44] [INFO ] Invariant cache hit.
[2024-06-02 18:43:44] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 223/279 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 82/361 variables, 42/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/365 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/366 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/366 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 146 constraints, problems are : Problem set: 0 solved, 3 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 223/279 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 82/361 variables, 42/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/362 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/365 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/366 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/366 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 149 constraints, problems are : Problem set: 0 solved, 3 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 524ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 164 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 298/298 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 292
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 292
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 97 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 97 transition count 287
Applied a total of 21 rules in 35 ms. Remains 97 /102 variables (removed 5) and now considering 287/298 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 97/102 places, 287/298 transitions.
RANDOM walk for 40000 steps (2579 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (665 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (676 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (648 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 14706 steps, run visited all 3 properties in 107 ms. (steps per millisecond=137 )
Probabilistic random walk after 14706 steps, saw 4977 distinct states, run finished after 107 ms. (steps per millisecond=137 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 17 factoid took 381 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 60 ms.
Product exploration explored 100000 steps with 1 reset in 66 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 298/298 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:43:46] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:43:46] [INFO ] Invariant cache hit.
[2024-06-02 18:43:46] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:43:46] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:43:46] [INFO ] Invariant cache hit.
[2024-06-02 18:43:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:46] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 18:43:46] [INFO ] Redundant transitions in 4 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:43:46] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:43:46] [INFO ] Invariant cache hit.
[2024-06-02 18:43:46] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:43:47] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:43:47] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:43:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:43:48] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:43:50] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:43:50] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:43:51] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 153 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13950 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:44:03] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:44:05] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 23212 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 37326ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37329ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37582 ms. Remains : 102/102 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-01 finished in 79694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Applied a total of 2 rules in 10 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:44:23] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 18:44:23] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:44:24] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-02 18:44:24] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:44:24] [INFO ] Invariant cache hit.
[2024-06-02 18:44:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:44:24] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 443 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 300/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 454 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-02 finished in 555 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(((p1 U X(p2))&&p0))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Applied a total of 2 rules in 3 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:44:24] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:44:24] [INFO ] Invariant cache hit.
[2024-06-02 18:44:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:44:24] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:44:24] [INFO ] Invariant cache hit.
[2024-06-02 18:44:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:44:24] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 190 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 300/302 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-03 finished in 327 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&&((p1||X(p2)) U (p3 U p2)))))'
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 18:44:24] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 110 cols
[2024-06-02 18:44:24] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:44:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:44:24] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 18:44:24] [INFO ] Invariant cache hit.
[2024-06-02 18:44:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:44:24] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 221 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/110 places, 302/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 224 ms. Remains : 109/110 places, 302/302 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-05 finished in 441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(p1)))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Applied a total of 2 rules in 2 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:44:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 18:44:25] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:44:25] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:44:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:44:25] [INFO ] Invariant cache hit.
[2024-06-02 18:44:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:44:25] [INFO ] Implicit Places using invariants and state equation in 160 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 217 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 300/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 221 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-04-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-06 finished in 301 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(!p0)&&F((G(F(!p1))||(!p2&&F(!p1))))))))'
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Applied a total of 2 rules in 3 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:44:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:44:25] [INFO ] Invariant cache hit.
[2024-06-02 18:44:25] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:44:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:44:25] [INFO ] Invariant cache hit.
[2024-06-02 18:44:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:44:25] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2024-06-02 18:44:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:44:25] [INFO ] Invariant cache hit.
[2024-06-02 18:44:25] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 18:44:27] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:44:27] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:44:27] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:44:27] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:44:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/382 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 39/158 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 1/383 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 0/383 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 159 constraints, problems are : Problem set: 0 solved, 299 unsolved in 12237 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/382 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 39/158 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 299/457 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 18:44:42] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 459 constraints, problems are : Problem set: 0 solved, 299 unsolved in 26418 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 6/6 constraints]
After SMT, in 38834ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 38838ms
Starting structural reductions in LTL mode, iteration 1 : 109/110 places, 300/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39074 ms. Remains : 109/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 233 ms :[p0, p0, p0, (AND p0 p1), (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-04-LTLFireability-07 finished in 39644 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&&G(p1)))))'
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 105 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 105 transition count 300
Applied a total of 14 rules in 19 ms. Remains 105 /110 variables (removed 5) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:45:05] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
// Phase 1: matrix 267 rows 105 cols
[2024-06-02 18:45:05] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:45:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:45:05] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
[2024-06-02 18:45:05] [INFO ] Invariant cache hit.
[2024-06-02 18:45:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:45:05] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 221 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/110 places, 300/302 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 104/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 2 reset in 103 ms.
Computed a total of 4 stabilizing places and 7 stable transitions
Computed a total of 4 stabilizing places and 7 stable transitions
Detected a total of 4/104 stabilizing places and 7/300 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 489 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 2486 steps (134 resets) in 9 ms. (248 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 (NOT p0))))
Knowledge based reduction with 8 factoid took 564 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-04-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-04-LTLFireability-08 finished in 1757 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 X(!p1)))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Applied a total of 2 rules in 2 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:45:06] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 18:45:06] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:45:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:45:06] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:45:06] [INFO ] Invariant cache hit.
[2024-06-02 18:45:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:45:06] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 184 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 300/302 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 106 ms :[p1, p1, p1]
Running random walk in product with property : FireWire-PT-04-LTLFireability-09
Product exploration explored 100000 steps with 33355 reset in 102 ms.
Product exploration explored 100000 steps with 33456 reset in 107 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[p1, p1, p1]
RANDOM walk for 40000 steps (2201 resets) in 125 ms. (317 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (81 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
[2024-06-02 18:45:07] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2024-06-02 18:45:07] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:45:07] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/78 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/101 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 270/371 variables, 101/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 38/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/378 variables, 5/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/381 variables, 2/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/382 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/382 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 152 constraints, problems are : Problem set: 1 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/101 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 270/371 variables, 101/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 38/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/378 variables, 5/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/381 variables, 2/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/382 variables, 1/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/382 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 153 constraints, problems are : Problem set: 1 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 300/300 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 296
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 107 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 106 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 103 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 103 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 103 transition count 293
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 103 transition count 293
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 35 place count 98 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 98 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 97 transition count 287
Applied a total of 38 rules in 23 ms. Remains 97 /108 variables (removed 11) and now considering 287/300 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 97/108 places, 287/300 transitions.
RANDOM walk for 40000 steps (2486 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (66 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 395 steps, run visited all 1 properties in 4 ms. (steps per millisecond=98 )
Probabilistic random walk after 395 steps, saw 304 distinct states, run finished after 4 ms. (steps per millisecond=98 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 161 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 105 ms :[p1, p1, p1]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 300/300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 106 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 105 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 103 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 103 transition count 298
Applied a total of 12 rules in 19 ms. Remains 103 /108 variables (removed 5) and now considering 298/300 (removed 2) transitions.
[2024-06-02 18:45:08] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
// Phase 1: matrix 268 rows 103 cols
[2024-06-02 18:45:08] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:45:08] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:45:08] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:45:08] [INFO ] Invariant cache hit.
[2024-06-02 18:45:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:45:08] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-02 18:45:08] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:45:08] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:45:08] [INFO ] Invariant cache hit.
[2024-06-02 18:45:08] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:45:09] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:45:09] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:45:09] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:45:09] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 267/369 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 40/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 1/370 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:45:15] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/371 variables, and 152 constraints, problems are : Problem set: 0 solved, 295 unsolved in 12620 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 267/369 variables, 102/111 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 295/446 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:45:24] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:45:25] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/370 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/370 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/371 variables, and 449 constraints, problems are : Problem set: 0 solved, 295 unsolved in 19457 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
After SMT, in 32258ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 32262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/108 places, 298/300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32479 ms. Remains : 103/108 places, 298/300 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 99 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[p1, p1, p1]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (2523 resets) in 144 ms. (275 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (69 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (55 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
[2024-06-02 18:45:41] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:45:41] [INFO ] Invariant cache hit.
[2024-06-02 18:45:41] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 72/76 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 243/319 variables, 76/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 28/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/368 variables, 25/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 12/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/370 variables, 2/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/370 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/371 variables, and 147 constraints, problems are : Problem set: 1 solved, 2 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/76 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 243/319 variables, 76/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 28/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/368 variables, 25/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 12/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 2/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/370 variables, 2/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/371 variables, and 149 constraints, problems are : Problem set: 1 solved, 2 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 381ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 298/298 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 103 transition count 293
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 103 transition count 293
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 98 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 98 transition count 288
Applied a total of 20 rules in 14 ms. Remains 98 /103 variables (removed 5) and now considering 288/298 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 98/103 places, 288/298 transitions.
RANDOM walk for 40000 steps (2532 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (69 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (64 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 395 steps, run visited all 2 properties in 5 ms. (steps per millisecond=79 )
Probabilistic random walk after 395 steps, saw 304 distinct states, run finished after 5 ms. (steps per millisecond=79 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 297 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 114 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 116 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 1 reset in 72 ms.
Product exploration explored 100000 steps with 1 reset in 70 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 298/298 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:45:42] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:45:42] [INFO ] Invariant cache hit.
[2024-06-02 18:45:42] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:45:42] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:45:42] [INFO ] Invariant cache hit.
[2024-06-02 18:45:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:45:42] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-06-02 18:45:42] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:45:42] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:45:42] [INFO ] Invariant cache hit.
[2024-06-02 18:45:42] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:45:43] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:45:43] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:45:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:45:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 267/369 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 40/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 1/370 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:45:49] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/371 variables, and 152 constraints, problems are : Problem set: 0 solved, 295 unsolved in 12920 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 267/369 variables, 102/111 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 295/446 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:45:59] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:45:59] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/370 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/370 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/371 variables, and 449 constraints, problems are : Problem set: 0 solved, 295 unsolved in 19126 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
After SMT, in 32224ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 32226ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32435 ms. Remains : 103/103 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-09 finished in 68148 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)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F(!p2))&&(!p0 U (p1||G(!p0)))))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Applied a total of 2 rules in 3 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:46:14] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 18:46:14] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:46:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:46:14] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:46:15] [INFO ] Invariant cache hit.
[2024-06-02 18:46:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:46:15] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 300/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 214 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND p0 (NOT p1)), true, (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), p2]
Running random walk in product with property : FireWire-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 14 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 56 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 107 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (2309 resets) in 199 ms. (200 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (24 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 30 ms. (1290 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 2107912 steps, run timeout after 3001 ms. (steps per millisecond=702 ) properties seen :4 out of 5
Probabilistic random walk after 2107912 steps, saw 412021 distinct states, run finished after 3005 ms. (steps per millisecond=701 ) properties seen :4
[2024-06-02 18:46:18] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2024-06-02 18:46:18] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:46:18] [INFO ] State equation strengthened by 40 read => feed constraints.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 3/382 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/108 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 263 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Support contains 3 out of 108 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 : 108/108 places, 300/300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 106 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 105 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 102 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 102 transition count 298
Applied a total of 16 rules in 14 ms. Remains 102 /108 variables (removed 6) and now considering 298/300 (removed 2) transitions.
[2024-06-02 18:46:19] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 18:46:19] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:46:19] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 18:46:19] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:46:19] [INFO ] Invariant cache hit.
[2024-06-02 18:46:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:46:19] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-02 18:46:19] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:46:19] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:46:19] [INFO ] Invariant cache hit.
[2024-06-02 18:46:19] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:46:20] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:46:20] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:46:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:46:21] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:46:23] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:46:24] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:46:24] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 153 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13356 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:46:36] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 23747 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 37258ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37261ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/108 places, 298/300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37476 ms. Remains : 102/108 places, 298/300 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2482 resets) in 92 ms. (430 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-06-02 18:46:57] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:46:57] [INFO ] Invariant cache hit.
[2024-06-02 18:46:57] [INFO ] State equation strengthened by 40 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) 50/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/270 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/363 variables, 46/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/366 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/366 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 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) 50/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/270 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/363 variables, 46/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/366 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/366 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 253ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 298/298 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 292
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 292
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 97 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 97 transition count 287
Applied a total of 21 rules in 15 ms. Remains 97 /102 variables (removed 5) and now considering 287/298 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 97/102 places, 287/298 transitions.
RANDOM walk for 36167 steps (2289 resets) in 49 ms. (723 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 172 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 67 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 72 ms :[true, p0, p0]
Product exploration explored 100000 steps with 1 reset in 55 ms.
Product exploration explored 100000 steps with 1 reset in 54 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 298/298 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:46:57] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:46:57] [INFO ] Invariant cache hit.
[2024-06-02 18:46:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:46:57] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:46:57] [INFO ] Invariant cache hit.
[2024-06-02 18:46:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:46:58] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-02 18:46:58] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:46:58] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:46:58] [INFO ] Invariant cache hit.
[2024-06-02 18:46:58] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:46:59] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:46:59] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:46:59] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:47:00] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 153 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13348 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:47:15] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-02 18:47:16] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 23636 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 37143ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37369 ms. Remains : 102/102 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-10 finished in 80398 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&&(X(p2)||p1)))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Applied a total of 2 rules in 2 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:47:35] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 18:47:35] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:47:35] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:47:35] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:47:35] [INFO ] Invariant cache hit.
[2024-06-02 18:47:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:47:35] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 220 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 300/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FireWire-PT-04-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 73 ms.
Product exploration explored 100000 steps with 0 reset in 67 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND p1 p0)), (X (AND p1 p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 119 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (2258 resets) in 109 ms. (363 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (595 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (15 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
[2024-06-02 18:47:36] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2024-06-02 18:47:36] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:47:36] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 270/372 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 38/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/378 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/381 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/382 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/382 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 96/102 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 270/372 variables, 102/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 38/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 1/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/378 variables, 4/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/381 variables, 2/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/382 variables, 1/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/382 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 153 constraints, problems are : Problem set: 1 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 300/300 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 296
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 107 transition count 295
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 106 transition count 295
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 104 transition count 299
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 104 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 104 transition count 293
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 22 place count 104 transition count 291
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 29 place count 99 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 99 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 98 transition count 285
Applied a total of 33 rules in 23 ms. Remains 98 /108 variables (removed 10) and now considering 285/300 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 98/108 places, 285/300 transitions.
RANDOM walk for 40000 steps (2592 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (635 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1162 steps, run visited all 1 properties in 4 ms. (steps per millisecond=290 )
Probabilistic random walk after 1162 steps, saw 683 distinct states, run finished after 4 ms. (steps per millisecond=290 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND p1 p0)), (X (AND p1 p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 358 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 300/300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 104 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 104 transition count 298
Applied a total of 12 rules in 12 ms. Remains 104 /108 variables (removed 4) and now considering 298/300 (removed 2) transitions.
[2024-06-02 18:47:37] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
// Phase 1: matrix 268 rows 104 cols
[2024-06-02 18:47:37] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:47:37] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:47:37] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:47:37] [INFO ] Invariant cache hit.
[2024-06-02 18:47:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:47:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-06-02 18:47:37] [INFO ] Redundant transitions in 1 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 18:47:37] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:47:37] [INFO ] Invariant cache hit.
[2024-06-02 18:47:37] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 18:47:38] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:47:38] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:47:38] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 267/371 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 297 unsolved in 12314 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 267/371 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 297/449 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 18:47:52] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:47:53] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:47:54] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 453 constraints, problems are : Problem set: 0 solved, 297 unsolved in 22482 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 6/6 constraints]
After SMT, in 34967ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 34969ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/108 places, 298/300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35192 ms. Remains : 104/108 places, 298/300 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (AND p0 p2 p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (AND p0 p2 p1))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 108 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (2361 resets) in 116 ms. (341 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40002 steps (609 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2024-06-02 18:48:12] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:48:12] [INFO ] Invariant cache hit.
[2024-06-02 18:48:12] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 266/366 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/371 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/100 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 266/366 variables, 100/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 40/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 1/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/371 variables, 4/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-02 18:48:12] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/372 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/372 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 152 constraints, problems are : Problem set: 1 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 304ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 298/298 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 104 transition count 293
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 104 transition count 291
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 99 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 99 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 98 transition count 285
Applied a total of 21 rules in 12 ms. Remains 98 /104 variables (removed 6) and now considering 285/298 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 98/104 places, 285/298 transitions.
RANDOM walk for 40000 steps (2553 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (671 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1162 steps, run visited all 1 properties in 4 ms. (steps per millisecond=290 )
Probabilistic random walk after 1162 steps, saw 683 distinct states, run finished after 4 ms. (steps per millisecond=290 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (AND p0 p2 p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (AND p0 p2 p1))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 18 factoid took 324 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 2 reset in 80 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 298/298 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:48:13] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:48:13] [INFO ] Invariant cache hit.
[2024-06-02 18:48:13] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:48:13] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:48:13] [INFO ] Invariant cache hit.
[2024-06-02 18:48:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:48:13] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 18:48:13] [INFO ] Redundant transitions in 1 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 18:48:13] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:48:13] [INFO ] Invariant cache hit.
[2024-06-02 18:48:13] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 18:48:15] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2024-06-02 18:48:15] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:48:15] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 267/371 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 297 unsolved in 12231 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 267/371 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 297/449 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 18:48:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:48:30] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-02 18:48:30] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 453 constraints, problems are : Problem set: 0 solved, 297 unsolved in 23198 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 6/6 constraints]
After SMT, in 35618ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 35621ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35865 ms. Remains : 104/104 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-11 finished in 74183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p0)&&F(p1))))))'
Support contains 1 out of 110 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 18:48:49] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 110 cols
[2024-06-02 18:48:49] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:48:49] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:48:49] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 18:48:49] [INFO ] Invariant cache hit.
[2024-06-02 18:48:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:48:49] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 213 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/110 places, 302/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 109/110 places, 302/302 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-12 finished in 286 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) U ((X(!p0)&&(p1 U !p2))||X(G(!p0)))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Applied a total of 2 rules in 3 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:48:49] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 18:48:49] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:48:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:48:49] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 18:48:49] [INFO ] Invariant cache hit.
[2024-06-02 18:48:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:48:50] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 197 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 300/302 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 p2), true, (AND p0 p2), p2]
Running random walk in product with property : FireWire-PT-04-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 18 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-04-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-04-LTLFireability-13 finished in 630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 109 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 109 transition count 300
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 108 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 107 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 107 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 105 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 105 transition count 299
Applied a total of 14 rules in 14 ms. Remains 105 /110 variables (removed 5) and now considering 299/302 (removed 3) transitions.
[2024-06-02 18:48:50] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
// Phase 1: matrix 269 rows 105 cols
[2024-06-02 18:48:50] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:48:50] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:48:50] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2024-06-02 18:48:50] [INFO ] Invariant cache hit.
[2024-06-02 18:48:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:48:50] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 223 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/110 places, 299/302 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 104/110 places, 299/302 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 56 ms.
Product exploration explored 100000 steps with 0 reset in 48 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 150 steps (12 resets) in 5 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 299/299 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-06-02 18:48:51] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
// Phase 1: matrix 269 rows 104 cols
[2024-06-02 18:48:51] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:48:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:48:51] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2024-06-02 18:48:51] [INFO ] Invariant cache hit.
[2024-06-02 18:48:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:48:51] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 18:48:51] [INFO ] Redundant transitions in 2 ms returned []
Running 298 sub problems to find dead transitions.
[2024-06-02 18:48:51] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2024-06-02 18:48:51] [INFO ] Invariant cache hit.
[2024-06-02 18:48:51] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 18:48:52] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:48:53] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:48:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 268/372 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 153 constraints, problems are : Problem set: 0 solved, 298 unsolved in 11823 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 268/372 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 298/450 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 18:49:07] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:49:08] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:49:08] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 1/373 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 11 (OVERLAPS) 0/373 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 454 constraints, problems are : Problem set: 0 solved, 298 unsolved in 28374 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 6/6 constraints]
After SMT, in 40374ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40378ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40597 ms. Remains : 104/104 places, 299/299 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 129 steps (11 resets) in 6 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 45 ms.
Product exploration explored 100000 steps with 0 reset in 61 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 299/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-06-02 18:49:32] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2024-06-02 18:49:32] [INFO ] Invariant cache hit.
[2024-06-02 18:49:32] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:49:32] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2024-06-02 18:49:32] [INFO ] Invariant cache hit.
[2024-06-02 18:49:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:49:32] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-02 18:49:32] [INFO ] Redundant transitions in 1 ms returned []
Running 298 sub problems to find dead transitions.
[2024-06-02 18:49:32] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2024-06-02 18:49:32] [INFO ] Invariant cache hit.
[2024-06-02 18:49:32] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 18:49:34] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:49:34] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:49:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 268/372 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 153 constraints, problems are : Problem set: 0 solved, 298 unsolved in 11764 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 268/372 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 298/450 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 18:49:48] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:49:49] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:49:49] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 1/373 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 11 (OVERLAPS) 0/373 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 454 constraints, problems are : Problem set: 0 solved, 298 unsolved in 29051 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 6/6 constraints]
After SMT, in 40970ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40973ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41196 ms. Remains : 104/104 places, 299/299 transitions.
Treatment of property FireWire-PT-04-LTLFireability-15 finished in 83202 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)||(F(p2)&&p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U X(!p1)))))'
Found a Lengthening insensitive property : FireWire-PT-04-LTLFireability-09
Stuttering acceptance computed with spot in 253 ms :[p1, p1, p1]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 107 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 106 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 106 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 104 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 104 transition count 300
Applied a total of 12 rules in 15 ms. Remains 104 /110 variables (removed 6) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:50:14] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
// Phase 1: matrix 270 rows 104 cols
[2024-06-02 18:50:14] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:50:14] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:50:14] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
[2024-06-02 18:50:14] [INFO ] Invariant cache hit.
[2024-06-02 18:50:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:50:14] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 186 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 103/110 places, 300/302 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 205 ms. Remains : 103/110 places, 300/302 transitions.
Running random walk in product with property : FireWire-PT-04-LTLFireability-09
Product exploration explored 100000 steps with 33311 reset in 127 ms.
Stuttering criterion allowed to conclude after 92364 steps with 30853 reset in 120 ms.
Treatment of property FireWire-PT-04-LTLFireability-09 finished in 817 ms.
FORMULA FireWire-PT-04-LTLFireability-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F(!p2))&&(!p0 U (p1||G(!p0)))))))'
Found a Shortening insensitive property : FireWire-PT-04-LTLFireability-10
Stuttering acceptance computed with spot in 160 ms :[(AND p0 (NOT p1)), true, (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), p2]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 107 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 106 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 106 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 103 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 103 transition count 301
Applied a total of 15 rules in 8 ms. Remains 103 /110 variables (removed 7) and now considering 301/302 (removed 1) transitions.
[2024-06-02 18:50:14] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
// Phase 1: matrix 268 rows 103 cols
[2024-06-02 18:50:14] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:50:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:50:14] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
[2024-06-02 18:50:14] [INFO ] Invariant cache hit.
[2024-06-02 18:50:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:50:15] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 203 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 102/110 places, 301/302 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 214 ms. Remains : 102/110 places, 301/302 transitions.
Running random walk in product with property : FireWire-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 2 reset in 53 ms.
Product exploration explored 100000 steps with 8 reset in 68 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 113 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (2554 resets) in 147 ms. (270 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (35 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
[2024-06-02 18:50:15] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
// Phase 1: matrix 268 rows 102 cols
[2024-06-02 18:50:15] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:50:15] [INFO ] State equation strengthened by 40 read => feed constraints.
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 220/273 variables, 53/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 18/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/366 variables, 46/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 2/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 22/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/369 variables, 3/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/369 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/370 variables, and 146 constraints, problems are : Problem set: 1 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 220/273 variables, 53/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 18/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/366 variables, 46/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 2/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 22/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/369 variables, 3/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/369 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/370 variables, and 147 constraints, problems are : Problem set: 1 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 276ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 301/301 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 102 transition count 292
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 102 transition count 292
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 97 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 97 transition count 287
Applied a total of 24 rules in 17 ms. Remains 97 /102 variables (removed 5) and now considering 287/301 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 97/102 places, 287/301 transitions.
RANDOM walk for 40000 steps (2487 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (17 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 565 steps, run visited all 1 properties in 4 ms. (steps per millisecond=141 )
Probabilistic random walk after 565 steps, saw 437 distinct states, run finished after 4 ms. (steps per millisecond=141 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 274 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 96 ms :[true, p0, p0]
Support contains 3 out of 102 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 : 102/102 places, 301/301 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 298
Applied a total of 3 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 298/301 (removed 3) transitions.
[2024-06-02 18:50:16] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 18:50:16] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:50:16] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:50:16] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:50:16] [INFO ] Invariant cache hit.
[2024-06-02 18:50:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:50:16] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 18:50:16] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:50:16] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:50:16] [INFO ] Invariant cache hit.
[2024-06-02 18:50:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:50:17] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:50:17] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:50:17] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:50:18] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:50:20] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:50:20] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:50:21] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 153 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13335 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:50:33] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:50:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 23874 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 37373ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/102 places, 298/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37573 ms. Remains : 102/102 places, 298/301 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[true, p0, p0]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 38414 steps (2514 resets) in 123 ms. (309 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 89 ms :[true, p0, p0]
Product exploration explored 100000 steps with 0 reset in 48 ms.
Product exploration explored 100000 steps with 0 reset in 54 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 298/298 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:50:54] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:50:54] [INFO ] Invariant cache hit.
[2024-06-02 18:50:54] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:50:54] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:50:54] [INFO ] Invariant cache hit.
[2024-06-02 18:50:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:50:54] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 18:50:54] [INFO ] Redundant transitions in 4 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:50:54] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 18:50:54] [INFO ] Invariant cache hit.
[2024-06-02 18:50:54] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:50:55] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:50:56] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-06-02 18:50:56] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:50:57] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:50:59] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:50:59] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:50:59] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 153 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13475 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:51:12] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:51:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 23257 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 36902ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 36907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37110 ms. Remains : 102/102 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-10 finished in 77302 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&&(X(p2)||p1)))))'
Found a Lengthening insensitive property : FireWire-PT-04-LTLFireability-11
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 110/110 places, 302/302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 109 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 109 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 108 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 107 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 107 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 105 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 105 transition count 300
Applied a total of 12 rules in 8 ms. Remains 105 /110 variables (removed 5) and now considering 300/302 (removed 2) transitions.
[2024-06-02 18:51:32] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
// Phase 1: matrix 270 rows 105 cols
[2024-06-02 18:51:32] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:51:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:51:32] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
[2024-06-02 18:51:32] [INFO ] Invariant cache hit.
[2024-06-02 18:51:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:51:32] [INFO ] Implicit Places using invariants and state equation in 232 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 290 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 104/110 places, 300/302 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 300 ms. Remains : 104/110 places, 300/302 transitions.
Running random walk in product with property : FireWire-PT-04-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 62 ms.
Product exploration explored 100000 steps with 1 reset in 67 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND p1 p0)), (X (AND p1 p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 119 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (2455 resets) in 137 ms. (289 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (683 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
[2024-06-02 18:51:32] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
// Phase 1: matrix 270 rows 104 cols
[2024-06-02 18:51:32] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:51:32] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 268/368 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/373 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/374 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/100 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 268/368 variables, 100/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 40/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/373 variables, 4/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/374 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 151 constraints, problems are : Problem set: 1 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 295ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 300/300 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 104 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 104 transition count 293
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 104 transition count 291
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 19 place count 99 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 99 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 98 transition count 285
Applied a total of 23 rules in 15 ms. Remains 98 /104 variables (removed 6) and now considering 285/300 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 98/104 places, 285/300 transitions.
RANDOM walk for 40000 steps (2539 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (605 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1162 steps, run visited all 1 properties in 5 ms. (steps per millisecond=232 )
Probabilistic random walk after 1162 steps, saw 683 distinct states, run finished after 5 ms. (steps per millisecond=232 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND p1 p0)), (X (AND p1 p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 416 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 300/300 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 298
Applied a total of 2 rules in 10 ms. Remains 104 /104 variables (removed 0) and now considering 298/300 (removed 2) transitions.
[2024-06-02 18:51:33] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
// Phase 1: matrix 268 rows 104 cols
[2024-06-02 18:51:33] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:51:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:51:33] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:51:33] [INFO ] Invariant cache hit.
[2024-06-02 18:51:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:51:34] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 18:51:34] [INFO ] Redundant transitions in 2 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 18:51:34] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:51:34] [INFO ] Invariant cache hit.
[2024-06-02 18:51:34] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 18:51:35] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:51:35] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:51:35] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 267/371 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 297 unsolved in 11759 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 267/371 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 297/449 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 18:51:49] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:51:50] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-02 18:51:50] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 453 constraints, problems are : Problem set: 0 solved, 297 unsolved in 22852 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 6/6 constraints]
After SMT, in 34784ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 34788ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 298/300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35003 ms. Remains : 104/104 places, 298/300 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (AND p0 p2 p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (AND p0 p2 p1))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 108 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (2341 resets) in 115 ms. (344 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (637 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (13 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
[2024-06-02 18:52:09] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:52:09] [INFO ] Invariant cache hit.
[2024-06-02 18:52:09] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 266/366 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/371 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/100 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 266/366 variables, 100/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 40/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 1/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/371 variables, 4/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-02 18:52:09] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/372 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/372 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 152 constraints, problems are : Problem set: 1 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 332ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 298/298 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 104 transition count 293
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 104 transition count 291
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 99 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 99 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 98 transition count 285
Applied a total of 21 rules in 13 ms. Remains 98 /104 variables (removed 6) and now considering 285/298 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 98/104 places, 285/298 transitions.
RANDOM walk for 40000 steps (2538 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (687 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1162 steps, run visited all 1 properties in 6 ms. (steps per millisecond=193 )
Probabilistic random walk after 1162 steps, saw 683 distinct states, run finished after 6 ms. (steps per millisecond=193 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (AND p0 p2 p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (AND p0 p2 p1))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 18 factoid took 491 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 3 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 298/298 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:52:10] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:52:10] [INFO ] Invariant cache hit.
[2024-06-02 18:52:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:52:10] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:52:10] [INFO ] Invariant cache hit.
[2024-06-02 18:52:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:52:10] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-06-02 18:52:10] [INFO ] Redundant transitions in 2 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 18:52:10] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 18:52:10] [INFO ] Invariant cache hit.
[2024-06-02 18:52:10] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 18:52:12] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:52:12] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:52:12] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 267/371 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 297 unsolved in 12057 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 267/371 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 297/449 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 18:52:26] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:52:27] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:52:27] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 453 constraints, problems are : Problem set: 0 solved, 297 unsolved in 22968 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 6/6 constraints]
After SMT, in 35212ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 35217ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35450 ms. Remains : 104/104 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-11 finished in 74080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-02 18:52:46] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:52:46] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 18:52:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 302 transitions and 1094 arcs took 4 ms.
Total runtime 643064 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-04-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-04-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-04-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-04-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-04-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717354366963

--------------------
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
mcc2024
ltl formula name FireWire-PT-04-LTLFireability-01
ltl formula formula --ltl=/tmp/2665/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 110 places, 302 transitions and 1094 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2665/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2665/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2665/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2665/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 111 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 111, there are 402 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~950 levels ~10000 states ~133652 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~422!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2670
pnml2lts-mc( 0/ 4): unique states count: 8839
pnml2lts-mc( 0/ 4): unique transitions count: 124537
pnml2lts-mc( 0/ 4): - self-loop count: 15290
pnml2lts-mc( 0/ 4): - claim dead count: 30272
pnml2lts-mc( 0/ 4): - claim found count: 50174
pnml2lts-mc( 0/ 4): - claim success count: 8894
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2551
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9028 states 127679 transitions, fanout: 14.143
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 100311, Transitions per second: 1418656
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 9.2 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 305 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name FireWire-PT-04-LTLFireability-09
ltl formula formula --ltl=/tmp/2665/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 110 places, 302 transitions and 1094 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2665/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2665/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2665/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2665/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 111 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 111, there are 319 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~10!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 118
pnml2lts-mc( 0/ 4): unique states count: 172
pnml2lts-mc( 0/ 4): unique transitions count: 892
pnml2lts-mc( 0/ 4): - self-loop count: 48
pnml2lts-mc( 0/ 4): - claim dead count: 333
pnml2lts-mc( 0/ 4): - claim found count: 28
pnml2lts-mc( 0/ 4): - claim success count: 179
pnml2lts-mc( 0/ 4): - cum. max stack depth: 62
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 179 states 936 transitions, fanout: 5.229
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 15.8 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 305 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name FireWire-PT-04-LTLFireability-10
ltl formula formula --ltl=/tmp/2665/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 110 places, 302 transitions and 1094 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2665/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2665/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2665/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2665/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 112 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 111, there are 340 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~147!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 365
pnml2lts-mc( 0/ 4): unique states count: 1065
pnml2lts-mc( 0/ 4): unique transitions count: 6355
pnml2lts-mc( 0/ 4): - self-loop count: 903
pnml2lts-mc( 0/ 4): - claim dead count: 1098
pnml2lts-mc( 0/ 4): - claim found count: 1101
pnml2lts-mc( 0/ 4): - claim success count: 1076
pnml2lts-mc( 0/ 4): - cum. max stack depth: 561
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1076 states 6413 transitions, fanout: 5.960
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 107600, Transitions per second: 641300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 11.8 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 305 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name FireWire-PT-04-LTLFireability-11
ltl formula formula --ltl=/tmp/2665/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 110 places, 302 transitions and 1094 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2665/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2665/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2665/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2665/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 111 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 111, there are 366 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~86!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 70
pnml2lts-mc( 0/ 4): unique states count: 274
pnml2lts-mc( 0/ 4): unique transitions count: 1721
pnml2lts-mc( 0/ 4): - self-loop count: 207
pnml2lts-mc( 0/ 4): - claim dead count: 132
pnml2lts-mc( 0/ 4): - claim found count: 220
pnml2lts-mc( 0/ 4): - claim success count: 282
pnml2lts-mc( 0/ 4): - cum. max stack depth: 209
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 282 states 1767 transitions, fanout: 6.266
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28200, Transitions per second: 176700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 14.7 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 305 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name FireWire-PT-04-LTLFireability-15
ltl formula formula --ltl=/tmp/2665/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 110 places, 302 transitions and 1094 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2665/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2665/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2665/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2665/ltl_4_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 112 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 111, there are 305 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~8!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8
pnml2lts-mc( 0/ 4): unique states count: 31
pnml2lts-mc( 0/ 4): unique transitions count: 114
pnml2lts-mc( 0/ 4): - self-loop count: 15
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 12
pnml2lts-mc( 0/ 4): - claim success count: 39
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 39 states 137 transitions, fanout: 3.513
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 24.6 B/state, compr.: 5.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 305 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="FireWire-PT-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FireWire-PT-04, 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 r553-tall-171734901100196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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