Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r553-tall-171734901100180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901100180
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:37:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:37:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:37:21] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 18:37:21] [INFO ] Transformed 108 places.
[2024-06-02 18:37:21] [INFO ] Transformed 355 transitions.
[2024-06-02 18:37:21] [INFO ] Found NUPN structural information;
[2024-06-02 18:37:21] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 181 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 50 ms. Remains 104 /108 variables (removed 4) and now considering 284/301 (removed 17) transitions.
[2024-06-02 18:37:21] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 104 cols
[2024-06-02 18:37:21] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 18:37:21] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-02 18:37:21] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 18:37:21] [INFO ] Invariant cache hit.
[2024-06-02 18:37:22] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:37:22] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-06-02 18:37:22] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 18:37:22] [INFO ] Invariant cache hit.
[2024-06-02 18:37:22] [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 18:37:23] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 9 ms to minimize.
[2024-06-02 18:37:24] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:37:24] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:37:24] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:37:24] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:37:24] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:37:24] [INFO ] Deduced a trap composed of 17 places in 50 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 18:37:26] [INFO ] Deduced a trap composed of 22 places in 63 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 18:37:30] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:37:30] [INFO ] Deduced a trap composed of 23 places in 55 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 14188 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 17526 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 31972ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 31989ms
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 284/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32467 ms. Remains : 104/108 places, 284/301 transitions.
Support contains 41 out of 104 places after structural reductions.
[2024-06-02 18:37:54] [INFO ] Flatten gal took : 46 ms
[2024-06-02 18:37:54] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:37:54] [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 (2264 resets) in 1792 ms. (22 steps per ms) remains 18/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (109 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (53 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (58 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (56 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (72 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (62 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (10 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (54 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
[2024-06-02 18:37:55] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 18:37:55] [INFO ] Invariant cache hit.
[2024-06-02 18:37:55] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/95 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:37:55] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 8/103 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 257/360 variables, 103/112 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 38/150 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/361 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/362 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 152 constraints, problems are : Problem set: 1 solved, 14 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 74/95 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 8/103 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:37:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 257/360 variables, 103/113 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 38/151 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 12/163 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/361 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 2/166 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 1/362 variables, 1/167 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/362 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 167 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 1912ms problems are : Problem set: 1 solved, 14 unsolved
Parikh walk visited 6 properties in 7540 ms.
Support contains 12 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 0 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 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 101 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 101 transition count 276
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 98 transition count 282
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 21 place count 98 transition count 276
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 98 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 97 transition count 272
Applied a total of 25 rules in 59 ms. Remains 97 /104 variables (removed 7) and now considering 272/284 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 97/104 places, 272/284 transitions.
RANDOM walk for 40000 steps (2549 resets) in 1069 ms. (37 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (1457 resets) in 186 ms. (213 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (674 resets) in 104 ms. (380 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (58 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
[2024-06-02 18:38:05] [INFO ] Flow matrix only has 244 transitions (discarded 28 similar events)
// Phase 1: matrix 244 rows 97 cols
[2024-06-02 18:38:05] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:38:05] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 49/337 variables, 24/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 11/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/341 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 143 constraints, problems are : Problem set: 0 solved, 5 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 49/337 variables, 24/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 11/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 5/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/341 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/341 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 148 constraints, problems are : Problem set: 0 solved, 5 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 272/272 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 96 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 96 transition count 269
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 96 transition count 271
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 7 place count 95 transition count 269
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 9 place count 95 transition count 267
Applied a total of 9 rules in 32 ms. Remains 95 /97 variables (removed 2) and now considering 267/272 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 95/97 places, 267/272 transitions.
RANDOM walk for 40000 steps (2500 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1533 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (659 resets) in 32 ms. (1212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (64 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 438 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 138783 steps, run visited all 5 properties in 265 ms. (steps per millisecond=523 )
Probabilistic random walk after 138783 steps, saw 34930 distinct states, run finished after 269 ms. (steps per millisecond=515 ) 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 10 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 18:38:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 18:38:07] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:38:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:38:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:38:07] [INFO ] Invariant cache hit.
[2024-06-02 18:38:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:38:07] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [61]
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 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 3 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 200 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 390 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 2 ms.
FORMULA FireWire-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-00 finished in 665 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 15 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 18:38:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:38:07] [INFO ] Invariant cache hit.
[2024-06-02 18:38:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:38:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:38:07] [INFO ] Invariant cache hit.
[2024-06-02 18:38:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:38:07] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 18:38:07] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:38:07] [INFO ] Invariant cache hit.
[2024-06-02 18:38:07] [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 18:38:09] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:38:09] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:38:09] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:38:09] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:38:09] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:38:09] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:38:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:38:10] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:38:10] [INFO ] Deduced a trap composed of 17 places in 20 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 9809 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 17298 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 27285ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 27288ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 271/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27502 ms. Remains : 99/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 337 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 3 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 27863 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 9 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 18:38:35] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:38:35] [INFO ] Invariant cache hit.
[2024-06-02 18:38:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:38:35] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:38:35] [INFO ] Invariant cache hit.
[2024-06-02 18:38:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:38:35] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 175 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 186 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, p0, p0, p0]
Running random walk in product with property : FireWire-PT-02-LTLFireability-04
Product exploration explored 100000 steps with 4 reset in 136 ms.
Product exploration explored 100000 steps with 3 reset in 104 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 85 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 118 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2200 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (567 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1066644 steps, run visited all 1 properties in 1399 ms. (steps per millisecond=762 )
Probabilistic random walk after 1066644 steps, saw 195392 distinct states, run finished after 1399 ms. (steps per millisecond=762 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 125 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 208 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 130 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 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 18:38:38] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 18:38:38] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:38:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:38:38] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:38:38] [INFO ] Invariant cache hit.
[2024-06-02 18:38:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:38:38] [INFO ] Implicit Places using invariants and state equation in 218 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 18:38:38] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:38:38] [INFO ] Invariant cache hit.
[2024-06-02 18:38:38] [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 18:38:39] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 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 18:38:41] [INFO ] Deduced a trap composed of 36 places in 61 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 10582 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 15202 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 25917ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 25921ms
Finished structural reductions in LTL mode , in 1 iterations and 26205 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 69 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 103 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2255 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (579 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1066644 steps, run visited all 1 properties in 1279 ms. (steps per millisecond=833 )
Probabilistic random walk after 1066644 steps, saw 195392 distinct states, run finished after 1279 ms. (steps per millisecond=833 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 183 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 107 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 121 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 107 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 3 reset in 86 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 110 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 0 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 1 ms
Applied a total of 13 rules in 26 ms. Remains 97 /98 variables (removed 1) and now considering 276/271 (removed -5) transitions.
[2024-06-02 18:39:07] [INFO ] Redundant transitions in 18 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 18:39:07] [INFO ] Flow matrix only has 243 transitions (discarded 33 similar events)
// Phase 1: matrix 243 rows 97 cols
[2024-06-02 18:39:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:39:07] [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 18:39:08] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 18:39:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-06-02 18:39:08] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-02 18:39:09] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:39:09] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
[2024-06-02 18:39:09] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:39:09] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:39:09] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-06-02 18:39:09] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2024-06-02 18:39:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 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 10268 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 19339 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 29767ms problems are : Problem set: 7 solved, 268 unsolved
Search for dead transitions found 7 dead transitions in 29771ms
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.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 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 29855 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 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 18:39:37] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 18:39:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:39:37] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:39:37] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:39:37] [INFO ] Invariant cache hit.
[2024-06-02 18:39:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:39:37] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 18:39:37] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:39:37] [INFO ] Invariant cache hit.
[2024-06-02 18:39:37] [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 18:39:38] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:39:38] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:39:38] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 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 18:39:39] [INFO ] Deduced a trap composed of 36 places in 58 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 10578 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 15422 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 26142ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 26147ms
Finished structural reductions in LTL mode , in 1 iterations and 26484 ms. Remains : 98/98 places, 271/271 transitions.
Treatment of property FireWire-PT-02-LTLFireability-04 finished in 88106 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 6 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 18:40:03] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 18:40:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:40:03] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:40:03] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:40:03] [INFO ] Invariant cache hit.
[2024-06-02 18:40:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:03] [INFO ] Implicit Places using invariants and state equation in 117 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 186 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 180 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 1 ms.
FORMULA FireWire-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-05 finished in 391 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 5 ms. Remains 101 /104 variables (removed 3) and now considering 276/284 (removed 8) transitions.
[2024-06-02 18:40:04] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
// Phase 1: matrix 250 rows 101 cols
[2024-06-02 18:40:04] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:40:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:40:04] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2024-06-02 18:40:04] [INFO ] Invariant cache hit.
[2024-06-02 18:40:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:40:04] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [63]
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 : 100/104 places, 276/284 transitions.
Applied a total of 0 rules in 1 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 184 ms. Remains : 100/104 places, 276/284 transitions.
Stuttering acceptance computed with spot in 59 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 311 ms.
Product exploration explored 100000 steps with 50000 reset in 202 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 21 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 794 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 18:40:04] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 18:40:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:40:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:40:04] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:40:04] [INFO ] Invariant cache hit.
[2024-06-02 18:40:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:05] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 190 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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 198 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 224 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 24988 reset in 113 ms.
Product exploration explored 100000 steps with 25052 reset in 143 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 88 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 254 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 40000 steps (2169 resets) in 78 ms. (506 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (28 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 18:40:05] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 18:40:05] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:40:05] [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 108 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 181 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 298ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2239 steps, including 259 resets, run visited all 1 properties in 5 ms. (steps per millisecond=447 )
Parikh walk visited 1 properties in 11 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 246 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 279 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 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 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 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 26 ms. Remains 93 /98 variables (removed 5) and now considering 268/271 (removed 3) transitions.
[2024-06-02 18:40:07] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
// Phase 1: matrix 238 rows 93 cols
[2024-06-02 18:40:07] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:40:07] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-02 18:40:07] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 18:40:07] [INFO ] Invariant cache hit.
[2024-06-02 18:40:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:07] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-02 18:40:07] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:40:07] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 18:40:07] [INFO ] Invariant cache hit.
[2024-06-02 18:40:07] [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 18:40:08] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-06-02 18:40:08] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:40:08] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:40:08] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:40:08] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:40:08] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:40:08] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 8 ms to minimize.
[2024-06-02 18:40:09] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:40:09] [INFO ] Deduced a trap composed of 15 places in 80 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 8788 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 14512 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 23494ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 23498ms
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 23875 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 131 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 241 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
RANDOM walk for 40000 steps (2546 resets) in 97 ms. (408 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (46 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
[2024-06-02 18:40:31] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 18:40:31] [INFO ] Invariant cache hit.
[2024-06-02 18:40:31] [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 127 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 179 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 314ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2578 steps, including 652 resets, run visited all 1 properties in 5 ms. (steps per millisecond=515 )
Parikh walk visited 1 properties in 4 ms.
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 347 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 271 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 277 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 60 ms.
Product exploration explored 100000 steps with 0 reset in 63 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 18:40:33] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 18:40:33] [INFO ] Invariant cache hit.
[2024-06-02 18:40:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:40:33] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 18:40:33] [INFO ] Invariant cache hit.
[2024-06-02 18:40:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:33] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 18:40:33] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:40:33] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 18:40:33] [INFO ] Invariant cache hit.
[2024-06-02 18:40:33] [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 18:40:34] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:40:34] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-02 18:40:34] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:40:34] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:40:34] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2024-06-02 18:40:34] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2024-06-02 18:40:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:40:34] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:40:34] [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 8456 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 14403 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 23004ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 23007ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23207 ms. Remains : 93/93 places, 268/268 transitions.
Treatment of property FireWire-PT-02-LTLFireability-08 finished in 51372 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 27 ms. Remains 95 /104 variables (removed 9) and now considering 273/284 (removed 11) transitions.
[2024-06-02 18:40:56] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 95 cols
[2024-06-02 18:40:56] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:40:56] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:40:56] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 18:40:56] [INFO ] Invariant cache hit.
[2024-06-02 18:40:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:40:57] [INFO ] Implicit Places using invariants and state equation in 771 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 866 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 5 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 898 ms. Remains : 94/104 places, 273/284 transitions.
Stuttering acceptance computed with spot in 201 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 1157 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 27 ms. Remains 93 /104 variables (removed 11) and now considering 268/284 (removed 16) transitions.
[2024-06-02 18:40:57] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2024-06-02 18:40:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:40:57] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 18:40:57] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:40:57] [INFO ] Invariant cache hit.
[2024-06-02 18:40:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:57] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 204 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 3 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 234 ms. Remains : 92/104 places, 268/284 transitions.
Stuttering acceptance computed with spot in 36 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 1 ms.
FORMULA FireWire-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-11 finished in 284 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 29 ms. Remains 93 /104 variables (removed 11) and now considering 268/284 (removed 16) transitions.
[2024-06-02 18:40:57] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:40:57] [INFO ] Invariant cache hit.
[2024-06-02 18:40:58] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-06-02 18:40:58] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:40:58] [INFO ] Invariant cache hit.
[2024-06-02 18:40:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:58] [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 614 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 17 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 661 ms. Remains : 92/104 places, 268/284 transitions.
Stuttering acceptance computed with spot in 46 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 720 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 3 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 18:40:58] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 18:40:58] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:40:58] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 18:40:58] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:40:58] [INFO ] Invariant cache hit.
[2024-06-02 18:40:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:58] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 307 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 311 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 343 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 672 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 3 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 18:40:59] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:40:59] [INFO ] Invariant cache hit.
[2024-06-02 18:40:59] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:40:59] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 18:40:59] [INFO ] Invariant cache hit.
[2024-06-02 18:40:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:59] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 229 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 0 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 234 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 110 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 1 reset in 57 ms.
Product exploration explored 100000 steps with 8 reset in 61 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 98 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 31 ms :[(NOT p0)]
RANDOM walk for 30398 steps (1651 resets) in 69 ms. (434 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 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 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 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 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 15 ms. Remains 92 /98 variables (removed 6) and now considering 268/271 (removed 3) transitions.
[2024-06-02 18:41:00] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 92 cols
[2024-06-02 18:41:00] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:41:00] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 18:41:00] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:41:00] [INFO ] Invariant cache hit.
[2024-06-02 18:41:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:41:00] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-06-02 18:41:00] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:41:00] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:41:00] [INFO ] Invariant cache hit.
[2024-06-02 18:41:00] [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 18:41:01] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:41:01] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:41:01] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:41:01] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:41:01] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:41:01] [INFO ] Deduced a trap composed of 15 places in 48 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 8299 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 18:41:11] [INFO ] Deduced a trap composed of 32 places in 59 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 18:41:14] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-02 18:41:14] [INFO ] Deduced a trap composed of 32 places in 58 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 19990 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 28445ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 28448ms
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 28720 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 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 31195 steps (1969 resets) in 102 ms. (302 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 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 2 reset in 103 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 18:41:29] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:41:29] [INFO ] Invariant cache hit.
[2024-06-02 18:41:29] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:41:29] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:41:29] [INFO ] Invariant cache hit.
[2024-06-02 18:41:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:41:29] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 18:41:29] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:41:29] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:41:29] [INFO ] Invariant cache hit.
[2024-06-02 18:41:29] [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 18:41:30] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:41:30] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:41:30] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:41:30] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:41:30] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:41:30] [INFO ] Deduced a trap composed of 15 places in 46 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 8412 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 18:41:40] [INFO ] Deduced a trap composed of 32 places in 53 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 18:41:43] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:41:43] [INFO ] Deduced a trap composed of 32 places in 47 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 20322 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 28873ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 28876ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29063 ms. Remains : 92/92 places, 268/268 transitions.
Treatment of property FireWire-PT-02-LTLFireability-15 finished in 59229 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 130 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 1 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 1 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 22 ms. Remains 94 /104 variables (removed 10) and now considering 272/284 (removed 12) transitions.
[2024-06-02 18:41:58] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
// Phase 1: matrix 239 rows 94 cols
[2024-06-02 18:41:58] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:41:58] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:41:58] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 18:41:58] [INFO ] Invariant cache hit.
[2024-06-02 18:41:58] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:41:58] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 185 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 4 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 211 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 55 ms.
Product exploration explored 100000 steps with 1 reset in 53 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 67 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 136 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2440 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (724 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1767 steps, run visited all 1 properties in 7 ms. (steps per millisecond=252 )
Probabilistic random walk after 1767 steps, saw 910 distinct states, run finished after 7 ms. (steps per millisecond=252 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 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 125 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 121 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 18:41:59] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
// Phase 1: matrix 239 rows 93 cols
[2024-06-02 18:41:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:41:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:41:59] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 18:41:59] [INFO ] Invariant cache hit.
[2024-06-02 18:41:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:41:59] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-06-02 18:41:59] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 18:41:59] [INFO ] Invariant cache hit.
[2024-06-02 18:41: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 18:42:01] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 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 18:42:04] [INFO ] Deduced a trap composed of 15 places in 58 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 11650 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 14189 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 25988ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 25992ms
Finished structural reductions in LTL mode , in 1 iterations and 26181 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 79 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 123 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2374 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (713 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1767 steps, run visited all 1 properties in 6 ms. (steps per millisecond=294 )
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 104 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 141 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 121 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 147 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 4 reset in 64 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 152 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 13 ms. Remains 93 /93 variables (removed 0) and now considering 269/272 (removed 3) transitions.
[2024-06-02 18:42:26] [INFO ] Redundant transitions in 1 ms returned []
Running 268 sub problems to find dead transitions.
[2024-06-02 18:42:26] [INFO ] Flow matrix only has 236 transitions (discarded 33 similar events)
// Phase 1: matrix 236 rows 93 cols
[2024-06-02 18:42:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:42:26] [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 18:42:28] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2024-06-02 18:42:28] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:42:28] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:42:28] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-06-02 18:42:28] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:42:28] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:42:28] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 4 ms to minimize.
[2024-06-02 18:42:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 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 9783 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 17971 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 27903ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 27906ms
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 27926 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 1 ms. Remains 93 /93 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-02 18:42:54] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
// Phase 1: matrix 239 rows 93 cols
[2024-06-02 18:42:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:42:54] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 18:42:54] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 18:42:54] [INFO ] Invariant cache hit.
[2024-06-02 18:42:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:42:55] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-06-02 18:42:55] [INFO ] Flow matrix only has 239 transitions (discarded 33 similar events)
[2024-06-02 18:42:55] [INFO ] Invariant cache hit.
[2024-06-02 18:42:55] [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 18:42:56] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:42:57] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:42:57] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 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 18:42:59] [INFO ] Deduced a trap composed of 15 places in 56 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 11533 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 14574 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 26254ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 26257ms
Finished structural reductions in LTL mode , in 1 iterations and 26470 ms. Remains : 93/93 places, 272/272 transitions.
Treatment of property FireWire-PT-02-LTLFireability-04 finished in 82999 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 130 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 19 ms. Remains 93 /104 variables (removed 11) and now considering 271/284 (removed 13) transitions.
[2024-06-02 18:43:21] [INFO ] Flow matrix only has 238 transitions (discarded 33 similar events)
// Phase 1: matrix 238 rows 93 cols
[2024-06-02 18:43:21] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:43:21] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:43:21] [INFO ] Flow matrix only has 238 transitions (discarded 33 similar events)
[2024-06-02 18:43:21] [INFO ] Invariant cache hit.
[2024-06-02 18:43:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:43:21] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 196 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 4 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 221 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 2 reset in 65 ms.
Product exploration explored 100000 steps with 1 reset in 68 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 142 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 33 ms :[(NOT p0)]
RANDOM walk for 32320 steps (2110 resets) in 79 ms. (404 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 159 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 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 5 ms. Remains 92 /92 variables (removed 0) and now considering 268/271 (removed 3) transitions.
[2024-06-02 18:43:22] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 92 cols
[2024-06-02 18:43:22] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:43:22] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:43:22] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:43:22] [INFO ] Invariant cache hit.
[2024-06-02 18:43:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:43:22] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-02 18:43:22] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:43:22] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:43:22] [INFO ] Invariant cache hit.
[2024-06-02 18:43:22] [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 18:43:23] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:43:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:43:23] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:43:23] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-06-02 18:43:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:43:24] [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 8256 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 18:43:33] [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 18:43:36] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:43:36] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 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 19902 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 28295ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 28300ms
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 28526 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 101 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 38 ms :[(NOT p0)]
RANDOM walk for 31138 steps (2001 resets) in 53 ms. (576 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 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 66 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 18:43:51] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:43:51] [INFO ] Invariant cache hit.
[2024-06-02 18:43:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:43:51] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:43:51] [INFO ] Invariant cache hit.
[2024-06-02 18:43:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:43:51] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-02 18:43:51] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:43:51] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:43:51] [INFO ] Invariant cache hit.
[2024-06-02 18:43:51] [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 18:43:52] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:43:52] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:43:52] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:43:52] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:43:53] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:43:53] [INFO ] Deduced a trap composed of 15 places in 54 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 8212 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 18:44:02] [INFO ] Deduced a trap composed of 32 places in 53 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 18:44:05] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:44:05] [INFO ] Deduced a trap composed of 32 places in 44 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 19729 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 28075ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 28079ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28270 ms. Remains : 92/92 places, 268/268 transitions.
Treatment of property FireWire-PT-02-LTLFireability-15 finished in 58463 ms.
[2024-06-02 18:44:19] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:44:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 18:44:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 284 transitions and 1037 arcs took 5 ms.
Total runtime 418654 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-02-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-02-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-02-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717353860518

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FireWire-PT-02-LTLFireability-04
ltl formula formula --ltl=/tmp/2133/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 284 transitions and 1037 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2133/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2133/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2133/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2133/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 105, there are 292 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~184 levels ~10000 states ~32212 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~101!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5378
pnml2lts-mc( 0/ 4): unique states count: 13070
pnml2lts-mc( 0/ 4): unique transitions count: 43489
pnml2lts-mc( 0/ 4): - self-loop count: 5413
pnml2lts-mc( 0/ 4): - claim dead count: 11789
pnml2lts-mc( 0/ 4): - claim found count: 11292
pnml2lts-mc( 0/ 4): - claim success count: 13282
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1552
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13450 states 44948 transitions, fanout: 3.342
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.110 sec minimum, 0.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 122273, Transitions per second: 408618
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 9.5 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 287 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name FireWire-PT-02-LTLFireability-08
ltl formula formula --ltl=/tmp/2133/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 284 transitions and 1037 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2133/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2133/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2133/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2133/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 105, there are 339 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~41!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 44
pnml2lts-mc( 0/ 4): unique states count: 199
pnml2lts-mc( 0/ 4): unique transitions count: 1101
pnml2lts-mc( 0/ 4): - self-loop count: 114
pnml2lts-mc( 0/ 4): - claim dead count: 79
pnml2lts-mc( 0/ 4): - claim found count: 111
pnml2lts-mc( 0/ 4): - claim success count: 209
pnml2lts-mc( 0/ 4): - cum. max stack depth: 165
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 209 states 1152 transitions, fanout: 5.512
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 14.3 B/state, compr.: 3.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 287 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name FireWire-PT-02-LTLFireability-15
ltl formula formula --ltl=/tmp/2133/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 284 transitions and 1037 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2133/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2133/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2133/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2133/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 105, there are 319 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~114!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 213
pnml2lts-mc( 0/ 4): unique states count: 644
pnml2lts-mc( 0/ 4): unique transitions count: 7533
pnml2lts-mc( 0/ 4): - self-loop count: 1090
pnml2lts-mc( 0/ 4): - claim dead count: 1438
pnml2lts-mc( 0/ 4): - claim found count: 1417
pnml2lts-mc( 0/ 4): - claim success count: 656
pnml2lts-mc( 0/ 4): - cum. max stack depth: 387
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 656 states 7636 transitions, fanout: 11.640
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.0 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 287 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-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 r553-tall-171734901100180"
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 ;