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.r549-tall-171734898000196.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898000196
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:02:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:02:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:02:08] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 22:02:08] [INFO ] Transformed 113 places.
[2024-06-02 22:02:08] [INFO ] Transformed 364 transitions.
[2024-06-02 22:02:08] [INFO ] Found NUPN structural information;
[2024-06-02 22:02:08] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 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 32 ms. Remains 113 /113 variables (removed 0) and now considering 302/308 (removed 6) transitions.
[2024-06-02 22:02:08] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 22:02:08] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 22:02:08] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-02 22:02:08] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 22:02:08] [INFO ] Invariant cache hit.
[2024-06-02 22:02:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:02:09] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [36, 106, 111]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 506 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 10 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 566 ms. Remains : 110/113 places, 302/308 transitions.
Support contains 38 out of 110 places after structural reductions.
[2024-06-02 22:02:09] [INFO ] Flatten gal took : 49 ms
[2024-06-02 22:02:09] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:02:09] [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 (2242 resets) in 2056 ms. (19 steps per ms) remains 16/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 12/16 properties
BEST_FIRST walk for 4004 steps (20 resets) in 22 ms. (174 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (48 resets) in 22 ms. (174 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (49 resets) in 50 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (63 resets) in 27 ms. (143 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (55 resets) in 17 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (13 resets) in 30 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (62 resets) in 9 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (124 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
[2024-06-02 22:02:10] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 110 cols
[2024-06-02 22:02:10] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 22:02:10] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 2 (OVERLAPS) 82/103 variables, 4/25 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 82/107 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-02 22:02:10] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/108 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-02 22:02:10] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/109 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/105 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/112 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-02 22:02:11] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 272/377 variables, 105/218 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 38/256 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 5/382 variables, 3/259 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 3/262 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/382 variables, 1/263 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/382 variables, 0/263 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 3/385 variables, 2/265 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/385 variables, 2/267 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/385 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 1/386 variables, 1/268 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/386 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/386 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 268 constraints, problems are : Problem set: 1 solved, 11 unsolved in 1962 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/12 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 84/103 variables, 4/23 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 84/107 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/109 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/105 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 2/112 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 272/377 variables, 105/218 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 38/256 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 10/266 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 5/382 variables, 3/269 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 3/272 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/382 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/382 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-02 22:02:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/382 variables, 1/275 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/382 variables, 0/275 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 3/385 variables, 2/277 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/385 variables, 2/279 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/385 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 1/386 variables, 1/280 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/386 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 0/386 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 280 constraints, problems are : Problem set: 1 solved, 11 unsolved in 2640 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: 11/12 constraints, Known Traps: 4/4 constraints]
After SMT, in 4662ms problems are : Problem set: 1 solved, 11 unsolved
Parikh walk visited 0 properties in 9174 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 0 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 66 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 66 ms. Remains : 103/110 places, 290/302 transitions.
RANDOM walk for 40000 steps (2428 resets) in 865 ms. (46 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (60 resets) in 143 ms. (277 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (645 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (653 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (682 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (58 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (623 resets) in 32 ms. (1212 steps per ms) remains 6/6 properties
[2024-06-02 22:02:24] [INFO ] Flow matrix only has 263 transitions (discarded 27 similar events)
// Phase 1: matrix 263 rows 103 cols
[2024-06-02 22:02:24] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:02:24] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 87/97 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 87/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:02:24] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:02:25] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/99 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 262/361 variables, 99/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 40/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:02:25] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 5/366 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/366 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/366 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 255 constraints, problems are : Problem set: 0 solved, 6 unsolved in 811 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: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 87/97 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 87/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/99 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:02:25] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 262/361 variables, 99/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 40/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 5/366 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/366 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/366 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 262 constraints, problems are : Problem set: 0 solved, 6 unsolved in 663 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: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 1519ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2000 ms.
Support contains 10 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
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 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 4 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 5 place count 100 transition count 286
Applied a total of 5 rules in 28 ms. Remains 100 /103 variables (removed 3) and now considering 286/290 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 100/103 places, 286/290 transitions.
RANDOM walk for 40000 steps (2558 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (59 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (652 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (638 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (657 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (651 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 345109 steps, run visited all 6 properties in 568 ms. (steps per millisecond=607 )
Probabilistic random walk after 345109 steps, saw 78638 distinct states, run finished after 575 ms. (steps per millisecond=600 ) properties seen :6
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 1 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 33 ms. Remains 103 /110 variables (removed 7) and now considering 298/302 (removed 4) transitions.
[2024-06-02 22:02:29] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 103 cols
[2024-06-02 22:02:29] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:02:29] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 22:02:29] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:02:29] [INFO ] Invariant cache hit.
[2024-06-02 22:02:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:02:29] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 303 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 7 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 344 ms. Remains : 102/110 places, 298/302 transitions.
Stuttering acceptance computed with spot in 345 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 1 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 79 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 86 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 53 ms :[false, (NOT p0)]
RANDOM walk for 607 steps (43 resets) in 6 ms. (86 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 137 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 69 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 70 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 7 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 22:02:30] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 22:02:30] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:02:30] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 22:02:30] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:02:30] [INFO ] Invariant cache hit.
[2024-06-02 22:02:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:02:31] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-02 22:02:31] [INFO ] Redundant transitions in 15 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:02:31] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:02:31] [INFO ] Invariant cache hit.
[2024-06-02 22:02:31] [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 22:02:32] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:02:32] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:02:32] [INFO ] Deduced a trap composed of 15 places in 81 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 22:02:33] [INFO ] Deduced a trap composed of 15 places in 72 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 22:02:35] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:02:35] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 5 ms to minimize.
[2024-06-02 22:02:36] [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 13711 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 22:02:48] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:02:49] [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 23941 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 37919ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37923ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38193 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 83 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)]
RANDOM walk for 1187 steps (80 resets) in 13 ms. (84 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 109 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 73 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[false, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 70 ms.
Support contains 2 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 7 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 22:03:09] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:03:09] [INFO ] Invariant cache hit.
[2024-06-02 22:03:09] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:03:09] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:03:09] [INFO ] Invariant cache hit.
[2024-06-02 22:03:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:03:09] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-02 22:03:10] [INFO ] Redundant transitions in 6 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:03:10] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:03:10] [INFO ] Invariant cache hit.
[2024-06-02 22:03:10] [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 22:03:11] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 4 ms to minimize.
[2024-06-02 22:03:11] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:03:11] [INFO ] Deduced a trap composed of 15 places in 49 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 22:03:12] [INFO ] Deduced a trap composed of 15 places in 61 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 22:03:14] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:03:14] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:03:15] [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 13925 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 22:03:27] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:03:28] [INFO ] Deduced a trap composed of 15 places in 27 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 23763 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 37890ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37894ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38135 ms. Remains : 102/102 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-00 finished in 78521 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 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 1 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 21 ms. Remains 103 /110 variables (removed 7) and now considering 298/302 (removed 4) transitions.
[2024-06-02 22:03:47] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 103 cols
[2024-06-02 22:03:47] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:03:48] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-02 22:03:48] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:03:48] [INFO ] Invariant cache hit.
[2024-06-02 22:03:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:03:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 353 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 7 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 381 ms. Remains : 102/110 places, 298/302 transitions.
Stuttering acceptance computed with spot in 83 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 4 reset in 185 ms.
Product exploration explored 100000 steps with 0 reset in 65 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 (NOT p2)), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 123 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 73 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2573 resets) in 291 ms. (136 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (693 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (689 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (630 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
[2024-06-02 22:03:49] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 22:03:49] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:03:49] [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 189 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 356 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 557ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 117 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 14 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 14 ms. Remains : 97/102 places, 287/298 transitions.
RANDOM walk for 40000 steps (2563 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (668 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (676 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (734 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 14706 steps, run visited all 3 properties in 105 ms. (steps per millisecond=140 )
Probabilistic random walk after 14706 steps, saw 4977 distinct states, run finished after 105 ms. (steps per millisecond=140 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 17 factoid took 362 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 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 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 7 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 22:03:50] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:03:50] [INFO ] Invariant cache hit.
[2024-06-02 22:03:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:03:50] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:03:50] [INFO ] Invariant cache hit.
[2024-06-02 22:03:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:03:50] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-06-02 22:03:50] [INFO ] Redundant transitions in 3 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:03:50] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:03:50] [INFO ] Invariant cache hit.
[2024-06-02 22:03:50] [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 22:03:51] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2024-06-02 22:03:51] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:03:51] [INFO ] Deduced a trap composed of 15 places in 44 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 22:03:52] [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 22:03:55] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2024-06-02 22:03:55] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:03:55] [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 13463 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 22:04:07] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:04:09] [INFO ] Deduced a trap composed of 15 places in 25 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 23782 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 37433ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37436ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37662 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 (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (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 123 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 62 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2578 resets) in 106 ms. (373 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40002 steps (650 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (686 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (680 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
[2024-06-02 22:04:28] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:04:28] [INFO ] Invariant cache hit.
[2024-06-02 22:04:28] [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 167 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 352 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 527ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 115 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 16 ms. Remains : 97/102 places, 287/298 transitions.
RANDOM walk for 40000 steps (2627 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (709 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (708 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (704 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 14706 steps, run visited all 3 properties in 100 ms. (steps per millisecond=147 )
Probabilistic random walk after 14706 steps, saw 4977 distinct states, run finished after 100 ms. (steps per millisecond=147 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 17 factoid took 332 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 80 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 72 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 5 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 22:04:30] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:04:30] [INFO ] Invariant cache hit.
[2024-06-02 22:04:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:04:30] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:04:30] [INFO ] Invariant cache hit.
[2024-06-02 22:04:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:04:30] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-02 22:04:30] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:04:30] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:04:30] [INFO ] Invariant cache hit.
[2024-06-02 22:04:30] [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 22:04:31] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:04:31] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-06-02 22:04:31] [INFO ] Deduced a trap composed of 15 places in 56 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 22:04:32] [INFO ] Deduced a trap composed of 15 places in 59 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 22:04:34] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:04:34] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:04:35] [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 13578 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 22:04:47] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-02 22:04:48] [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 23245 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 37000ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37004ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37244 ms. Remains : 102/102 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-01 finished in 79453 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 2 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 22:05:07] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 22:05:07] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:05:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:05:07] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:05:07] [INFO ] Invariant cache hit.
[2024-06-02 22:05:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:07] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 226 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 231 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 63 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 307 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 22:05:07] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:05:07] [INFO ] Invariant cache hit.
[2024-06-02 22:05:07] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:05:07] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:05:07] [INFO ] Invariant cache hit.
[2024-06-02 22:05:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:07] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 194 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 198 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 120 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 334 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 0 ms. Remains 110 /110 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 22:05:08] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 110 cols
[2024-06-02 22:05:08] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:05:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:05:08] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 22:05:08] [INFO ] Invariant cache hit.
[2024-06-02 22:05:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:08] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 224 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 226 ms. Remains : 109/110 places, 302/302 transitions.
Stuttering acceptance computed with spot in 217 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 1 ms.
FORMULA FireWire-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-05 finished in 462 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 22:05:08] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 22:05:08] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:05:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:05:08] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:05:08] [INFO ] Invariant cache hit.
[2024-06-02 22:05:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:08] [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 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 2 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 107 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 334 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 4 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 22:05:08] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:05:08] [INFO ] Invariant cache hit.
[2024-06-02 22:05:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:05:08] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:05:08] [INFO ] Invariant cache hit.
[2024-06-02 22:05:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:09] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2024-06-02 22:05:09] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:05:09] [INFO ] Invariant cache hit.
[2024-06-02 22:05:09] [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 22:05:10] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:05:10] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2024-06-02 22:05:10] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:05:11] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:05:11] [INFO ] Deduced a trap composed of 17 places in 27 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 12484 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 22:05:26] [INFO ] Deduced a trap composed of 17 places in 32 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 26820 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 39467ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 39471ms
Starting structural reductions in LTL mode, iteration 1 : 109/110 places, 300/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39692 ms. Remains : 109/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 228 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 117 ms.
Product exploration explored 100000 steps with 50000 reset in 120 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 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (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 11 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 40204 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 21 ms. Remains 105 /110 variables (removed 5) and now considering 300/302 (removed 2) transitions.
[2024-06-02 22:05:49] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
// Phase 1: matrix 267 rows 105 cols
[2024-06-02 22:05:49] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:05:49] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:05:49] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
[2024-06-02 22:05:49] [INFO ] Invariant cache hit.
[2024-06-02 22:05:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:49] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 196 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 223 ms. Remains : 104/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 110 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 49 ms.
Product exploration explored 100000 steps with 0 reset in 46 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 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 460 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 167 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 8702 steps (483 resets) in 19 ms. (435 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 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR 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 743 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 1846 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 3 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 22:05:50] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 22:05:50] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 22:05:50] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:05:50] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:05:50] [INFO ] Invariant cache hit.
[2024-06-02 22:05:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:51] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 202 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 206 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 99 ms :[p1, p1, p1]
Running random walk in product with property : FireWire-PT-04-LTLFireability-09
Product exploration explored 100000 steps with 33365 reset in 101 ms.
Product exploration explored 100000 steps with 33328 reset in 151 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 93 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 104 ms :[p1, p1, p1]
RANDOM walk for 40000 steps (2228 resets) in 97 ms. (408 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (72 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2024-06-02 22:05:51] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2024-06-02 22:05:51] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:05:51] [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 127 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 199 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 349ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 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 0 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 21 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 21 ms. Remains : 97/108 places, 287/300 transitions.
RANDOM walk for 40000 steps (2543 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (65 resets) in 31 ms. (1250 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 207 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 106 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 108 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 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 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 17 ms. Remains 103 /108 variables (removed 5) and now considering 298/300 (removed 2) transitions.
[2024-06-02 22:05:52] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
// Phase 1: matrix 268 rows 103 cols
[2024-06-02 22:05:52] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:05:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:05:52] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:05:52] [INFO ] Invariant cache hit.
[2024-06-02 22:05:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:05:52] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-06-02 22:05:52] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:05:52] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:05:52] [INFO ] Invariant cache hit.
[2024-06-02 22:05:52] [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 22:05:53] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
[2024-06-02 22:05:53] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:05:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:05:54] [INFO ] Deduced a trap composed of 15 places in 52 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 22:06:00] [INFO ] Deduced a trap composed of 21 places in 66 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 12820 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 22:06:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:06:10] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 7 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 19651 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 32643ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 32647ms
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 32869 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 (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 121 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 118 ms :[p1, p1, p1]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (2532 resets) in 105 ms. (377 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (74 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (65 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
[2024-06-02 22:06:25] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:06:25] [INFO ] Invariant cache hit.
[2024-06-02 22:06:25] [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 116 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 261 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 387ms 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 12 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 13 ms. Remains : 98/103 places, 288/298 transitions.
RANDOM walk for 40000 steps (2513 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (76 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (65 resets) in 31 ms. (1250 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 (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 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 p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 283 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 119 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 124 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 120 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 2 reset in 102 ms.
Product exploration explored 100000 steps with 4 reset in 105 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 22:06:27] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:06:27] [INFO ] Invariant cache hit.
[2024-06-02 22:06:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:06:27] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:06:27] [INFO ] Invariant cache hit.
[2024-06-02 22:06:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:06:27] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 22:06:27] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:06:27] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:06:27] [INFO ] Invariant cache hit.
[2024-06-02 22:06:27] [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 22:06:28] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:06:28] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:06:28] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:06:28] [INFO ] Deduced a trap composed of 15 places in 64 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 22:06:34] [INFO ] Deduced a trap composed of 21 places in 60 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 12522 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 22:06:43] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:06:44] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 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 19277 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 31985ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 31991ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32214 ms. Remains : 103/103 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-09 finished in 68537 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 1 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 22:06:59] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 22:06:59] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:06:59] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 22:06:59] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:06:59] [INFO ] Invariant cache hit.
[2024-06-02 22:06:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:06:59] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 204 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 206 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 151 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 0 reset in 60 ms.
Product exploration explored 100000 steps with 2 reset in 166 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) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (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 97 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 157 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 (2224 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (23 resets) in 293 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (27 resets) in 26 ms. (1481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (19 resets) in 26 ms. (1481 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 2131143 steps, run timeout after 3001 ms. (steps per millisecond=710 ) properties seen :4 out of 5
Probabilistic random walk after 2131143 steps, saw 416249 distinct states, run finished after 3004 ms. (steps per millisecond=709 ) properties seen :4
[2024-06-02 22:07:03] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2024-06-02 22:07:03] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:07:03] [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 27ms 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) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 16 factoid took 247 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 66 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 96 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 18 ms. Remains 102 /108 variables (removed 6) and now considering 298/300 (removed 2) transitions.
[2024-06-02 22:07:04] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 22:07:04] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:07:04] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 22:07:04] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:07:04] [INFO ] Invariant cache hit.
[2024-06-02 22:07:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:07:04] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-02 22:07:04] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:07:04] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:07:04] [INFO ] Invariant cache hit.
[2024-06-02 22:07:04] [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 22:07:05] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:07:05] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:07:05] [INFO ] Deduced a trap composed of 15 places in 54 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 22:07:06] [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 22:07:08] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:07:08] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:07:09] [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 13424 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 22:07:21] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:07:22] [INFO ] Deduced a trap composed of 15 places in 31 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 22998 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 36580ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 36583ms
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 36802 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 (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 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 75 ms :[true, p0, p0]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2506 resets) in 118 ms. (336 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 22:07:41] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:07:41] [INFO ] Invariant cache hit.
[2024-06-02 22:07:41] [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 116 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 155 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 277ms problems are : Problem set: 0 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, 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 37765 steps (2385 resets) in 59 ms. (629 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 203 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 68 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 83 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 95 ms :[true, p0, p0]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 0 reset in 50 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 22:07:41] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:07:41] [INFO ] Invariant cache hit.
[2024-06-02 22:07:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 22:07:42] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:07:42] [INFO ] Invariant cache hit.
[2024-06-02 22:07:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:07:42] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-02 22:07:42] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:07:42] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:07:42] [INFO ] Invariant cache hit.
[2024-06-02 22:07:42] [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 22:07:43] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:07:43] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:07:43] [INFO ] Deduced a trap composed of 15 places in 50 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 22:07:44] [INFO ] Deduced a trap composed of 15 places in 56 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 22:07:46] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:07:46] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:07:47] [INFO ] Deduced a trap composed of 21 places in 59 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 13341 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 22:07:59] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 15 places in 35 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 23638 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 37150ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37372 ms. Remains : 102/102 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-10 finished in 79891 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 22:08:19] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 22:08:19] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 22:08:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 22:08:19] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:08:19] [INFO ] Invariant cache hit.
[2024-06-02 22:08:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:08:19] [INFO ] Implicit Places using invariants and state equation in 165 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 216 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 219 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 70 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 65 ms.
Product exploration explored 100000 steps with 0 reset in 65 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 (AND p1 p0)), (X (AND p1 p0 p2)), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 121 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 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (2226 resets) in 120 ms. (330 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40002 steps (604 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
[2024-06-02 22:08:20] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2024-06-02 22:08:20] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:08:20] [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 137 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 apf1 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 170 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 317ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 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 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 22 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 22 ms. Remains : 98/108 places, 285/300 transitions.
RANDOM walk for 40000 steps (2488 resets) in 53 ms. (740 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 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 (AND p1 p0)), (X (AND p1 p0 p2)), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p2)), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 386 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 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 81 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 22:08:21] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
// Phase 1: matrix 268 rows 104 cols
[2024-06-02 22:08:21] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:08:21] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:08:21] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:08:21] [INFO ] Invariant cache hit.
[2024-06-02 22:08:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:08:21] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-02 22:08:21] [INFO ] Redundant transitions in 1 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 22:08:21] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:08:21] [INFO ] Invariant cache hit.
[2024-06-02 22:08:21] [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 22:08:22] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2024-06-02 22:08:22] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:08:22] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 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 12139 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 22:08:36] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:08:37] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:08:38] [INFO ] Deduced a trap composed of 16 places in 27 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 23550 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 35871ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 35874ms
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 36087 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 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 113 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 65 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (2393 resets) in 125 ms. (317 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (697 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (18 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
[2024-06-02 22:08:57] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:08:57] [INFO ] Invariant cache hit.
[2024-06-02 22:08:57] [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 113 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 apf1 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 22:08:57] [INFO ] Deduced a trap composed of 15 places in 52 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 202 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 323ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 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 15 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 15 ms. Remains : 98/104 places, 285/298 transitions.
RANDOM walk for 40000 steps (2542 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (683 resets) in 24 ms. (1600 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 p0 p1 p2), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p2)), (F (NOT (AND p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 328 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 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 86 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 78 ms.
Product exploration explored 100000 steps with 0 reset in 82 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 22:08:58] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:08:58] [INFO ] Invariant cache hit.
[2024-06-02 22:08:58] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:08:58] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:08:58] [INFO ] Invariant cache hit.
[2024-06-02 22:08:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:08:58] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-02 22:08:58] [INFO ] Redundant transitions in 2 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 22:08:58] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:08:58] [INFO ] Invariant cache hit.
[2024-06-02 22:08:58] [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 22:09:00] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2024-06-02 22:09:00] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:09: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/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 11810 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 22:09:14] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:09:14] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:09:15] [INFO ] Deduced a trap composed of 16 places in 36 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 23196 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 35178ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 35182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35385 ms. Remains : 104/104 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-11 finished in 74626 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 22:09:33] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 110 cols
[2024-06-02 22:09:33] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:09:34] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 22:09:34] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 22:09:34] [INFO ] Invariant cache hit.
[2024-06-02 22:09:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:09:34] [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 226 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 229 ms. Remains : 109/110 places, 302/302 transitions.
Stuttering acceptance computed with spot in 63 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 310 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 5 ms. Remains 109 /110 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2024-06-02 22:09:34] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 22:09:34] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:09:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:09:34] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 22:09:34] [INFO ] Invariant cache hit.
[2024-06-02 22:09:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:09:34] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 211 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 2 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 219 ms. Remains : 108/110 places, 300/302 transitions.
Stuttering acceptance computed with spot in 182 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 98 ms.
Product exploration explored 100000 steps with 50000 reset in 115 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 p1 p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (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 19 factoid took 19 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 653 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 17 ms. Remains 105 /110 variables (removed 5) and now considering 299/302 (removed 3) transitions.
[2024-06-02 22:09:34] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
// Phase 1: matrix 269 rows 105 cols
[2024-06-02 22:09:34] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:09:35] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:09:35] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2024-06-02 22:09:35] [INFO ] Invariant cache hit.
[2024-06-02 22:09:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:09:35] [INFO ] Implicit Places using invariants and state equation in 145 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 4 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 244 ms. Remains : 104/110 places, 299/302 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-15 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(!p1)&&F(G(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 113 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 20 ms. Remains 104 /110 variables (removed 6) and now considering 300/302 (removed 2) transitions.
[2024-06-02 22:09:35] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
// Phase 1: matrix 270 rows 104 cols
[2024-06-02 22:09:35] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:09:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:09:35] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
[2024-06-02 22:09:35] [INFO ] Invariant cache hit.
[2024-06-02 22:09:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:09:35] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 211 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 2 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 234 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 33330 reset in 122 ms.
Stuttering criterion allowed to conclude after 52095 steps with 17460 reset in 71 ms.
Treatment of property FireWire-PT-04-LTLFireability-09 finished in 650 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 138 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 16 ms. Remains 103 /110 variables (removed 7) and now considering 301/302 (removed 1) transitions.
[2024-06-02 22:09:36] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
// Phase 1: matrix 268 rows 103 cols
[2024-06-02 22:09:36] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:09:36] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 22:09:36] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
[2024-06-02 22:09:36] [INFO ] Invariant cache hit.
[2024-06-02 22:09:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:09:36] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 216 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 235 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 6 reset in 54 ms.
Product exploration explored 100000 steps with 13 reset in 169 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) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (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 110 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 159 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 (2583 resets) in 185 ms. (215 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (22 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 22:09:37] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
// Phase 1: matrix 268 rows 102 cols
[2024-06-02 22:09:37] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:09:37] [INFO ] State equation strengthened by 40 read => feed constraints.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 3/370 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 11 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/102 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 17ms 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) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 16 factoid took 304 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 109 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 76 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 9 ms. Remains 102 /102 variables (removed 0) and now considering 298/301 (removed 3) transitions.
[2024-06-02 22:09:37] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 22:09:37] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:09:37] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:09:37] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:09:37] [INFO ] Invariant cache hit.
[2024-06-02 22:09:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:09:37] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-02 22:09:38] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:09:38] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:09:38] [INFO ] Invariant cache hit.
[2024-06-02 22:09:38] [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 22:09:38] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:09:39] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:09:39] [INFO ] Deduced a trap composed of 15 places in 53 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 22:09:40] [INFO ] Deduced a trap composed of 15 places in 66 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 22:09:42] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:09:42] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:09:42] [INFO ] Deduced a trap composed of 21 places in 57 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 13206 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 22:09:54] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 15 places in 25 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 23147 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 36527ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 36531ms
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 36724 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 (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 121 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 85 ms :[true, p0, p0]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2553 resets) in 102 ms. (388 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (27 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 22:10:14] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:10:14] [INFO ] Invariant cache hit.
[2024-06-02 22:10:14] [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 126 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 164 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 297ms problems are : Problem set: 0 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, 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 17 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 18 ms. Remains : 97/102 places, 287/298 transitions.
RANDOM walk for 37361 steps (2353 resets) in 72 ms. (511 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 226 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 84 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 102 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[true, p0, p0]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 55 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 22:10:15] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:10:15] [INFO ] Invariant cache hit.
[2024-06-02 22:10:15] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:10:15] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:10:15] [INFO ] Invariant cache hit.
[2024-06-02 22:10:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:10:15] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-02 22:10:15] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:10:15] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 22:10:16] [INFO ] Invariant cache hit.
[2024-06-02 22:10: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 22:10:16] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:10:17] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:10:17] [INFO ] Deduced a trap composed of 15 places in 59 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 22:10:18] [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 22:10:20] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:10:20] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2024-06-02 22:10:20] [INFO ] Deduced a trap composed of 21 places in 65 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 13461 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 22:10:33] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:10:34] [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 23713 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 37349ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37352ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37557 ms. Remains : 102/102 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-10 finished in 77186 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 87 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 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: -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 11 ms. Remains 105 /110 variables (removed 5) and now considering 300/302 (removed 2) transitions.
[2024-06-02 22:10:53] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
// Phase 1: matrix 270 rows 105 cols
[2024-06-02 22:10:53] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:10:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 22:10:53] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
[2024-06-02 22:10:53] [INFO ] Invariant cache hit.
[2024-06-02 22:10:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:10:53] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 304 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 4 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 320 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 65 ms.
Product exploration explored 100000 steps with 0 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 (AND p1 p0)), (X (AND p1 p0 p2)), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 156 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 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (2444 resets) in 125 ms. (317 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (654 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (18 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
[2024-06-02 22:10:54] [INFO ] Flow matrix only has 270 transitions (discarded 30 similar events)
// Phase 1: matrix 270 rows 104 cols
[2024-06-02 22:10:54] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:10:54] [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 131 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 apf1 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 159 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 300ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 7212 steps, including 622 resets, run visited all 1 properties in 15 ms. (steps per millisecond=480 )
Parikh walk visited 1 properties in 18 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (AND p1 p0)), (X (AND p1 p0 p2)), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p2)), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 436 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 94 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)))]
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 6 ms. Remains 104 /104 variables (removed 0) and now considering 298/300 (removed 2) transitions.
[2024-06-02 22:10:55] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
// Phase 1: matrix 268 rows 104 cols
[2024-06-02 22:10:55] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:10:55] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:10:55] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:10:55] [INFO ] Invariant cache hit.
[2024-06-02 22:10:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:10:55] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-02 22:10:55] [INFO ] Redundant transitions in 2 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 22:10:55] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:10:55] [INFO ] Invariant cache hit.
[2024-06-02 22:10:55] [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 22:10:57] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:10:57] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:10:57] [INFO ] Deduced a trap composed of 15 places in 56 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 12487 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 22:11:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:11:12] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:11:12] [INFO ] Deduced a trap composed of 16 places in 29 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 23499 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 36193ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 36197ms
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 36436 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 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 123 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 90 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (2345 resets) in 123 ms. (322 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40001 steps (644 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (18 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
[2024-06-02 22:11:32] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:11:32] [INFO ] Invariant cache hit.
[2024-06-02 22:11: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) 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 126 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 apf1 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 22:11:32] [INFO ] Deduced a trap composed of 15 places in 48 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 209 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 344ms 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 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 13 ms. Remains : 98/104 places, 285/298 transitions.
RANDOM walk for 40000 steps (2543 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (617 resets) in 27 ms. (1428 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 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 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p2)), (F (NOT (AND p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 299 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 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 76 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 88 ms.
Product exploration explored 100000 steps with 2 reset in 95 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 10 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 22:11:33] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:11:33] [INFO ] Invariant cache hit.
[2024-06-02 22:11:33] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:11:33] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:11:33] [INFO ] Invariant cache hit.
[2024-06-02 22:11:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:11:33] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 22:11:33] [INFO ] Redundant transitions in 1 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 22:11:33] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 22:11:33] [INFO ] Invariant cache hit.
[2024-06-02 22:11:33] [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 22:11:35] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:11:35] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:11:35] [INFO ] Deduced a trap composed of 15 places in 52 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 12097 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 22:11:49] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:11:50] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:11:50] [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 23468 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 35729ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 35733ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35955 ms. Remains : 104/104 places, 298/298 transitions.
Treatment of property FireWire-PT-04-LTLFireability-11 finished in 75882 ms.
[2024-06-02 22:12:09] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:12:09] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 22:12:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 302 transitions and 1094 arcs took 5 ms.
Total runtime 601039 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-04

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2573
MODEL NAME: /home/mcc/execution/405/model
110 places, 302 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-04-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366357921

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

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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r549-tall-171734898000196"
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 ;