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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 86K 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-03-LTLFireability-00
FORMULA_NAME FireWire-PT-03-LTLFireability-01
FORMULA_NAME FireWire-PT-03-LTLFireability-02
FORMULA_NAME FireWire-PT-03-LTLFireability-03
FORMULA_NAME FireWire-PT-03-LTLFireability-04
FORMULA_NAME FireWire-PT-03-LTLFireability-05
FORMULA_NAME FireWire-PT-03-LTLFireability-06
FORMULA_NAME FireWire-PT-03-LTLFireability-07
FORMULA_NAME FireWire-PT-03-LTLFireability-08
FORMULA_NAME FireWire-PT-03-LTLFireability-09
FORMULA_NAME FireWire-PT-03-LTLFireability-10
FORMULA_NAME FireWire-PT-03-LTLFireability-11
FORMULA_NAME FireWire-PT-03-LTLFireability-12
FORMULA_NAME FireWire-PT-03-LTLFireability-13
FORMULA_NAME FireWire-PT-03-LTLFireability-14
FORMULA_NAME FireWire-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717365510081

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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:58:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:58:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:58:31] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 21:58:31] [INFO ] Transformed 112 places.
[2024-06-02 21:58:31] [INFO ] Transformed 356 transitions.
[2024-06-02 21:58:31] [INFO ] Found NUPN structural information;
[2024-06-02 21:58:31] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-03-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 303/303 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 110 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 110 transition count 298
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 10 place count 110 transition count 292
Applied a total of 10 rules in 34 ms. Remains 110 /112 variables (removed 2) and now considering 292/303 (removed 11) transitions.
[2024-06-02 21:58:31] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
// Phase 1: matrix 266 rows 110 cols
[2024-06-02 21:58:31] [INFO ] Computed 9 invariants in 8 ms
[2024-06-02 21:58:31] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-02 21:58:31] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 21:58:31] [INFO ] Invariant cache hit.
[2024-06-02 21:58:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:58:32] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-06-02 21:58:32] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 21:58:32] [INFO ] Invariant cache hit.
[2024-06-02 21:58:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 21:58:33] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 6 ms to minimize.
[2024-06-02 21:58:33] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:58:34] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:58:34] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:58:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:58:34] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:58:34] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 21:58:34] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/375 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 39/166 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 167 constraints, problems are : Problem set: 0 solved, 291 unsolved in 12540 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 21:58:45] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 265/375 variables, 110/128 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 39/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 291/458 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 459 constraints, problems are : Problem set: 0 solved, 291 unsolved in 19451 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 9/9 constraints]
After SMT, in 32262ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 32288ms
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 292/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32751 ms. Remains : 110/112 places, 292/303 transitions.
Support contains 30 out of 110 places after structural reductions.
[2024-06-02 21:59:04] [INFO ] Flatten gal took : 45 ms
[2024-06-02 21:59:04] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:59:04] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 28 out of 110 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (2032 resets) in 2368 ms. (16 steps per ms) remains 10/23 properties
BEST_FIRST walk for 40003 steps (533 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (500 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (525 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (522 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (524 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (469 resets) in 209 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (26 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (512 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (21 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
[2024-06-02 21:59:05] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 21:59:05] [INFO ] Invariant cache hit.
[2024-06-02 21:59:05] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 65/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/110 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 21:59:06] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 3 ms to minimize.
[2024-06-02 21:59:06] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 265/375 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 161 constraints, problems are : Problem set: 0 solved, 10 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 65/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/110 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 21:59:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 265/375 variables, 110/122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 10/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 21:59:06] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1/376 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/376 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 173 constraints, problems are : Problem set: 0 solved, 10 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 1465ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 8 properties in 2567 ms.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 292/292 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 110 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 110 transition count 288
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 109 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 107 transition count 283
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 107 transition count 283
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 105 transition count 281
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 103 transition count 285
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 103 transition count 281
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 25 place count 103 transition count 277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 102 transition count 277
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 31 place count 102 transition count 275
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 102 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 101 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 100 transition count 274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 35 place count 100 transition count 273
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 99 transition count 273
Applied a total of 37 rules in 103 ms. Remains 99 /110 variables (removed 11) and now considering 273/292 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 99/110 places, 273/292 transitions.
RANDOM walk for 40000 steps (2468 resets) in 763 ms. (52 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (623 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2024-06-02 21:59:10] [INFO ] Flow matrix only has 247 transitions (discarded 26 similar events)
// Phase 1: matrix 247 rows 99 cols
[2024-06-02 21:59:10] [INFO ] Computed 8 invariants in 9 ms
[2024-06-02 21:59:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 181/212 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 121/333 variables, 60/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 28/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/346 variables, 8/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/346 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 181/212 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 121/333 variables, 60/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 28/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/346 variables, 8/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/346 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 273/273 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 98 transition count 275
Applied a total of 5 rules in 21 ms. Remains 98 /99 variables (removed 1) and now considering 275/273 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 98/99 places, 275/273 transitions.
RANDOM walk for 40000 steps (2441 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (608 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8725 steps, run visited all 1 properties in 40 ms. (steps per millisecond=218 )
Probabilistic random walk after 8725 steps, saw 3694 distinct states, run finished after 43 ms. (steps per millisecond=202 ) properties seen :1
Computed a total of 3 stabilizing places and 2 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(F(p0)))'
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 291
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 105 transition count 283
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 0 with 6 rules applied. Total rules applied 16 place count 102 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 102 transition count 282
Applied a total of 24 rules in 31 ms. Remains 102 /110 variables (removed 8) and now considering 282/292 (removed 10) transitions.
[2024-06-02 21:59:11] [INFO ] Flow matrix only has 250 transitions (discarded 32 similar events)
// Phase 1: matrix 250 rows 102 cols
[2024-06-02 21:59:11] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 21:59:11] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 21:59:11] [INFO ] Flow matrix only has 250 transitions (discarded 32 similar events)
[2024-06-02 21:59:11] [INFO ] Invariant cache hit.
[2024-06-02 21:59:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:59:11] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-02 21:59:11] [INFO ] Redundant transitions in 12 ms returned []
Running 281 sub problems to find dead transitions.
[2024-06-02 21:59:11] [INFO ] Flow matrix only has 250 transitions (discarded 32 similar events)
[2024-06-02 21:59:11] [INFO ] Invariant cache hit.
[2024-06-02 21:59:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 21:59:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-02 21:59:12] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:59:12] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-02 21:59:12] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:59:12] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:59:13] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:59:13] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:59:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:59:13] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 249/351 variables, 102/120 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 21:59:18] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 161 constraints, problems are : Problem set: 0 solved, 281 unsolved in 12754 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 249/351 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 281/441 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 1/352 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 442 constraints, problems are : Problem set: 0 solved, 281 unsolved in 18266 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 10/10 constraints]
After SMT, in 31201ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 31205ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/110 places, 282/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31483 ms. Remains : 102/110 places, 282/292 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-00 finished in 31727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 291
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 104 transition count 282
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 18 place count 101 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 101 transition count 281
Applied a total of 26 rules in 26 ms. Remains 101 /110 variables (removed 9) and now considering 281/292 (removed 11) transitions.
[2024-06-02 21:59:42] [INFO ] Flow matrix only has 249 transitions (discarded 32 similar events)
// Phase 1: matrix 249 rows 101 cols
[2024-06-02 21:59:42] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 21:59:42] [INFO ] Implicit Places using invariants in 67 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/110 places, 281/292 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 100 transition count 280
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 280
Applied a total of 2 rules in 7 ms. Remains 99 /100 variables (removed 1) and now considering 280/281 (removed 1) transitions.
[2024-06-02 21:59:42] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
// Phase 1: matrix 248 rows 99 cols
[2024-06-02 21:59:42] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:59:42] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 21:59:42] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 21:59:42] [INFO ] Invariant cache hit.
[2024-06-02 21:59:42] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 21:59:43] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/110 places, 280/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 304 ms. Remains : 99/110 places, 280/292 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 173 ms.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2269 resets) in 405 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (588 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (630 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (614 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (646 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1973975 steps, run timeout after 3001 ms. (steps per millisecond=657 ) properties seen :3 out of 4
Probabilistic random walk after 1973975 steps, saw 361518 distinct states, run finished after 3004 ms. (steps per millisecond=657 ) properties seen :3
[2024-06-02 21:59:47] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 21:59:47] [INFO ] Invariant cache hit.
[2024-06-02 21:59:47] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/99 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 247/346 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 38/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 44/347 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 2/8 constraints, State Equation: 0/99 constraints, ReadFeed: 0/39 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 244 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 280/280 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-02 21:59:47] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 21:59:47] [INFO ] Invariant cache hit.
[2024-06-02 21:59:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 21:59:47] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 21:59:47] [INFO ] Invariant cache hit.
[2024-06-02 21:59:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 21:59:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-06-02 21:59:47] [INFO ] Redundant transitions in 3 ms returned []
Running 279 sub problems to find dead transitions.
[2024-06-02 21:59:47] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 21:59:47] [INFO ] Invariant cache hit.
[2024-06-02 21:59:47] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 21:59:49] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:59:49] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2024-06-02 21:59:49] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:59:49] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-02 21:59:49] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2024-06-02 21:59:49] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-02 21:59:49] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:59:49] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:59:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:59:50] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 1/347 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (OVERLAPS) 0/347 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 156 constraints, problems are : Problem set: 0 solved, 279 unsolved in 10852 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 279/434 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 435 constraints, problems are : Problem set: 0 solved, 279 unsolved in 15626 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 10/10 constraints]
After SMT, in 26669ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 26672ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26892 ms. Remains : 99/99 places, 280/280 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2345 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (605 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5171 steps, run visited all 1 properties in 12 ms. (steps per millisecond=430 )
Probabilistic random walk after 5171 steps, saw 2418 distinct states, run finished after 12 ms. (steps per millisecond=430 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 5 reset in 74 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 280/280 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-02 22:00:15] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 22:00:15] [INFO ] Invariant cache hit.
[2024-06-02 22:00:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:00:15] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 22:00:15] [INFO ] Invariant cache hit.
[2024-06-02 22:00:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:00:15] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-02 22:00:15] [INFO ] Redundant transitions in 4 ms returned []
Running 279 sub problems to find dead transitions.
[2024-06-02 22:00:15] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 22:00:15] [INFO ] Invariant cache hit.
[2024-06-02 22:00:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 22:00:16] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:00:16] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:00:17] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 1/347 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (OVERLAPS) 0/347 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 156 constraints, problems are : Problem set: 0 solved, 279 unsolved in 11055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 279/434 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 435 constraints, problems are : Problem set: 0 solved, 279 unsolved in 15065 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 10/10 constraints]
After SMT, in 26292ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 26296ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26506 ms. Remains : 99/99 places, 280/280 transitions.
Treatment of property FireWire-PT-03-LTLFireability-01 finished in 59119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 109 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 290
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 106 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 106 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 104 transition count 282
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 16 place count 101 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 101 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 100 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 99 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 26 place count 99 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 98 transition count 279
Applied a total of 28 rules in 24 ms. Remains 98 /110 variables (removed 12) and now considering 279/292 (removed 13) transitions.
[2024-06-02 22:00:41] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
// Phase 1: matrix 247 rows 98 cols
[2024-06-02 22:00:41] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:00:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:00:41] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 22:00:41] [INFO ] Invariant cache hit.
[2024-06-02 22:00:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:00:42] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-02 22:00:42] [INFO ] Redundant transitions in 2 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 22:00:42] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 22:00:42] [INFO ] Invariant cache hit.
[2024-06-02 22:00:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 22:00:42] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:00:43] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-06-02 22:00:43] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:00:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:00:43] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:00:43] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:00:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:00:43] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:00:43] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 22:00:47] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 22:00:50] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13394 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9926 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 23482ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 23485ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/110 places, 279/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23709 ms. Remains : 98/110 places, 279/292 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 42 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2398 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (611 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4975 steps, run visited all 1 properties in 11 ms. (steps per millisecond=452 )
Probabilistic random walk after 4975 steps, saw 2277 distinct states, run finished after 12 ms. (steps per millisecond=414 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 279/279 transitions.
Applied a total of 0 rules in 14 ms. Remains 98 /98 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 22:01:06] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 22:01:06] [INFO ] Invariant cache hit.
[2024-06-02 22:01:06] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 22:01:06] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 22:01:06] [INFO ] Invariant cache hit.
[2024-06-02 22:01:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:01:06] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-06-02 22:01:06] [INFO ] Redundant transitions in 0 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 22:01:06] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 22:01:06] [INFO ] Invariant cache hit.
[2024-06-02 22:01:06] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 22:01:07] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:01:07] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:01:07] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 11 ms to minimize.
[2024-06-02 22:01:07] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:01:07] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:01:07] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:01:07] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:01:07] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-02 22:01:08] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 22:01:11] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 7 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 22:01:14] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13485 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9692 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 23332ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 23334ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23617 ms. Remains : 98/98 places, 279/279 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2431 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (574 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4975 steps, run visited all 1 properties in 11 ms. (steps per millisecond=452 )
Probabilistic random walk after 4975 steps, saw 2277 distinct states, run finished after 11 ms. (steps per millisecond=452 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 22:01:30] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 22:01:30] [INFO ] Invariant cache hit.
[2024-06-02 22:01:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:01:30] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 22:01:30] [INFO ] Invariant cache hit.
[2024-06-02 22:01:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:01:30] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-06-02 22:01:30] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 22:01:30] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 22:01:30] [INFO ] Invariant cache hit.
[2024-06-02 22:01:30] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 22:01:31] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:01:31] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-06-02 22:01:31] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:01:31] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-06-02 22:01:31] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:01:31] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:01:32] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:01:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:01:32] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 22:01:36] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 22:01:38] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13493 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9934 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 23625ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 23633ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23876 ms. Remains : 98/98 places, 279/279 transitions.
Treatment of property FireWire-PT-03-LTLFireability-02 finished in 72252 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((X(p0)||(p1 U G(p2)))))'
Support contains 3 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, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 2 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 22:01:54] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 22:01:54] [INFO ] Computed 9 invariants in 9 ms
[2024-06-02 22:01:54] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-06-02 22:01:54] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:01:54] [INFO ] Invariant cache hit.
[2024-06-02 22:01:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:01:54] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 22:01:54] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:01:54] [INFO ] Invariant cache hit.
[2024-06-02 22:01:54] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:01:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:01:56] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-02 22:01:56] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:01:56] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:01:56] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:01:56] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:01:56] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-06-02 22:01:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:01:57] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:01:57] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11669 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:02:07] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20172 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31995ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31998ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32695 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-03 finished in 32790 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||X(G(p1))))||F(p2)))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 2 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 22:02:26] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:02:26] [INFO ] Invariant cache hit.
[2024-06-02 22:02:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:02:26] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:02:26] [INFO ] Invariant cache hit.
[2024-06-02 22:02:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:02:27] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 22:02:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:02:27] [INFO ] Invariant cache hit.
[2024-06-02 22:02:27] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:02:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:02:28] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:02:28] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:02:28] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:02:28] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:02:28] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:02:29] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:02:29] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-02 22:02:29] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:02:29] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11910 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:02:40] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20343 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32448ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32451ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32656 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-04 finished in 32847 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)&&F(G(p1)))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 291
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 104 transition count 282
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 0 with 4 rules applied. Total rules applied 16 place count 102 transition count 287
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 22 place count 102 transition count 281
Applied a total of 22 rules in 15 ms. Remains 102 /110 variables (removed 8) and now considering 281/292 (removed 11) transitions.
[2024-06-02 22:02:59] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
// Phase 1: matrix 252 rows 102 cols
[2024-06-02 22:02:59] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 22:02:59] [INFO ] Implicit Places using invariants in 52 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/110 places, 281/292 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 101 transition count 280
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 280
Applied a total of 2 rules in 5 ms. Remains 100 /101 variables (removed 1) and now considering 280/281 (removed 1) transitions.
[2024-06-02 22:02:59] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
// Phase 1: matrix 251 rows 100 cols
[2024-06-02 22:02:59] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:02:59] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 22:02:59] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:02:59] [INFO ] Invariant cache hit.
[2024-06-02 22:02:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:03:00] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/110 places, 280/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 285 ms. Remains : 100/110 places, 280/292 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-07 finished in 506 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) U X(X(p1))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 7 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 22:03:00] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 22:03:00] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 22:03:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 22:03:00] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:03:00] [INFO ] Invariant cache hit.
[2024-06-02 22:03:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:03:00] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 22:03:00] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:03:00] [INFO ] Invariant cache hit.
[2024-06-02 22:03:00] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:03:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:03:01] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:03:02] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:03:02] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:03:02] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:03:02] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-06-02 22:03:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:03:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-02 22:03:02] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:03:02] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11755 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:03:13] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20528 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32424ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32428ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32645 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-08 finished in 33007 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(p0)))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 5 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 22:03:33] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:03:33] [INFO ] Invariant cache hit.
[2024-06-02 22:03:33] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:03:33] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:03:33] [INFO ] Invariant cache hit.
[2024-06-02 22:03:33] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:03:33] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 22:03:33] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:03:33] [INFO ] Invariant cache hit.
[2024-06-02 22:03:33] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:03:34] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:03:34] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:03:34] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:03:35] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:03:35] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2024-06-02 22:03:35] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:03:35] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-06-02 22:03:35] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:03:35] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:03:35] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11445 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:03:45] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20805 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32397ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32402ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32617 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-09
Product exploration explored 100000 steps with 1 reset in 79 ms.
Product exploration explored 100000 steps with 2 reset in 81 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2014 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (527 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2125661 steps, run timeout after 3001 ms. (steps per millisecond=708 ) properties seen :0 out of 1
Probabilistic random walk after 2125661 steps, saw 328228 distinct states, run finished after 3001 ms. (steps per millisecond=708 ) properties seen :0
[2024-06-02 22:04:09] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:04:09] [INFO ] Invariant cache hit.
[2024-06-02 22:04:09] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/107 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/107 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 285/285 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 107 transition count 281
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 106 transition count 281
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 104 transition count 279
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 1 with 6 rules applied. Total rules applied 15 place count 101 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 21 place count 101 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 101 transition count 275
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 101 transition count 277
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 100 transition count 275
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 32 place count 100 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 99 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 98 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 34 place count 98 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 97 transition count 271
Applied a total of 36 rules in 28 ms. Remains 97 /107 variables (removed 10) and now considering 271/285 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 97/107 places, 271/285 transitions.
RANDOM walk for 40000 steps (2469 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (671 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 650 steps, run visited all 1 properties in 5 ms. (steps per millisecond=130 )
Probabilistic random walk after 650 steps, saw 329 distinct states, run finished after 5 ms. (steps per millisecond=130 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-03-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-03-LTLFireability-09 finished in 36548 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||G(p1)))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Applied a total of 4 rules in 3 ms. Remains 108 /110 variables (removed 2) and now considering 287/292 (removed 5) transitions.
[2024-06-02 22:04:09] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2024-06-02 22:04:09] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 22:04:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 22:04:09] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:04:09] [INFO ] Invariant cache hit.
[2024-06-02 22:04:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:04:10] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 22:04:10] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:04:10] [INFO ] Invariant cache hit.
[2024-06-02 22:04:10] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 22:04:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:04:11] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:04:11] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:04:11] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:04:11] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:04:11] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:04:12] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:04:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:04:12] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 165 constraints, problems are : Problem set: 0 solved, 286 unsolved in 11612 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 451 constraints, problems are : Problem set: 0 solved, 286 unsolved in 14909 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
After SMT, in 26690ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 26692ms
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 287/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27019 ms. Remains : 108/110 places, 287/292 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 59 ms.
Product exploration explored 100000 steps with 2 reset in 56 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (2014 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (518 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (446 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1220865 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :3 out of 6
Probabilistic random walk after 1220865 steps, saw 185906 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :3
[2024-06-02 22:04:40] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:04:40] [INFO ] Invariant cache hit.
[2024-06-02 22:04:40] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 71/75 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/108 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 260/368 variables, 108/117 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 38/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 156 constraints, problems are : Problem set: 1 solved, 2 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 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) 71/75 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/108 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 260/368 variables, 108/117 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 38/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 2/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/369 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/369 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 158 constraints, problems are : Problem set: 1 solved, 2 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 365ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 326 ms.
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 287/287 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 108 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 108 transition count 283
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 107 transition count 283
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 105 transition count 281
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 1 with 4 rules applied. Total rules applied 13 place count 103 transition count 285
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 103 transition count 281
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 21 place count 103 transition count 277
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 103 transition count 303
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 101 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 45 place count 101 transition count 283
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 101 transition count 283
Applied a total of 47 rules in 20 ms. Remains 101 /108 variables (removed 7) and now considering 283/287 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 101/108 places, 283/287 transitions.
RANDOM walk for 28315 steps (1535 resets) in 123 ms. (228 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), false]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 108 transition count 286
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 105 transition count 284
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 0 with 4 rules applied. Total rules applied 10 place count 103 transition count 288
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 16 place count 103 transition count 282
Applied a total of 16 rules in 20 ms. Remains 103 /108 variables (removed 5) and now considering 282/287 (removed 5) transitions.
[2024-06-02 22:04:42] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
// Phase 1: matrix 253 rows 103 cols
[2024-06-02 22:04:42] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 22:04:42] [INFO ] Implicit Places using invariants in 63 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/108 places, 282/287 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 281
Applied a total of 2 rules in 7 ms. Remains 101 /102 variables (removed 1) and now considering 281/282 (removed 1) transitions.
[2024-06-02 22:04:42] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
// Phase 1: matrix 252 rows 101 cols
[2024-06-02 22:04:42] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:04:42] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:04:42] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:04:42] [INFO ] Invariant cache hit.
[2024-06-02 22:04:42] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:04:42] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/108 places, 281/287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 395 ms. Remains : 101/108 places, 281/287 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 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 96 ms :[(NOT p1), (NOT p1), false]
RANDOM walk for 40000 steps (2314 resets) in 174 ms. (228 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (607 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (695 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
[2024-06-02 22:04:42] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:04:42] [INFO ] Invariant cache hit.
[2024-06-02 22:04:42] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 28/101 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 251/352 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/101 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:04:43] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:04:43] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:04:43] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:04:43] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 251/352 variables, 101/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 281/281 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 101 transition count 276
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 101 transition count 302
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 99 transition count 282
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 99 transition count 282
Applied a total of 31 rules in 12 ms. Remains 99 /101 variables (removed 2) and now considering 282/281 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 99/101 places, 282/281 transitions.
RANDOM walk for 40000 steps (2266 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (599 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (610 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5310 steps, run visited all 2 properties in 34 ms. (steps per millisecond=156 )
Probabilistic random walk after 5310 steps, saw 2313 distinct states, run finished after 34 ms. (steps per millisecond=156 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 216 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 106 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 1 reset in 52 ms.
Product exploration explored 100000 steps with 0 reset in 51 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 281/281 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2024-06-02 22:04:44] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:04:44] [INFO ] Invariant cache hit.
[2024-06-02 22:04:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:04:44] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:04:44] [INFO ] Invariant cache hit.
[2024-06-02 22:04:44] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:04:44] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-02 22:04:44] [INFO ] Redundant transitions in 3 ms returned []
Running 280 sub problems to find dead transitions.
[2024-06-02 22:04:44] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:04:44] [INFO ] Invariant cache hit.
[2024-06-02 22:04:44] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-06-02 22:04:46] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:04:46] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 22:04:46] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:04:46] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:04:46] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:04:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-02 22:04:46] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 251/352 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 1/353 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 155 constraints, problems are : Problem set: 0 solved, 280 unsolved in 10575 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 251/352 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 280/434 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-06-02 22:05:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/353 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (OVERLAPS) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 436 constraints, problems are : Problem set: 0 solved, 280 unsolved in 27916 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 8/8 constraints]
After SMT, in 38671ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 38675ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39012 ms. Remains : 101/101 places, 281/281 transitions.
Treatment of property FireWire-PT-03-LTLFireability-10 finished in 73593 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 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 109 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 290
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 106 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 106 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 104 transition count 282
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 0 with 4 rules applied. Total rules applied 14 place count 102 transition count 286
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 20 place count 102 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 101 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 100 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 100 transition count 278
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 99 transition count 278
Applied a total of 24 rules in 21 ms. Remains 99 /110 variables (removed 11) and now considering 278/292 (removed 14) transitions.
[2024-06-02 22:05:23] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
// Phase 1: matrix 249 rows 99 cols
[2024-06-02 22:05:23] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:05:23] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:05:23] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2024-06-02 22:05:23] [INFO ] Invariant cache hit.
[2024-06-02 22:05:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:05:23] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-02 22:05:23] [INFO ] Redundant transitions in 2 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 22:05:23] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2024-06-02 22:05:23] [INFO ] Invariant cache hit.
[2024-06-02 22:05:23] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 22:05:24] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:05:24] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:05:24] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:05:24] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:05:24] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:05:24] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:05:25] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-02 22:05:25] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-02 22:05:25] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 248/347 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/348 variables, and 153 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7744 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 248/347 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 275/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/347 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/348 variables, and 428 constraints, problems are : Problem set: 0 solved, 275 unsolved in 9894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
After SMT, in 17781ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 17785ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/110 places, 278/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18009 ms. Remains : 99/110 places, 278/292 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-11
Product exploration explored 100000 steps with 4 reset in 160 ms.
Product exploration explored 100000 steps with 2 reset in 171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 112 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (2436 resets) in 149 ms. (266 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 26 ms. (1481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (9 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
[2024-06-02 22:05:42] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2024-06-02 22:05:42] [INFO ] Invariant cache hit.
[2024-06-02 22:05:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 49/53 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 198/251 variables, 53/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 17/72 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 90/341 variables, 42/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 4/118 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 20/138 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/347 variables, 4/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 2/144 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/347 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/348 variables, and 144 constraints, problems are : Problem set: 1 solved, 2 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 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) 49/53 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 198/251 variables, 53/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 17/72 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 90/341 variables, 42/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/119 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 20/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/347 variables, 4/144 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 2/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/347 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/348 variables, and 146 constraints, problems are : Problem set: 1 solved, 2 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 278/278 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 99 transition count 273
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 99 transition count 275
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 98 transition count 273
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 11 place count 98 transition count 271
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 98 transition count 271
Applied a total of 13 rules in 13 ms. Remains 98 /99 variables (removed 1) and now considering 271/278 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 98/99 places, 271/278 transitions.
RANDOM walk for 40000 steps (2385 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2235 steps, run visited all 2 properties in 11 ms. (steps per millisecond=203 )
Probabilistic random walk after 2235 steps, saw 940 distinct states, run finished after 12 ms. (steps per millisecond=186 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 14 factoid took 161 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-03-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-03-LTLFireability-11 finished in 19512 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((X(p1)&&p0))))'
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 6 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 22:05:42] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 22:05:42] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 22:05:42] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:05:42] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:05:42] [INFO ] Invariant cache hit.
[2024-06-02 22:05:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:05:43] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 22:05:43] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:05:43] [INFO ] Invariant cache hit.
[2024-06-02 22:05:43] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:05:44] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:05:44] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:05:44] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:05:44] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:05:44] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:05:44] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:05:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-02 22:05:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:05:45] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:05:45] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11563 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:05:55] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20749 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32450ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32453ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32665 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-12 finished in 32798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 109 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 107 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 107 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 106 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 106 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 105 transition count 284
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 14 place count 102 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 102 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 101 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 100 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 24 place count 100 transition count 280
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 99 transition count 280
Applied a total of 26 rules in 13 ms. Remains 99 /110 variables (removed 11) and now considering 280/292 (removed 12) transitions.
[2024-06-02 22:06:15] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
// Phase 1: matrix 248 rows 99 cols
[2024-06-02 22:06:15] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 22:06:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:06:15] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 22:06:15] [INFO ] Invariant cache hit.
[2024-06-02 22:06:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:06:15] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-06-02 22:06:15] [INFO ] Redundant transitions in 1 ms returned []
Running 277 sub problems to find dead transitions.
[2024-06-02 22:06:15] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 22:06:15] [INFO ] Invariant cache hit.
[2024-06-02 22:06:15] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 22:06:16] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:06:16] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:06:16] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:06:17] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-06-02 22:06:17] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:06:17] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2024-06-02 22:06:17] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-06-02 22:06:17] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:06:17] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:06:17] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-02 22:06:17] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:06:18] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 22:06:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-06-02 22:06:18] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/346 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/347 variables, and 158 constraints, problems are : Problem set: 0 solved, 277 unsolved in 8521 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 247/346 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 277/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/346 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/347 variables, and 435 constraints, problems are : Problem set: 0 solved, 277 unsolved in 10763 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 14/14 constraints]
After SMT, in 19444ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 19447ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/110 places, 280/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19692 ms. Remains : 99/110 places, 280/292 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-14 finished in 19756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 1 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 22:06:35] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 22:06:35] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 22:06:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:06:35] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:06:35] [INFO ] Invariant cache hit.
[2024-06-02 22:06:35] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:06:35] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 22:06:35] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:06:35] [INFO ] Invariant cache hit.
[2024-06-02 22:06:35] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:06:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-02 22:06:37] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:06:37] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:06:37] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:06:37] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2024-06-02 22:06:37] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:06:37] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:06:37] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 22:06:38] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:06:38] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11785 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:06:48] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20314 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32278ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32281ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32521 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FireWire-PT-03-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-15 finished in 32657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : FireWire-PT-03-LTLFireability-10
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 291
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 105 transition count 284
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 0 with 4 rules applied. Total rules applied 14 place count 103 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 103 transition count 284
Applied a total of 18 rules in 13 ms. Remains 103 /110 variables (removed 7) and now considering 284/292 (removed 8) transitions.
[2024-06-02 22:07:08] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
// Phase 1: matrix 255 rows 103 cols
[2024-06-02 22:07:08] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 22:07:08] [INFO ] Implicit Places using invariants in 80 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 102/110 places, 284/292 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 283
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 283
Applied a total of 2 rules in 5 ms. Remains 101 /102 variables (removed 1) and now considering 283/284 (removed 1) transitions.
[2024-06-02 22:07:08] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
// Phase 1: matrix 254 rows 101 cols
[2024-06-02 22:07:08] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:07:08] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 22:07:08] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2024-06-02 22:07:08] [INFO ] Invariant cache hit.
[2024-06-02 22:07:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:07:09] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 101/110 places, 283/292 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 477 ms. Remains : 101/110 places, 283/292 transitions.
Running random walk in product with property : FireWire-PT-03-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 52 ms.
Product exploration explored 100000 steps with 4 reset in 57 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (2317 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (578 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (567 resets) in 78 ms. (506 steps per ms) remains 3/6 properties
[2024-06-02 22:07:09] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2024-06-02 22:07:09] [INFO ] Invariant cache hit.
[2024-06-02 22:07:09] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/73 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 28/101 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 253/354 variables, 101/109 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 38/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/355 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/355 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 148 constraints, problems are : Problem set: 1 solved, 2 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 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) 69/73 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/101 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 22:07:10] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:07:10] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:07:10] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:07:10] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 253/354 variables, 101/113 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 38/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 22:07:10] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/355 variables, 1/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/355 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 155 constraints, problems are : Problem set: 1 solved, 2 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 795ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 283/283 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 101 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 101 transition count 276
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 101 transition count 302
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 99 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 99 transition count 282
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 99 transition count 282
Applied a total of 33 rules in 25 ms. Remains 99 /101 variables (removed 2) and now considering 282/283 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 99/101 places, 282/283 transitions.
RANDOM walk for 40000 steps (2300 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (565 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (570 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5310 steps, run visited all 2 properties in 48 ms. (steps per millisecond=110 )
Probabilistic random walk after 5310 steps, saw 2313 distinct states, run finished after 49 ms. (steps per millisecond=108 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 330 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), false]
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 283/283 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 101 transition count 281
Applied a total of 2 rules in 9 ms. Remains 101 /101 variables (removed 0) and now considering 281/283 (removed 2) transitions.
[2024-06-02 22:07:11] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
// Phase 1: matrix 252 rows 101 cols
[2024-06-02 22:07:11] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:07:11] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:07:11] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:07:11] [INFO ] Invariant cache hit.
[2024-06-02 22:07:11] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:07:11] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-02 22:07:11] [INFO ] Redundant transitions in 1 ms returned []
Running 280 sub problems to find dead transitions.
[2024-06-02 22:07:11] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:07:11] [INFO ] Invariant cache hit.
[2024-06-02 22:07:11] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-06-02 22:07:13] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:07:13] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:07:13] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:07:13] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:07:13] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-02 22:07:13] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:07:14] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 251/352 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 1/353 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 155 constraints, problems are : Problem set: 0 solved, 280 unsolved in 10733 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 251/352 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 280/434 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-06-02 22:07:36] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/353 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (OVERLAPS) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 436 constraints, problems are : Problem set: 0 solved, 280 unsolved in 27945 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 8/8 constraints]
After SMT, in 38826ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 38829ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/101 places, 281/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39194 ms. Remains : 101/101 places, 281/283 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 84 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 122 ms :[(NOT p1), (NOT p1), false]
RANDOM walk for 40000 steps (2264 resets) in 234 ms. (170 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (540 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (621 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
[2024-06-02 22:07:51] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:07:51] [INFO ] Invariant cache hit.
[2024-06-02 22:07:51] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 28/101 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 251/352 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/101 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:07:51] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:07:51] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2024-06-02 22:07:51] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:07:51] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 251/352 variables, 101/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 281/281 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 101 transition count 276
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 101 transition count 302
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 99 transition count 282
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 99 transition count 282
Applied a total of 31 rules in 17 ms. Remains 99 /101 variables (removed 2) and now considering 282/281 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 99/101 places, 282/281 transitions.
RANDOM walk for 40000 steps (2229 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (569 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (594 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5310 steps, run visited all 2 properties in 23 ms. (steps per millisecond=230 )
Probabilistic random walk after 5310 steps, saw 2313 distinct states, run finished after 24 ms. (steps per millisecond=221 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 229 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 127 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 52 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 281/281 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2024-06-02 22:07:52] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:07:52] [INFO ] Invariant cache hit.
[2024-06-02 22:07:52] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:07:52] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:07:52] [INFO ] Invariant cache hit.
[2024-06-02 22:07:52] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:07:52] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 22:07:52] [INFO ] Redundant transitions in 2 ms returned []
Running 280 sub problems to find dead transitions.
[2024-06-02 22:07:52] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 22:07:52] [INFO ] Invariant cache hit.
[2024-06-02 22:07:52] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:07:55] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 251/352 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 1/353 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 155 constraints, problems are : Problem set: 0 solved, 280 unsolved in 10709 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 251/352 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 280/434 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-06-02 22:08:16] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/353 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (OVERLAPS) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 436 constraints, problems are : Problem set: 0 solved, 280 unsolved in 28002 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 8/8 constraints]
After SMT, in 38865ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 38869ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39203 ms. Remains : 101/101 places, 281/281 transitions.
Treatment of property FireWire-PT-03-LTLFireability-10 finished in 83400 ms.
[2024-06-02 22:08:31] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:08:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-02 22:08:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 292 transitions and 1056 arcs took 4 ms.
Total runtime 600650 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-03

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2263
MODEL NAME: /home/mcc/execution/409/model
110 places, 292 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-03-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366117361

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

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