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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K 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.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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-02-LTLFireability-00
FORMULA_NAME FireWire-PT-02-LTLFireability-01
FORMULA_NAME FireWire-PT-02-LTLFireability-02
FORMULA_NAME FireWire-PT-02-LTLFireability-03
FORMULA_NAME FireWire-PT-02-LTLFireability-04
FORMULA_NAME FireWire-PT-02-LTLFireability-05
FORMULA_NAME FireWire-PT-02-LTLFireability-06
FORMULA_NAME FireWire-PT-02-LTLFireability-07
FORMULA_NAME FireWire-PT-02-LTLFireability-08
FORMULA_NAME FireWire-PT-02-LTLFireability-09
FORMULA_NAME FireWire-PT-02-LTLFireability-10
FORMULA_NAME FireWire-PT-02-LTLFireability-11
FORMULA_NAME FireWire-PT-02-LTLFireability-12
FORMULA_NAME FireWire-PT-02-LTLFireability-13
FORMULA_NAME FireWire-PT-02-LTLFireability-14
FORMULA_NAME FireWire-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717365275094

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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:54:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:54:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:54:36] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 21:54:36] [INFO ] Transformed 108 places.
[2024-06-02 21:54:36] [INFO ] Transformed 355 transitions.
[2024-06-02 21:54:36] [INFO ] Found NUPN structural information;
[2024-06-02 21:54:36] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 transitions.
FORMULA FireWire-PT-02-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 105 transition count 294
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 105 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 105 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 104 transition count 284
Applied a total of 16 rules in 59 ms. Remains 104 /108 variables (removed 4) and now considering 284/301 (removed 17) transitions.
[2024-06-02 21:54:36] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 104 cols
[2024-06-02 21:54:36] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 21:54:36] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-02 21:54:36] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 21:54:36] [INFO ] Invariant cache hit.
[2024-06-02 21:54:37] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 21:54:37] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-06-02 21:54:37] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 21:54:37] [INFO ] Invariant cache hit.
[2024-06-02 21:54:37] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 21:54:38] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 11 ms to minimize.
[2024-06-02 21:54:39] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:54:39] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:54:39] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:54:39] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:54:39] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:54:39] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 257/361 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 21:54:41] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 21:54:45] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:54:45] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 11 (OVERLAPS) 0/362 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 161 constraints, problems are : Problem set: 0 solved, 283 unsolved in 14737 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 257/361 variables, 104/122 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 38/160 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 283/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/362 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 444 constraints, problems are : Problem set: 0 solved, 283 unsolved in 18190 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 10/10 constraints]
After SMT, in 33192ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 33214ms
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 284/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33760 ms. Remains : 104/108 places, 284/301 transitions.
Support contains 41 out of 104 places after structural reductions.
[2024-06-02 21:55:10] [INFO ] Flatten gal took : 48 ms
[2024-06-02 21:55:10] [INFO ] Flatten gal took : 25 ms
[2024-06-02 21:55:10] [INFO ] Input system was already deterministic with 284 transitions.
Reduction of identical properties reduced properties to check from 34 to 31
RANDOM walk for 40000 steps (2215 resets) in 1580 ms. (25 steps per ms) remains 14/31 properties
BEST_FIRST walk for 40003 steps (1055 resets) in 212 ms. (187 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40001 steps (562 resets) in 239 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (577 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (577 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (562 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (606 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (77 resets) in 113 ms. (350 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (21 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (548 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
[2024-06-02 21:55:11] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 21:55:11] [INFO ] Invariant cache hit.
[2024-06-02 21:55:11] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 79/95 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 8/103 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 21:55:11] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 257/360 variables, 103/112 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 38/150 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/361 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/362 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 152 constraints, problems are : Problem set: 1 solved, 9 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 80/95 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/103 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 21:55:12] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-02 21:55:12] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 257/360 variables, 103/114 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 38/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 7/159 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/361 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 2/162 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/362 variables, 1/163 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/362 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 163 constraints, problems are : Problem set: 1 solved, 9 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 1475ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 4 properties in 3095 ms.
Support contains 8 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 284/284 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 103 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 103 transition count 279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 102 transition count 279
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 100 transition count 273
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 100 transition count 273
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 99 transition count 271
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 99 transition count 271
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 2 with 6 rules applied. Total rules applied 19 place count 96 transition count 277
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 25 place count 96 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 96 transition count 268
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 96 transition count 270
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 3 with 3 rules applied. Total rules applied 32 place count 95 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 95 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 94 transition count 265
Applied a total of 35 rules in 86 ms. Remains 94 /104 variables (removed 10) and now considering 265/284 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 94/104 places, 265/284 transitions.
RANDOM walk for 40000 steps (2515 resets) in 701 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1487 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (711 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (623 resets) in 36 ms. (1081 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 26 ms. (1481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 27 ms. (1428 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 117672 steps, run visited all 5 properties in 233 ms. (steps per millisecond=505 )
Probabilistic random walk after 117672 steps, saw 29710 distinct states, run finished after 236 ms. (steps per millisecond=498 ) properties seen :5
FORMULA FireWire-PT-02-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-02-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 6 stabilizing places and 11 stable transitions
FORMULA FireWire-PT-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(G(p1))))||((p0||X(G(p1)))&&X(X(F(!p2))))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 7 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 21:55:17] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 21:55:17] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 21:55:17] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 21:55:17] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:55:17] [INFO ] Invariant cache hit.
[2024-06-02 21:55:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:55:17] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 204 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 362 ms :[true, (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), p2, (NOT p1)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-00 finished in 635 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) U X(G((p1||F(p2)))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 11 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 21:55:17] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:55:17] [INFO ] Invariant cache hit.
[2024-06-02 21:55:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 21:55:17] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:55:17] [INFO ] Invariant cache hit.
[2024-06-02 21:55:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:55:18] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 21:55:18] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:55:18] [INFO ] Invariant cache hit.
[2024-06-02 21:55:18] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 4 ms to minimize.
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/343 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 153 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10183 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/343 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 270/422 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/344 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/344 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 423 constraints, problems are : Problem set: 0 solved, 270 unsolved in 17938 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 28324ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 28328ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 271/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28539 ms. Remains : 99/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-02-LTLFireability-01
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-01 finished in 28851 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) U (X(p1)||!p1)) U X(p0))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 12 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 21:55:46] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:55:46] [INFO ] Invariant cache hit.
[2024-06-02 21:55:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 21:55:46] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:55:46] [INFO ] Invariant cache hit.
[2024-06-02 21:55:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:55:46] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 178 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 196 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, p0, p0, p0]
Running random walk in product with property : FireWire-PT-02-LTLFireability-04
Product exploration explored 100000 steps with 1 reset in 142 ms.
Product exploration explored 100000 steps with 1 reset in 95 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2208 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (572 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1066644 steps, run visited all 1 properties in 1392 ms. (steps per millisecond=766 )
Probabilistic random walk after 1066644 steps, saw 195392 distinct states, run finished after 1392 ms. (steps per millisecond=766 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0, p0]
Support contains 2 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 21:55:49] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 21:55:49] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:55:49] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 21:55:49] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:55:49] [INFO ] Invariant cache hit.
[2024-06-02 21:55:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:55:49] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 21:55:49] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:55:49] [INFO ] Invariant cache hit.
[2024-06-02 21:55:49] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:55:50] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:55:50] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-06-02 21:55:50] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:55:51] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:55:51] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-06-02 21:55:51] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-02 21:55:51] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:55:51] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:55:51] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10547 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15050 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 25738ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 25741ms
Finished structural reductions in LTL mode , in 1 iterations and 25998 ms. Remains : 98/98 places, 271/271 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2206 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (540 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1066644 steps, run visited all 1 properties in 1337 ms. (steps per millisecond=797 )
Probabilistic random walk after 1066644 steps, saw 195392 distinct states, run finished after 1337 ms. (steps per millisecond=797 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 1 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 64 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 112 ms :[true, p0, p0, p0]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 271
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 98 transition count 271
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 98 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 97 transition count 270
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 97 transition count 270
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 97 transition count 282
Deduced a syphon composed of 4 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 276
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 13 rules in 24 ms. Remains 97 /98 variables (removed 1) and now considering 276/271 (removed -5) transitions.
[2024-06-02 21:56:17] [INFO ] Redundant transitions in 11 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 21:56:17] [INFO ] Flow matrix only has 243 transitions (discarded 33 similar events)
// Phase 1: matrix 243 rows 97 cols
[2024-06-02 21:56:17] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:56:17] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-06-02 21:56:19] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 10/17 constraints. Problems are: Problem set: 6 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/17 constraints. Problems are: Problem set: 6 solved, 269 unsolved
Problem TDEAD250 is UNSAT
At refinement iteration 4 (OVERLAPS) 242/339 variables, 97/114 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 39/153 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/153 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/340 variables, 1/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 154 constraints, problems are : Problem set: 7 solved, 268 unsolved in 10036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 7 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 4/96 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 10/17 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/17 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 242/338 variables, 96/113 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 39/152 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 268/420 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/420 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/339 variables, 1/421 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/421 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/422 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/422 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/422 constraints. Problems are: Problem set: 7 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 422 constraints, problems are : Problem set: 7 solved, 268 unsolved in 19052 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 268/275 constraints, Known Traps: 10/10 constraints]
After SMT, in 29228ms problems are : Problem set: 7 solved, 268 unsolved
Search for dead transitions found 7 dead transitions in 29232ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 97/98 places, 269/271 transitions.
Graph (complete) has 522 edges and 97 vertex of which 93 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 93 /97 variables (removed 4) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/98 places, 269/271 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29287 ms. Remains : 93/98 places, 269/271 transitions.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 21:56:47] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 21:56:47] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:56:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 21:56:47] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:56:47] [INFO ] Invariant cache hit.
[2024-06-02 21:56:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:56:47] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 21:56:47] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:56:47] [INFO ] Invariant cache hit.
[2024-06-02 21:56:47] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:56:48] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:56:48] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:56:48] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:56:48] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:56:49] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:56:49] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-02 21:56:49] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:56:49] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:56:49] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 14937 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 25282ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 25286ms
Finished structural reductions in LTL mode , in 1 iterations and 25568 ms. Remains : 98/98 places, 271/271 transitions.
Treatment of property FireWire-PT-02-LTLFireability-04 finished in 86086 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) U (p1&&X(F((F(!p3)&&p2))))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 3 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 21:57:12] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 21:57:12] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:57:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 21:57:12] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:57:12] [INFO ] Invariant cache hit.
[2024-06-02 21:57:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:57:12] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 182 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (NOT p1) p3), (NOT p0), (OR (NOT p2) p3), p3]
Running random walk in product with property : FireWire-PT-02-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-05 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 102 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 101 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 101 transition count 276
Applied a total of 7 rules in 7 ms. Remains 101 /104 variables (removed 3) and now considering 276/284 (removed 8) transitions.
[2024-06-02 21:57:13] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
// Phase 1: matrix 250 rows 101 cols
[2024-06-02 21:57:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:57:13] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 21:57:13] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2024-06-02 21:57:13] [INFO ] Invariant cache hit.
[2024-06-02 21:57:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:57:13] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 187 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/104 places, 276/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 196 ms. Remains : 100/104 places, 276/284 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-02-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-02-LTLFireability-07 finished in 598 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) U p1))||G(!p1)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 7 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 21:57:13] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 21:57:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:57:13] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 21:57:13] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:57:13] [INFO ] Invariant cache hit.
[2024-06-02 21:57:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:57:13] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 179 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 177 ms :[false, (NOT p1), false, (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-08
Product exploration explored 100000 steps with 25062 reset in 124 ms.
Product exploration explored 100000 steps with 25074 reset in 125 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 83 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 40000 steps (2273 resets) in 113 ms. (350 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (25 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
[2024-06-02 21:57:14] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 21:57:14] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:57:14] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/94 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 241/335 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/339 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/342 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/343 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/343 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/94 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 241/335 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/339 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/342 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/343 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 319ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1751 steps, including 199 resets, run visited all 1 properties in 4 ms. (steps per millisecond=437 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 240 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 96 transition count 268
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 95 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 93 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 93 transition count 268
Applied a total of 12 rules in 20 ms. Remains 93 /98 variables (removed 5) and now considering 268/271 (removed 3) transitions.
[2024-06-02 21:57:15] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
// Phase 1: matrix 238 rows 93 cols
[2024-06-02 21:57:15] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:57:16] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 21:57:16] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 21:57:16] [INFO ] Invariant cache hit.
[2024-06-02 21:57:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:57:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 21:57:16] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 21:57:16] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 21:57:16] [INFO ] Invariant cache hit.
[2024-06-02 21:57:16] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 21:57:16] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:57:17] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:57:17] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:57:17] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-06-02 21:57:17] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:57:17] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:57:17] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 8 ms to minimize.
[2024-06-02 21:57:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:57:17] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 237/329 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/330 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 8627 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 237/329 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 14581 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 23343ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 23345ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/98 places, 268/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23587 ms. Remains : 93/98 places, 268/271 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 115 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
RANDOM walk for 40000 steps (2552 resets) in 135 ms. (294 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (19 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2024-06-02 21:57:40] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 21:57:40] [INFO ] Invariant cache hit.
[2024-06-02 21:57:40] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 173/206 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 115/321 variables, 54/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/329 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/330 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/330 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 173/206 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 115/321 variables, 54/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/329 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/330 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/330 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 268/268 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 93 transition count 263
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 93 transition count 265
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 92 transition count 263
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 92 transition count 261
Applied a total of 11 rules in 13 ms. Remains 92 /93 variables (removed 1) and now considering 261/268 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 92/93 places, 261/268 transitions.
RANDOM walk for 40000 steps (2562 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (21 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2349 steps, run visited all 1 properties in 6 ms. (steps per millisecond=391 )
Probabilistic random walk after 2349 steps, saw 1383 distinct states, run finished after 7 ms. (steps per millisecond=335 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 13 factoid took 327 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Product exploration explored 100000 steps with 2 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 72 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 268/268 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 21:57:41] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 21:57:41] [INFO ] Invariant cache hit.
[2024-06-02 21:57:41] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 21:57:41] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 21:57:41] [INFO ] Invariant cache hit.
[2024-06-02 21:57:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:57:41] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 21:57:41] [INFO ] Redundant transitions in 4 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 21:57:41] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 21:57:41] [INFO ] Invariant cache hit.
[2024-06-02 21:57:41] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 21:57:42] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:57:42] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-06-02 21:57:42] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-06-02 21:57:42] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:57:42] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-06-02 21:57:43] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:57:43] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:57:43] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:57:43] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 237/329 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/330 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 8687 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 237/329 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 14380 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 23198ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 23201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23422 ms. Remains : 93/93 places, 268/268 transitions.
Treatment of property FireWire-PT-02-LTLFireability-08 finished in 51341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&((p1 U p2) U (G((p1 U p2))||(!p3&&(p1 U p2))))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 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 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 99 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 99 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 99 transition count 275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 98 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 98 transition count 273
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 3 with 6 rules applied. Total rules applied 17 place count 95 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 95 transition count 273
Applied a total of 23 rules in 17 ms. Remains 95 /104 variables (removed 9) and now considering 273/284 (removed 11) transitions.
[2024-06-02 21:58:05] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 95 cols
[2024-06-02 21:58:05] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:58:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 21:58:05] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:58:05] [INFO ] Invariant cache hit.
[2024-06-02 21:58:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:58:05] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 241 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/104 places, 273/284 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 94/104 places, 273/284 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-10 finished in 500 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 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 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 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 98 transition count 273
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 98 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 96 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 96 transition count 268
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 3 with 6 rules applied. Total rules applied 21 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 93 transition count 268
Applied a total of 27 rules in 19 ms. Remains 93 /104 variables (removed 11) and now considering 268/284 (removed 16) transitions.
[2024-06-02 21:58:05] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2024-06-02 21:58:05] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:58:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 21:58:05] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 21:58:05] [INFO ] Invariant cache hit.
[2024-06-02 21:58:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:58:05] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 175 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/104 places, 268/284 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199 ms. Remains : 92/104 places, 268/284 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-11 finished in 247 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 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 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 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 98 transition count 273
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 98 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 96 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 96 transition count 268
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 3 with 6 rules applied. Total rules applied 21 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 93 transition count 268
Applied a total of 27 rules in 18 ms. Remains 93 /104 variables (removed 11) and now considering 268/284 (removed 16) transitions.
[2024-06-02 21:58:05] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 21:58:05] [INFO ] Invariant cache hit.
[2024-06-02 21:58:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 21:58:05] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 21:58:05] [INFO ] Invariant cache hit.
[2024-06-02 21:58:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:58:06] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 172 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/104 places, 268/284 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 92/104 places, 268/284 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-12 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p1))&&p0)))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 5 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 21:58:06] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 21:58:06] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:58:06] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 21:58:06] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:58:06] [INFO ] Invariant cache hit.
[2024-06-02 21:58:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:58:06] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 172 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-14 finished in 418 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((F(G(p0))&&(F(p1)||X(p2)))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 4 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 21:58:06] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:58:06] [INFO ] Invariant cache hit.
[2024-06-02 21:58:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 21:58:06] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 21:58:06] [INFO ] Invariant cache hit.
[2024-06-02 21:58:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:58:06] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 183 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-02-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 2 reset in 66 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 32169 steps (1737 resets) in 57 ms. (554 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 4 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 96 transition count 268
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 95 transition count 268
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 2 with 6 rules applied. Total rules applied 10 place count 92 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 92 transition count 268
Applied a total of 16 rules in 18 ms. Remains 92 /98 variables (removed 6) and now considering 268/271 (removed 3) transitions.
[2024-06-02 21:58:07] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 92 cols
[2024-06-02 21:58:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:58:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 21:58:07] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 21:58:07] [INFO ] Invariant cache hit.
[2024-06-02 21:58:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:58:07] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-02 21:58:07] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 21:58:07] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 21:58:07] [INFO ] Invariant cache hit.
[2024-06-02 21:58:07] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 21:58:08] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:58:08] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:58:08] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:58:08] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-06-02 21:58:08] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-02 21:58:08] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/326 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/327 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 8352 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 265/406 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 21:58:18] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 21:58:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:58:21] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/327 variables, and 410 constraints, problems are : Problem set: 0 solved, 265 unsolved in 19899 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 28395ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 28399ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/98 places, 268/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28616 ms. Remains : 92/98 places, 268/271 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 31310 steps (2035 resets) in 72 ms. (428 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 1 reset in 60 ms.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 268/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 21:58:36] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 21:58:36] [INFO ] Invariant cache hit.
[2024-06-02 21:58:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 21:58:36] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 21:58:36] [INFO ] Invariant cache hit.
[2024-06-02 21:58:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:58:36] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-06-02 21:58:36] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 21:58:36] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 21:58:36] [INFO ] Invariant cache hit.
[2024-06-02 21:58:36] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 21:58:37] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:58:37] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:58:37] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:58:37] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-06-02 21:58:37] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:58:38] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/326 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/327 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 8272 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 265/406 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 21:58:47] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 21:58:50] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:58:50] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/327 variables, and 410 constraints, problems are : Problem set: 0 solved, 265 unsolved in 19102 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 27520ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 27524ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27748 ms. Remains : 92/92 places, 268/268 transitions.
Treatment of property FireWire-PT-02-LTLFireability-15 finished in 57669 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) U (X(p1)||!p1)) U X(p0))))'
Found a Lengthening insensitive property : FireWire-PT-02-LTLFireability-04
Stuttering acceptance computed with spot in 133 ms :[true, p0, p0, p0]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 99 transition count 274
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 99 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 99 transition count 273
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 97 transition count 269
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 97 transition count 269
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 3 with 6 rules applied. Total rules applied 21 place count 94 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 94 transition count 272
Applied a total of 24 rules in 24 ms. Remains 94 /104 variables (removed 10) and now considering 272/284 (removed 12) transitions.
[2024-06-02 21:59:04] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
// Phase 1: matrix 239 rows 94 cols
[2024-06-02 21:59:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:59:04] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 21:59:04] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 21:59:04] [INFO ] Invariant cache hit.
[2024-06-02 21:59:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 21:59:04] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 195 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 93/104 places, 272/284 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 222 ms. Remains : 93/104 places, 272/284 transitions.
Running random walk in product with property : FireWire-PT-02-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 2 reset in 58 ms.
Computed a total of 3 stabilizing places and 9 stable transitions
Computed a total of 3 stabilizing places and 9 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2421 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (601 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1767 steps, run visited all 1 properties in 5 ms. (steps per millisecond=353 )
Probabilistic random walk after 1767 steps, saw 910 distinct states, run finished after 6 ms. (steps per millisecond=294 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 117 ms :[true, p0, p0, p0]
Support contains 2 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 272/272 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-02 21:59:05] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
// Phase 1: matrix 239 rows 93 cols
[2024-06-02 21:59:05] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:59:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 21:59:05] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 21:59:05] [INFO ] Invariant cache hit.
[2024-06-02 21:59:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 21:59:05] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-06-02 21:59:05] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 21:59:05] [INFO ] Invariant cache hit.
[2024-06-02 21:59:05] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-02 21:59:06] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:59:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:59:06] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:59:07] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-06-02 21:59:07] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:59:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:59:07] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:59:07] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:59:07] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:59:07] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 238/331 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 38/148 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-02 21:59:10] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/332 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 150 constraints, problems are : Problem set: 0 solved, 271 unsolved in 11681 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 238/331 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 271/420 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/332 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 421 constraints, problems are : Problem set: 0 solved, 271 unsolved in 14143 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 11/11 constraints]
After SMT, in 25973ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 25976ms
Finished structural reductions in LTL mode , in 1 iterations and 26187 ms. Remains : 93/93 places, 272/272 transitions.
Computed a total of 3 stabilizing places and 9 stable transitions
Computed a total of 3 stabilizing places and 9 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2391 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (678 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1767 steps, run visited all 1 properties in 5 ms. (steps per millisecond=353 )
Probabilistic random walk after 1767 steps, saw 910 distinct states, run finished after 5 ms. (steps per millisecond=353 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 110 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 1 reset in 61 ms.
Product exploration explored 100000 steps with 2 reset in 53 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 97 ms :[true, p0, p0, p0]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 272/272 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 93 transition count 269
Applied a total of 3 rules in 8 ms. Remains 93 /93 variables (removed 0) and now considering 269/272 (removed 3) transitions.
[2024-06-02 21:59:32] [INFO ] Redundant transitions in 1 ms returned []
Running 268 sub problems to find dead transitions.
[2024-06-02 21:59:32] [INFO ] Flow matrix only has 236 transitions (discarded 33 similar events)
// Phase 1: matrix 236 rows 93 cols
[2024-06-02 21:59:32] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:59:32] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-06-02 21:59:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:59:34] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 235/328 variables, 93/108 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/329 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 147 constraints, problems are : Problem set: 0 solved, 268 unsolved in 9658 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 235/328 variables, 93/108 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 268/414 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/329 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 415 constraints, problems are : Problem set: 0 solved, 268 unsolved in 17346 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 8/8 constraints]
After SMT, in 27154ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 27157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/93 places, 269/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27171 ms. Remains : 93/93 places, 269/272 transitions.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-02 21:59:59] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
// Phase 1: matrix 239 rows 93 cols
[2024-06-02 21:59:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:59:59] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 21:59:59] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 21:59:59] [INFO ] Invariant cache hit.
[2024-06-02 21:59:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 21:59:59] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-06-02 21:59:59] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 21:59:59] [INFO ] Invariant cache hit.
[2024-06-02 21:59:59] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-06-02 22:00:01] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 238/331 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 38/148 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-02 22:00:04] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/332 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 150 constraints, problems are : Problem set: 0 solved, 271 unsolved in 11749 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 238/331 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 271/420 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/332 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 421 constraints, problems are : Problem set: 0 solved, 271 unsolved in 14436 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 11/11 constraints]
After SMT, in 26318ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 26322ms
Finished structural reductions in LTL mode , in 1 iterations and 26520 ms. Remains : 93/93 places, 272/272 transitions.
Treatment of property FireWire-PT-02-LTLFireability-04 finished in 82004 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) U p1))||G(!p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&(F(p1)||X(p2)))))'
Found a Shortening insensitive property : FireWire-PT-02-LTLFireability-15
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 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 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 98 transition count 273
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 98 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 96 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 96 transition count 268
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 3 with 6 rules applied. Total rules applied 21 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 93 transition count 271
Applied a total of 24 rules in 14 ms. Remains 93 /104 variables (removed 11) and now considering 271/284 (removed 13) transitions.
[2024-06-02 22:00:26] [INFO ] Flow matrix only has 238 transitions (discarded 33 similar events)
// Phase 1: matrix 238 rows 93 cols
[2024-06-02 22:00:26] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:00:26] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:00:26] [INFO ] Flow matrix only has 238 transitions (discarded 33 similar events)
[2024-06-02 22:00:26] [INFO ] Invariant cache hit.
[2024-06-02 22:00:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:00:26] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 192 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 92/104 places, 271/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 209 ms. Remains : 92/104 places, 271/284 transitions.
Running random walk in product with property : FireWire-PT-02-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 57 ms.
Product exploration explored 100000 steps with 2 reset in 60 ms.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 30039 steps (1894 resets) in 57 ms. (517 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 102 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 4 out of 92 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 271/271 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 268
Applied a total of 3 rules in 8 ms. Remains 92 /92 variables (removed 0) and now considering 268/271 (removed 3) transitions.
[2024-06-02 22:00:27] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 92 cols
[2024-06-02 22:00:27] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:00:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:00:27] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:00:27] [INFO ] Invariant cache hit.
[2024-06-02 22:00:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:00:27] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-02 22:00:27] [INFO ] Redundant transitions in 0 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 22:00:27] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:00:27] [INFO ] Invariant cache hit.
[2024-06-02 22:00:27] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 22:00:28] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:00:28] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-02 22:00:28] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:00:28] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:00:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:00:28] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/326 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/327 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 8276 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 265/406 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 22:00:38] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 22:00:41] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:00:41] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/327 variables, and 410 constraints, problems are : Problem set: 0 solved, 265 unsolved in 19685 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 28106ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 28113ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/92 places, 268/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28304 ms. Remains : 92/92 places, 268/271 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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)]
RANDOM walk for 40000 steps (2482 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10366 steps, run visited all 1 properties in 16 ms. (steps per millisecond=647 )
Probabilistic random walk after 10366 steps, saw 5170 distinct states, run finished after 16 ms. (steps per millisecond=647 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 72 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)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 61 ms.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 268/268 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 22:00:55] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:00:55] [INFO ] Invariant cache hit.
[2024-06-02 22:00:56] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:00:56] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:00:56] [INFO ] Invariant cache hit.
[2024-06-02 22:00:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:00:56] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-02 22:00:56] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 22:00:56] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 22:00:56] [INFO ] Invariant cache hit.
[2024-06-02 22:00:56] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 22:00:56] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:00:57] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:00:57] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:00:57] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:00:57] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:00:57] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/326 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/327 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 8146 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 265/406 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 22:01:07] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 22:01:09] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:01:09] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/327 variables, and 410 constraints, problems are : Problem set: 0 solved, 265 unsolved in 19294 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 27566ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 27571ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27754 ms. Remains : 92/92 places, 268/268 transitions.
Treatment of property FireWire-PT-02-LTLFireability-15 finished in 57472 ms.
[2024-06-02 22:01:23] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:01:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 22:01:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 284 transitions and 1037 arcs took 4 ms.
Total runtime 407594 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-02

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2165
MODEL NAME: /home/mcc/execution/410/model
104 places, 284 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-02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365697222

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

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