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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 86K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-03-LTLCardinality-00
FORMULA_NAME FireWire-PT-03-LTLCardinality-01
FORMULA_NAME FireWire-PT-03-LTLCardinality-02
FORMULA_NAME FireWire-PT-03-LTLCardinality-03
FORMULA_NAME FireWire-PT-03-LTLCardinality-04
FORMULA_NAME FireWire-PT-03-LTLCardinality-05
FORMULA_NAME FireWire-PT-03-LTLCardinality-06
FORMULA_NAME FireWire-PT-03-LTLCardinality-07
FORMULA_NAME FireWire-PT-03-LTLCardinality-08
FORMULA_NAME FireWire-PT-03-LTLCardinality-09
FORMULA_NAME FireWire-PT-03-LTLCardinality-10
FORMULA_NAME FireWire-PT-03-LTLCardinality-11
FORMULA_NAME FireWire-PT-03-LTLCardinality-12
FORMULA_NAME FireWire-PT-03-LTLCardinality-13
FORMULA_NAME FireWire-PT-03-LTLCardinality-14
FORMULA_NAME FireWire-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717353566177

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:39:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:39:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:39:27] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 18:39:27] [INFO ] Transformed 112 places.
[2024-06-02 18:39:27] [INFO ] Transformed 356 transitions.
[2024-06-02 18:39:27] [INFO ] Found NUPN structural information;
[2024-06-02 18:39:27] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 303/303 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 112 transition count 297
Applied a total of 6 rules in 25 ms. Remains 112 /112 variables (removed 0) and now considering 297/303 (removed 6) transitions.
[2024-06-02 18:39:27] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 18:39:27] [INFO ] Computed 9 invariants in 28 ms
[2024-06-02 18:39:27] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-02 18:39:27] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 18:39:27] [INFO ] Invariant cache hit.
[2024-06-02 18:39:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:39:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 18:39:28] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 18:39:28] [INFO ] Invariant cache hit.
[2024-06-02 18:39:28] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 18:39:30] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 9 ms to minimize.
[2024-06-02 18:39:30] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:39:31] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2024-06-02 18:39:31] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:39:31] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2024-06-02 18:39:31] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2024-06-02 18:39:32] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:39:32] [INFO ] Deduced a trap composed of 37 places in 295 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 282 constraints, problems are : Problem set: 0 solved, 296 unsolved in 13862 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 296/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 578 constraints, problems are : Problem set: 0 solved, 296 unsolved in 18961 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
After SMT, in 33114ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 33136ms
Starting structural reductions in LTL mode, iteration 1 : 112/112 places, 297/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33639 ms. Remains : 112/112 places, 297/303 transitions.
Support contains 30 out of 112 places after structural reductions.
[2024-06-02 18:40:01] [INFO ] Flatten gal took : 44 ms
[2024-06-02 18:40:01] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:40:01] [INFO ] Input system was already deterministic with 297 transitions.
Support contains 27 out of 112 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (2015 resets) in 1610 ms. (24 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40000 steps (471 resets) in 84 ms. (470 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (492 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (512 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (483 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
[2024-06-02 18:40:02] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 18:40:02] [INFO ] Invariant cache hit.
[2024-06-02 18:40:02] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 72/79 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/112 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:40:02] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 270/382 variables, 112/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 40/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/383 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 275 constraints, problems are : Problem set: 0 solved, 4 unsolved in 336 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 72/79 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/112 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:40:02] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 270/382 variables, 112/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 40/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:40:02] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:40:02] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:40:02] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/383 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/383 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 283 constraints, problems are : Problem set: 0 solved, 4 unsolved in 502 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 849ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 476 ms.
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 293
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 293
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 108 transition count 285
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 108 transition count 285
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 106 transition count 281
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 106 transition count 281
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 104 transition count 279
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 102 transition count 284
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 102 transition count 280
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 31 place count 102 transition count 276
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 102 transition count 302
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 39 place count 100 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 52 place count 100 transition count 285
Applied a total of 52 rules in 96 ms. Remains 100 /112 variables (removed 12) and now considering 285/297 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 100/112 places, 285/297 transitions.
RANDOM walk for 40000 steps (2234 resets) in 889 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (535 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (559 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (563 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (543 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 885576 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :1 out of 4
Probabilistic random walk after 885576 steps, saw 170832 distinct states, run finished after 3004 ms. (steps per millisecond=294 ) properties seen :1
[2024-06-02 18:40:07] [INFO ] Flow matrix only has 258 transitions (discarded 27 similar events)
// Phase 1: matrix 258 rows 100 cols
[2024-06-02 18:40:07] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 18:40:07] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:40:07] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 258/358 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 151 constraints, problems are : Problem set: 0 solved, 3 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 258/358 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:40:07] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 155 constraints, problems are : Problem set: 0 solved, 3 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 533ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 359 ms.
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 285/285 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/100 places, 285/285 transitions.
RANDOM walk for 40000 steps (2098 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (531 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (584 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (573 resets) in 30 ms. (1290 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 744891 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 3
Probabilistic random walk after 744891 steps, saw 146013 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
[2024-06-02 18:40:11] [INFO ] Flow matrix only has 258 transitions (discarded 27 similar events)
[2024-06-02 18:40:11] [INFO ] Invariant cache hit.
[2024-06-02 18:40:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 258/358 variables, 100/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 41/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/358 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 150 constraints, problems are : Problem set: 0 solved, 3 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:40:11] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:40:11] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:40:11] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 258/358 variables, 100/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:40:11] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2024-06-02 18:40:11] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 158 constraints, problems are : Problem set: 0 solved, 3 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 516 ms.
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 285/285 transitions.
Applied a total of 0 rules in 23 ms. Remains 100 /100 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 100/100 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 285/285 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-02 18:40:12] [INFO ] Flow matrix only has 258 transitions (discarded 27 similar events)
[2024-06-02 18:40:12] [INFO ] Invariant cache hit.
[2024-06-02 18:40:12] [INFO ] Implicit Places using invariants in 70 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/100 places, 285/285 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 99 transition count 284
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 284
Applied a total of 2 rules in 9 ms. Remains 98 /99 variables (removed 1) and now considering 284/285 (removed 1) transitions.
[2024-06-02 18:40:12] [INFO ] Flow matrix only has 257 transitions (discarded 27 similar events)
// Phase 1: matrix 257 rows 98 cols
[2024-06-02 18:40:12] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:40:12] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 18:40:12] [INFO ] Flow matrix only has 257 transitions (discarded 27 similar events)
[2024-06-02 18:40:12] [INFO ] Invariant cache hit.
[2024-06-02 18:40:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:40:12] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/100 places, 284/285 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 314 ms. Remains : 98/100 places, 284/285 transitions.
RANDOM walk for 40000 steps (2255 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (630 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (592 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (576 resets) in 26 ms. (1481 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5198 steps, run visited all 3 properties in 28 ms. (steps per millisecond=185 )
Probabilistic random walk after 5198 steps, saw 2981 distinct states, run finished after 35 ms. (steps per millisecond=148 ) properties seen :3
FORMULA FireWire-PT-03-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-03-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 101 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 101 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 100 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 99 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 99 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 98 transition count 279
Applied a total of 32 rules in 37 ms. Remains 98 /112 variables (removed 14) and now considering 279/297 (removed 18) transitions.
[2024-06-02 18:40:13] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
// Phase 1: matrix 247 rows 98 cols
[2024-06-02 18:40:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:40:13] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:40:13] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:40:13] [INFO ] Invariant cache hit.
[2024-06-02 18:40:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:13] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 18:40:13] [INFO ] Redundant transitions in 12 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:40:13] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:40:13] [INFO ] Invariant cache hit.
[2024-06-02 18:40:13] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:40:18] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:40:21] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13261 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9578 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 23008ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 23011ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/112 places, 279/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23245 ms. Remains : 98/112 places, 279/297 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 76 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16468 steps (1051 resets) in 90 ms. (180 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 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 279/279 transitions.
Applied a total of 0 rules in 15 ms. Remains 98 /98 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 18:40:37] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:40:37] [INFO ] Invariant cache hit.
[2024-06-02 18:40:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:40:37] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:40:37] [INFO ] Invariant cache hit.
[2024-06-02 18:40:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:37] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-06-02 18:40:37] [INFO ] Redundant transitions in 4 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:40:37] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:40:37] [INFO ] Invariant cache hit.
[2024-06-02 18:40:37] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:40:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:40:39] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:40:39] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:40:42] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:40:45] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13178 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9722 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 23096ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 23104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23336 ms. Remains : 98/98 places, 279/279 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20698 steps (1270 resets) in 55 ms. (369 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 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 73 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 279/279 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 18:41:01] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:41:01] [INFO ] Invariant cache hit.
[2024-06-02 18:41:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:41:01] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:41:01] [INFO ] Invariant cache hit.
[2024-06-02 18:41:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:41:01] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-02 18:41:01] [INFO ] Redundant transitions in 4 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:41:01] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:41:01] [INFO ] Invariant cache hit.
[2024-06-02 18:41:01] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:41:02] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 0 ms to minimize.
[2024-06-02 18:41:02] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:41:02] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:41:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:41:02] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:41:02] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:41:03] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:41:03] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-02 18:41:03] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:41:06] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:41:09] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9686 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 22876ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22880ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23082 ms. Remains : 98/98 places, 279/279 transitions.
Treatment of property FireWire-PT-03-LTLCardinality-00 finished in 71569 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))||G(p1)))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 102 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 102 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 101 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 100 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 26 place count 100 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 99 transition count 279
Applied a total of 28 rules in 24 ms. Remains 99 /112 variables (removed 13) and now considering 279/297 (removed 18) transitions.
[2024-06-02 18:41:24] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
// Phase 1: matrix 250 rows 99 cols
[2024-06-02 18:41:24] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 18:41:24] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:41:24] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:41:24] [INFO ] Invariant cache hit.
[2024-06-02 18:41:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:41:24] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-06-02 18:41:24] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:41:24] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:41:24] [INFO ] Invariant cache hit.
[2024-06-02 18:41:24] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:41:25] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:41:25] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:41:25] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:41:25] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
[2024-06-02 18:41:25] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:41:26] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:41:26] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:41:26] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:41:26] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:41:26] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:41:26] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/348 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/349 variables, and 155 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7818 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/348 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 276/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/349 variables, and 431 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 16981ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 16984ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/112 places, 279/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17185 ms. Remains : 99/112 places, 279/297 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 51 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 467 steps (29 resets) in 7 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 104 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 279/279 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 18:41:42] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:41:42] [INFO ] Invariant cache hit.
[2024-06-02 18:41:42] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:41:42] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:41:42] [INFO ] Invariant cache hit.
[2024-06-02 18:41:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:41:42] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 18:41:42] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:41:42] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:41:42] [INFO ] Invariant cache hit.
[2024-06-02 18:41:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:41:43] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:41:43] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 0 ms to minimize.
[2024-06-02 18:41:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:41:43] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:41:43] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:41:43] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:41:43] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:41:43] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:41:44] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:41:44] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-02 18:41:44] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/348 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/349 variables, and 155 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7904 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/348 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 276/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/349 variables, and 431 constraints, problems are : Problem set: 0 solved, 276 unsolved in 8960 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 17000ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 17003ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17220 ms. Remains : 99/99 places, 279/279 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 47 ms :[(NOT p0)]
RANDOM walk for 271 steps (19 resets) in 5 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 40 steps with 1 reset in 0 ms.
FORMULA FireWire-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-02 finished in 35373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 18:41:59] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 18:41:59] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:41:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:41:59] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:41:59] [INFO ] Invariant cache hit.
[2024-06-02 18:42:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:42:00] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 18:42:00] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:42:00] [INFO ] Invariant cache hit.
[2024-06-02 18:42:00] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:42:01] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:42:02] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:42:02] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:42:02] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11157 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:42:12] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20127 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31435ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31439ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31651 ms. Remains : 107/112 places, 285/297 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-03 finished in 31790 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 (p1&&(p2 U p0)))))'
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 290
Applied a total of 6 rules in 2 ms. Remains 109 /112 variables (removed 3) and now considering 290/297 (removed 7) transitions.
[2024-06-02 18:42:31] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 109 cols
[2024-06-02 18:42:31] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:42:31] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:42:31] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 18:42:31] [INFO ] Invariant cache hit.
[2024-06-02 18:42:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:42:31] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-06-02 18:42:31] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 18:42:31] [INFO ] Invariant cache hit.
[2024-06-02 18:42:31] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 11709 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16587 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
After SMT, in 28440ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 28444ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 290/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28654 ms. Remains : 109/112 places, 290/297 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-06 finished in 28842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 291
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 3 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
[2024-06-02 18:43:00] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2024-06-02 18:43:00] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:43:00] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:43:00] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 18:43:00] [INFO ] Invariant cache hit.
[2024-06-02 18:43:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:43:00] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 18:43:00] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 18:43:00] [INFO ] Invariant cache hit.
[2024-06-02 18:43:00] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 18:43:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:43:02] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:43:02] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:43:02] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-02 18:43:02] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:43:02] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:43:02] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:43:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:43:03] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 165 constraints, problems are : Problem set: 0 solved, 286 unsolved in 11742 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 451 constraints, problems are : Problem set: 0 solved, 286 unsolved in 14801 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
After SMT, in 26680ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 26687ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27000 ms. Remains : 108/112 places, 287/297 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-07
Stuttering criterion allowed to conclude after 265 steps with 90 reset in 4 ms.
FORMULA FireWire-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-07 finished in 27215 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(X(F(p0)))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 5 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 18:43:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 18:43:27] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:43:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:43:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:43:27] [INFO ] Invariant cache hit.
[2024-06-02 18:43:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:43:27] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 18:43:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:43:27] [INFO ] Invariant cache hit.
[2024-06-02 18:43:27] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:43:30] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:43:30] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11565 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:43:40] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20705 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32423ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32427ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32619 ms. Remains : 107/112 places, 285/297 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 140 ms.
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 31841 steps (1568 resets) in 87 ms. (361 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 285/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-02 18:44:01] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:44:01] [INFO ] Invariant cache hit.
[2024-06-02 18:44:01] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:44:01] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:44:01] [INFO ] Invariant cache hit.
[2024-06-02 18:44:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:44:01] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 18:44:01] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:44:01] [INFO ] Invariant cache hit.
[2024-06-02 18:44:01] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:44:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:44:03] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:44:03] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:44:03] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2024-06-02 18:44:03] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:44:03] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:44:03] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:44:03] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:44:04] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:44:04] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11703 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:44:14] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20204 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32049ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32051ms
Finished structural reductions in LTL mode , in 1 iterations and 32255 ms. Remains : 107/107 places, 285/285 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2028 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33035 steps (376 resets) in 78 ms. (418 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 90 ms.
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 285/285 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 107 transition count 286
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 107 transition count 295
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 107 transition count 289
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 11 rules in 19 ms. Remains 107 /107 variables (removed 0) and now considering 289/285 (removed -4) transitions.
[2024-06-02 18:44:35] [INFO ] Redundant transitions in 1 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-02 18:44:35] [INFO ] Flow matrix only has 260 transitions (discarded 29 similar events)
// Phase 1: matrix 260 rows 107 cols
[2024-06-02 18:44:35] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:44:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-06-02 18:44:36] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 18:44:36] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-02 18:44:36] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-02 18:44:36] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:44:36] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:44:36] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:44:36] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 12/21 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 259/366 variables, 107/128 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 40/168 constraints. Problems are: Problem set: 8 solved, 280 unsolved
[2024-06-02 18:44:39] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:44:39] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:44:39] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:44:39] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 4/172 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/172 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/173 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/173 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/173 constraints. Problems are: Problem set: 8 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 173 constraints, problems are : Problem set: 8 solved, 280 unsolved in 13058 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 8 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 6/107 variables, 9/9 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 16/25 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 259/366 variables, 107/132 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 40/172 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 280/452 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/452 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/453 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/453 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/453 constraints. Problems are: Problem set: 8 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 453 constraints, problems are : Problem set: 8 solved, 280 unsolved in 17727 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 280/288 constraints, Known Traps: 16/16 constraints]
After SMT, in 30933ms problems are : Problem set: 8 solved, 280 unsolved
Search for dead transitions found 8 dead transitions in 30936ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 107/107 places, 281/285 transitions.
Graph (complete) has 553 edges and 107 vertex of which 102 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 102 /107 variables (removed 5) and now considering 281/281 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/107 places, 281/285 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30979 ms. Remains : 102/107 places, 281/285 transitions.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 285/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-02 18:45:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 18:45:06] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:45:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:45:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:45:06] [INFO ] Invariant cache hit.
[2024-06-02 18:45:06] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:45:06] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 18:45:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:45:06] [INFO ] Invariant cache hit.
[2024-06-02 18:45:06] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:45:08] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:45:08] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:45:08] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:45:08] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:45:08] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:45:08] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11567 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:45:18] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20326 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32034ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32039ms
Finished structural reductions in LTL mode , in 1 iterations and 32237 ms. Remains : 107/107 places, 285/285 transitions.
Treatment of property FireWire-PT-03-LTLCardinality-10 finished in 130684 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(p1)&&X(p2)&&p0)))'
Support contains 8 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 18:45:38] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:45:38] [INFO ] Invariant cache hit.
[2024-06-02 18:45:38] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-06-02 18:45:38] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:45:38] [INFO ] Invariant cache hit.
[2024-06-02 18:45:38] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:45:38] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 18:45:38] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 18:45:38] [INFO ] Invariant cache hit.
[2024-06-02 18:45:38] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-02 18:45:41] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:45:41] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11541 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:45:51] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19920 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31609ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31612ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32025 ms. Remains : 107/112 places, 285/297 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-11 finished in 32158 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((F(p0) U p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 101 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 101 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 100 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 99 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 99 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 98 transition count 279
Applied a total of 32 rules in 25 ms. Remains 98 /112 variables (removed 14) and now considering 279/297 (removed 18) transitions.
[2024-06-02 18:46:10] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
// Phase 1: matrix 247 rows 98 cols
[2024-06-02 18:46:10] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:46:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:46:10] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:46:10] [INFO ] Invariant cache hit.
[2024-06-02 18:46:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:46:10] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 18:46:10] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:46:10] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:46:10] [INFO ] Invariant cache hit.
[2024-06-02 18:46:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:46:11] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:46:11] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:46:11] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:46:11] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:46:12] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:46:12] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:46:12] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-02 18:46:12] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-02 18:46:12] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:46:16] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:46:18] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13360 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9753 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 23257ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 23261ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/112 places, 279/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23484 ms. Remains : 98/112 places, 279/297 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-15
Product exploration explored 100000 steps with 1 reset in 45 ms.
Product exploration explored 100000 steps with 0 reset in 48 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2389 resets) in 207 ms. (192 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (521 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (602 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (560 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
[2024-06-02 18:46:34] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:46:34] [INFO ] Invariant cache hit.
[2024-06-02 18:46:34] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 53/341 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/344 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 53/341 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:46:35] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/344 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 147 constraints, problems are : Problem set: 0 solved, 3 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 458ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 279/279 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 98 transition count 273
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 98 transition count 275
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 97 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 271
Applied a total of 12 rules in 16 ms. Remains 97 /98 variables (removed 1) and now considering 271/279 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 97/98 places, 271/279 transitions.
RANDOM walk for 40000 steps (2445 resets) in 354 ms. (112 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (572 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (579 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (639 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 4659 steps, run visited all 3 properties in 41 ms. (steps per millisecond=113 )
Probabilistic random walk after 4659 steps, saw 2299 distinct states, run finished after 41 ms. (steps per millisecond=113 ) properties seen :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 18:46:36] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:46:36] [INFO ] Invariant cache hit.
[2024-06-02 18:46:36] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:46:36] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:46:36] [INFO ] Invariant cache hit.
[2024-06-02 18:46:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:46:36] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 18:46:36] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:46:36] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:46:36] [INFO ] Invariant cache hit.
[2024-06-02 18:46:36] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:46:41] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:46:44] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13068 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9748 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 22983ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22986ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23168 ms. Remains : 98/98 places, 279/279 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 151 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2479 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (557 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (604 resets) in 44 ms. (888 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (558 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
[2024-06-02 18:46:59] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:46:59] [INFO ] Invariant cache hit.
[2024-06-02 18:46:59] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 53/341 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/344 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 53/341 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:47:00] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/344 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 147 constraints, problems are : Problem set: 0 solved, 3 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 279/279 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 98 transition count 273
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 98 transition count 275
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 97 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 271
Applied a total of 12 rules in 13 ms. Remains 97 /98 variables (removed 1) and now considering 271/279 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 97/98 places, 271/279 transitions.
RANDOM walk for 40000 steps (2411 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (569 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (566 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (584 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 4659 steps, run visited all 3 properties in 22 ms. (steps per millisecond=211 )
Probabilistic random walk after 4659 steps, saw 2299 distinct states, run finished after 22 ms. (steps per millisecond=211 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 58 ms.
Product exploration explored 100000 steps with 1 reset in 54 ms.
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 18:47:01] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:47:01] [INFO ] Invariant cache hit.
[2024-06-02 18:47:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 18:47:01] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:47:01] [INFO ] Invariant cache hit.
[2024-06-02 18:47:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:47:01] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 18:47:01] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:47:01] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 18:47:01] [INFO ] Invariant cache hit.
[2024-06-02 18:47:01] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-02 18:47:02] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:47:06] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:47:09] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13177 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9637 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 22960ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22965ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23157 ms. Remains : 98/98 places, 279/279 transitions.
Treatment of property FireWire-PT-03-LTLCardinality-15 finished in 73681 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)))'
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(X(F(p0)))))'
Found a Shortening insensitive property : FireWire-PT-03-LTLCardinality-10
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 296
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 296
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 108 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 108 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 106 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 104 transition count 282
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 102 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 102 transition count 283
Applied a total of 24 rules in 18 ms. Remains 102 /112 variables (removed 10) and now considering 283/297 (removed 14) transitions.
[2024-06-02 18:47:24] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
// Phase 1: matrix 254 rows 102 cols
[2024-06-02 18:47:24] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:47:24] [INFO ] Implicit Places using invariants in 53 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 101/112 places, 283/297 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 101 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 282
Applied a total of 2 rules in 3 ms. Remains 100 /101 variables (removed 1) and now considering 282/283 (removed 1) transitions.
[2024-06-02 18:47:24] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
// Phase 1: matrix 253 rows 100 cols
[2024-06-02 18:47:24] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:47:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:47:24] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2024-06-02 18:47:24] [INFO ] Invariant cache hit.
[2024-06-02 18:47:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:47:24] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 100/112 places, 282/297 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 289 ms. Remains : 100/112 places, 282/297 transitions.
Running random walk in product with property : FireWire-PT-03-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 87 ms.
Product exploration explored 100000 steps with 25000 reset in 93 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 24181 steps (1436 resets) in 46 ms. (514 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-02 18:47:25] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2024-06-02 18:47:25] [INFO ] Invariant cache hit.
[2024-06-02 18:47:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 18:47:25] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2024-06-02 18:47:25] [INFO ] Invariant cache hit.
[2024-06-02 18:47:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:47:25] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-06-02 18:47:25] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2024-06-02 18:47:25] [INFO ] Invariant cache hit.
[2024-06-02 18:47:25] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 18:47:27] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:47:27] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:47:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:47:27] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:47:27] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:47:27] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:47:27] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:47:27] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 252/352 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 1/353 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 155 constraints, problems are : Problem set: 0 solved, 281 unsolved in 10842 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 252/352 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 281/435 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 436 constraints, problems are : Problem set: 0 solved, 281 unsolved in 15508 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 8/8 constraints]
After SMT, in 26487ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 26491ms
Finished structural reductions in LTL mode , in 1 iterations and 26673 ms. Remains : 100/100 places, 282/282 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 34918 steps (2019 resets) in 71 ms. (484 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 92 ms.
Product exploration explored 100000 steps with 25000 reset in 93 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 282/282 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 280
Applied a total of 2 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 280/282 (removed 2) transitions.
[2024-06-02 18:47:53] [INFO ] Redundant transitions in 2 ms returned []
Running 279 sub problems to find dead transitions.
[2024-06-02 18:47:53] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
// Phase 1: matrix 251 rows 100 cols
[2024-06-02 18:47:53] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:47:53] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 18:47:54] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:47:54] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:47:54] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:47:54] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-02 18:47:55] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:47:55] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:47:55] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:47:55] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:47:55] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:47:55] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 250/350 variables, 100/118 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 1/351 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 157 constraints, problems are : Problem set: 0 solved, 279 unsolved in 10827 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 18:48:05] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 250/350 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 279/436 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (OVERLAPS) 1/351 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 11 (OVERLAPS) 0/351 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 437 constraints, problems are : Problem set: 0 solved, 279 unsolved in 17882 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 11/11 constraints]
After SMT, in 28866ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 28870ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 280/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28886 ms. Remains : 100/100 places, 280/282 transitions.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-02 18:48:22] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
// Phase 1: matrix 253 rows 100 cols
[2024-06-02 18:48:22] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:48:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:48:22] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2024-06-02 18:48:22] [INFO ] Invariant cache hit.
[2024-06-02 18:48:22] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:48:22] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-06-02 18:48:22] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2024-06-02 18:48:22] [INFO ] Invariant cache hit.
[2024-06-02 18:48:22] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 18:48:23] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2024-06-02 18:48:23] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:48:24] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:48:24] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2024-06-02 18:48:24] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:48:24] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:48:24] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 18:48:24] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 252/352 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 1/353 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 155 constraints, problems are : Problem set: 0 solved, 281 unsolved in 10913 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 252/352 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 281/435 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 436 constraints, problems are : Problem set: 0 solved, 281 unsolved in 15253 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 8/8 constraints]
After SMT, in 26311ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 26313ms
Finished structural reductions in LTL mode , in 1 iterations and 26492 ms. Remains : 100/100 places, 282/282 transitions.
Treatment of property FireWire-PT-03-LTLCardinality-10 finished in 84486 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((F(p0) U p1))))'
[2024-06-02 18:48:48] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:48:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-02 18:48:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 297 transitions and 1076 arcs took 5 ms.
Total runtime 561683 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-03-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-03-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-03-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717354129554

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FireWire-PT-03-LTLCardinality-00
ltl formula formula --ltl=/tmp/2311/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 112 places, 297 transitions and 1076 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2311/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2311/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2311/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2311/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 114 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 113, there are 300 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~78!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2837
pnml2lts-mc( 0/ 4): unique states count: 7585
pnml2lts-mc( 0/ 4): unique transitions count: 29768
pnml2lts-mc( 0/ 4): - self-loop count: 3082
pnml2lts-mc( 0/ 4): - claim dead count: 9766
pnml2lts-mc( 0/ 4): - claim found count: 6607
pnml2lts-mc( 0/ 4): - claim success count: 7662
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1198
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7720 states 30387 transitions, fanout: 3.936
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.070 sec minimum, 0.075 sec on average)
pnml2lts-mc( 0/ 4): States per second: 96500, Transitions per second: 379838
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 9.2 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 300 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-03-LTLCardinality-10
ltl formula formula --ltl=/tmp/2311/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 112 places, 297 transitions and 1076 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2311/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2311/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2311/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2311/ltl_1_
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 114 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 113, there are 304 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): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11
pnml2lts-mc( 0/ 4): unique states count: 11
pnml2lts-mc( 0/ 4): unique transitions count: 13
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 41 transitions, fanout: 1.864
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, 55.3 B/state, compr.: 12.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 300 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-03-LTLCardinality-15
ltl formula formula --ltl=/tmp/2311/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 112 places, 297 transitions and 1076 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2311/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2311/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2311/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2311/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 113 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 113, there are 386 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~53!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 58
pnml2lts-mc( 0/ 4): unique states count: 205
pnml2lts-mc( 0/ 4): unique transitions count: 703
pnml2lts-mc( 0/ 4): - self-loop count: 91
pnml2lts-mc( 0/ 4): - claim dead count: 55
pnml2lts-mc( 0/ 4): - claim found count: 101
pnml2lts-mc( 0/ 4): - claim success count: 212
pnml2lts-mc( 0/ 4): - cum. max stack depth: 148
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 212 states 722 transitions, fanout: 3.406
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.005 sec on average)
pnml2lts-mc( 0/ 4): States per second: 21200, Transitions per second: 72200
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, 16.2 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 300 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-03"
export BK_EXAMINATION="LTLCardinality"
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-03, examination is LTLCardinality"
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-171734901100187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-03.tgz
mv FireWire-PT-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;