About the Execution of ITS-Tools for FireWire-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 736.907 | 276929.00 | 356806.00 | 860.80 | FTTFFFFTFFTFFFTF | normal |
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.r550-tall-171734899000275.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 itstools
Input is FireWire-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000275
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 25K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 153K 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-14-LTLCardinality-00
FORMULA_NAME FireWire-PT-14-LTLCardinality-01
FORMULA_NAME FireWire-PT-14-LTLCardinality-02
FORMULA_NAME FireWire-PT-14-LTLCardinality-03
FORMULA_NAME FireWire-PT-14-LTLCardinality-04
FORMULA_NAME FireWire-PT-14-LTLCardinality-05
FORMULA_NAME FireWire-PT-14-LTLCardinality-06
FORMULA_NAME FireWire-PT-14-LTLCardinality-07
FORMULA_NAME FireWire-PT-14-LTLCardinality-08
FORMULA_NAME FireWire-PT-14-LTLCardinality-09
FORMULA_NAME FireWire-PT-14-LTLCardinality-10
FORMULA_NAME FireWire-PT-14-LTLCardinality-11
FORMULA_NAME FireWire-PT-14-LTLCardinality-12
FORMULA_NAME FireWire-PT-14-LTLCardinality-13
FORMULA_NAME FireWire-PT-14-LTLCardinality-14
FORMULA_NAME FireWire-PT-14-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717366728125
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 22:18:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:18:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:18:49] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 22:18:49] [INFO ] Transformed 205 places.
[2024-06-02 22:18:49] [INFO ] Transformed 610 transitions.
[2024-06-02 22:18:49] [INFO ] Found NUPN structural information;
[2024-06-02 22:18:49] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
FORMULA FireWire-PT-14-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 539/539 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 199 transition count 527
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 199 transition count 527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 199 transition count 524
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 197 transition count 518
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 197 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 196 transition count 516
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 196 transition count 516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 195 transition count 513
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 195 transition count 513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 194 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 194 transition count 511
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 194 transition count 505
Applied a total of 31 rules in 84 ms. Remains 194 /205 variables (removed 11) and now considering 505/539 (removed 34) transitions.
[2024-06-02 22:18:49] [INFO ] Flow matrix only has 473 transitions (discarded 32 similar events)
// Phase 1: matrix 473 rows 194 cols
[2024-06-02 22:18:49] [INFO ] Computed 10 invariants in 20 ms
[2024-06-02 22:18:50] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-02 22:18:50] [INFO ] Flow matrix only has 473 transitions (discarded 32 similar events)
[2024-06-02 22:18:50] [INFO ] Invariant cache hit.
[2024-06-02 22:18:50] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-02 22:18:50] [INFO ] Implicit Places using invariants and state equation in 428 ms returned [21, 141]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 736 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 192/205 places, 505/539 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 841 ms. Remains : 192/205 places, 505/539 transitions.
Support contains 28 out of 192 places after structural reductions.
[2024-06-02 22:18:50] [INFO ] Flatten gal took : 62 ms
[2024-06-02 22:18:50] [INFO ] Flatten gal took : 37 ms
[2024-06-02 22:18:50] [INFO ] Input system was already deterministic with 505 transitions.
Reduction of identical properties reduced properties to check from 20 to 18
RANDOM walk for 40000 steps (1183 resets) in 2466 ms. (16 steps per ms) remains 8/18 properties
BEST_FIRST walk for 40002 steps (242 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (265 resets) in 85 ms. (465 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (236 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (255 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (236 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (244 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (237 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
[2024-06-02 22:18:51] [INFO ] Flow matrix only has 473 transitions (discarded 32 similar events)
// Phase 1: matrix 473 rows 192 cols
[2024-06-02 22:18:51] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 22:18:51] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 147/160 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 21/181 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 464/645 variables, 181/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 67/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 19/664 variables, 11/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/665 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/665 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/665 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 270 constraints, problems are : Problem set: 0 solved, 7 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 192/192 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 147/160 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:18:52] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 21/181 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:18:52] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 464/645 variables, 181/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 67/258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 19/664 variables, 11/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/664 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:18:53] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:18:53] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/664 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/664 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/665 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:18:53] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/665 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/665 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 282 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1693 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 192/192 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 2372ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1449 ms.
Support contains 13 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 505/505 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 192 transition count 502
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 192 transition count 500
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 7 place count 190 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 189 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 189 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 188 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 188 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 187 transition count 492
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 187 transition count 492
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 186 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 186 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 185 transition count 487
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 185 transition count 487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 182 transition count 484
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 179 transition count 490
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 35 place count 179 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 179 transition count 481
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 179 transition count 487
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 50 place count 176 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 176 transition count 475
Applied a total of 56 rules in 118 ms. Remains 176 /192 variables (removed 16) and now considering 475/505 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 176/192 places, 475/505 transitions.
RANDOM walk for 40000 steps (1189 resets) in 413 ms. (96 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (270 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (247 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (265 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (296 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (281 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (246 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (265 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 511022 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :1 out of 7
Probabilistic random walk after 511022 steps, saw 151435 distinct states, run finished after 3005 ms. (steps per millisecond=170 ) properties seen :1
[2024-06-02 22:18:59] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
// Phase 1: matrix 438 rows 176 cols
[2024-06-02 22:18:59] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:18:59] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 136/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 21/169 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 434/603 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 66/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 11/614 variables, 7/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/614 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 252 constraints, problems are : Problem set: 0 solved, 6 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 136/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 21/169 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:18:59] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:18:59] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:18:59] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:19:00] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 434/603 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 66/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:19:00] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 11/614 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/614 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/614 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/614 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 263 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 1402ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 869 ms.
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 475/475 transitions.
Applied a total of 0 rules in 13 ms. Remains 176 /176 variables (removed 0) and now considering 475/475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 176/176 places, 475/475 transitions.
RANDOM walk for 40000 steps (1214 resets) in 852 ms. (46 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (259 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (237 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (252 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (285 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (256 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (276 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 456432 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 6
Probabilistic random walk after 456432 steps, saw 135646 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2024-06-02 22:19:05] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
[2024-06-02 22:19:05] [INFO ] Invariant cache hit.
[2024-06-02 22:19:05] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 136/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 21/169 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 434/603 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 66/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 11/614 variables, 7/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/614 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 252 constraints, problems are : Problem set: 0 solved, 6 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 136/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 21/169 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:19:05] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:19:05] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:19:05] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:19:05] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 434/603 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 66/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 11/614 variables, 7/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:19:06] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/614 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/614 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/614 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 263 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 1392ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 2 properties in 972 ms.
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 475/475 transitions.
Applied a total of 0 rules in 23 ms. Remains 176 /176 variables (removed 0) and now considering 475/475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 176/176 places, 475/475 transitions.
RANDOM walk for 40000 steps (1236 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (279 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (259 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (262 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (273 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 596296 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 4
Probabilistic random walk after 596296 steps, saw 176911 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2024-06-02 22:19:10] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
[2024-06-02 22:19:10] [INFO ] Invariant cache hit.
[2024-06-02 22:19:10] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/169 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 434/603 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 66/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 11/614 variables, 7/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/614 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 252 constraints, problems are : Problem set: 0 solved, 4 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/169 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:19:11] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2024-06-02 22:19:11] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:19:11] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 434/603 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 66/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/614 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/614 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/614 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 259 constraints, problems are : Problem set: 0 solved, 4 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 930ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 308 ms.
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 475/475 transitions.
Applied a total of 0 rules in 9 ms. Remains 176 /176 variables (removed 0) and now considering 475/475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 176/176 places, 475/475 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 475/475 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 475/475 (removed 0) transitions.
[2024-06-02 22:19:11] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
[2024-06-02 22:19:11] [INFO ] Invariant cache hit.
[2024-06-02 22:19:11] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 22:19:11] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
[2024-06-02 22:19:11] [INFO ] Invariant cache hit.
[2024-06-02 22:19:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 22:19:12] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-06-02 22:19:12] [INFO ] Redundant transitions in 29 ms returned []
Running 474 sub problems to find dead transitions.
[2024-06-02 22:19:12] [INFO ] Flow matrix only has 438 transitions (discarded 37 similar events)
[2024-06-02 22:19:12] [INFO ] Invariant cache hit.
[2024-06-02 22:19:12] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:19:18] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:19:18] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:19:18] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:19:19] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:19:19] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 438/614 variables, 176/199 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 68/267 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-02 22:19:23] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:19:25] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 8 (OVERLAPS) 0/614 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 474 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 269 constraints, problems are : Problem set: 0 solved, 474 unsolved in 26543 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 438/614 variables, 176/201 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 68/269 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 474/743 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-02 22:19:51] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/614 variables, and 744 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 18/18 constraints]
After SMT, in 57257ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 57264ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57961 ms. Remains : 176/176 places, 475/475 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 176 vertex of which 29 / 176 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 150 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 150 transition count 321
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 149 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 149 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 148 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 147 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 147 transition count 267
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 147 transition count 252
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 138 transition count 249
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 138 transition count 249
Applied a total of 46 rules in 51 ms. Remains 138 /176 variables (removed 38) and now considering 249/475 (removed 226) transitions.
Running SMT prover for 4 properties.
[2024-06-02 22:20:09] [INFO ] Flow matrix only has 247 transitions (discarded 2 similar events)
// Phase 1: matrix 247 rows 138 cols
[2024-06-02 22:20:09] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:20:09] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:20:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:20:10] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:20:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:20:10] [INFO ] After 38ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 22:20:10] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:20:10] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:20:10] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2024-06-02 22:20:10] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-06-02 22:20:10] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-06-02 22:20:10] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
TRAPS : Iteration 2
[2024-06-02 22:20:10] [INFO ] After 601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:20:10] [INFO ] After 771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 885 ms.
Computed a total of 51 stabilizing places and 117 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)&&F(p1))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 192 transition count 503
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 4 place count 190 transition count 503
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 188 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 188 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 186 transition count 493
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 186 transition count 493
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 184 transition count 488
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 184 transition count 488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 180 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 180 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 178 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 177 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 177 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 176 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 176 transition count 469
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 38 place count 173 transition count 466
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 170 transition count 472
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 50 place count 170 transition count 466
Applied a total of 50 rules in 127 ms. Remains 170 /192 variables (removed 22) and now considering 466/505 (removed 39) transitions.
[2024-06-02 22:20:11] [INFO ] Flow matrix only has 427 transitions (discarded 39 similar events)
// Phase 1: matrix 427 rows 170 cols
[2024-06-02 22:20:11] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:20:11] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-02 22:20:11] [INFO ] Flow matrix only has 427 transitions (discarded 39 similar events)
[2024-06-02 22:20:11] [INFO ] Invariant cache hit.
[2024-06-02 22:20:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 22:20:11] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2024-06-02 22:20:11] [INFO ] Redundant transitions in 7 ms returned []
Running 465 sub problems to find dead transitions.
[2024-06-02 22:20:11] [INFO ] Flow matrix only has 427 transitions (discarded 39 similar events)
[2024-06-02 22:20:11] [INFO ] Invariant cache hit.
[2024-06-02 22:20:11] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-06-02 22:20:24] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:20:24] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:20:26] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:20:26] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:20:26] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-06-02 22:20:27] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (OVERLAPS) 426/596 variables, 170/188 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 65/253 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-06-02 22:20:31] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-06-02 22:20:38] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/596 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/597 variables, and 255 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 65/66 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (OVERLAPS) 426/596 variables, 170/190 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 65/255 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 465/720 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-06-02 22:20:51] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-06-02 22:20:55] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-06-02 22:20:57] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/596 variables, 3/723 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/597 variables, and 723 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 65/66 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 15/15 constraints]
After SMT, in 60621ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60626ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/192 places, 466/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61289 ms. Remains : 170/192 places, 466/505 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-00
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 1 ms.
FORMULA FireWire-PT-14-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-00 finished in 61622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p0) U p1)&&(F(G(p3))||p2)))))'
Support contains 8 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 190 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 190 transition count 499
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 188 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 188 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 186 transition count 489
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 186 transition count 489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 184 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 184 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 180 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 178 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 178 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 177 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 177 transition count 468
Applied a total of 30 rules in 23 ms. Remains 177 /192 variables (removed 15) and now considering 468/505 (removed 37) transitions.
[2024-06-02 22:21:12] [INFO ] Flow matrix only has 436 transitions (discarded 32 similar events)
// Phase 1: matrix 436 rows 177 cols
[2024-06-02 22:21:12] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:21:12] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 22:21:12] [INFO ] Flow matrix only has 436 transitions (discarded 32 similar events)
[2024-06-02 22:21:12] [INFO ] Invariant cache hit.
[2024-06-02 22:21:12] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 22:21:13] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-06-02 22:21:13] [INFO ] Flow matrix only has 436 transitions (discarded 32 similar events)
[2024-06-02 22:21:13] [INFO ] Invariant cache hit.
[2024-06-02 22:21:13] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-02 22:21:16] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:21:16] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:21:16] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:21:16] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:21:17] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:21:18] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:21:18] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:21:18] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:21:18] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:21:18] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 435/612 variables, 177/195 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 62/257 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 7 (OVERLAPS) 1/613 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 9 (OVERLAPS) 0/613 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 467 unsolved
No progress, stopping.
After SMT solving in domain Real declared 613/613 variables, and 258 constraints, problems are : Problem set: 0 solved, 467 unsolved in 28495 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 177/177 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 435/612 variables, 177/195 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 62/257 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 467/724 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-02 22:21:50] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2024-06-02 22:21:50] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/612 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 467 unsolved
SMT process timed out in 58902ms, After SMT, problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 58908ms
Starting structural reductions in LTL mode, iteration 1 : 177/192 places, 468/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59494 ms. Remains : 177/192 places, 468/505 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 36 stabilizing places and 80 stable transitions
Computed a total of 36 stabilizing places and 80 stable transitions
Detected a total of 36/177 stabilizing places and 80/468 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p2) p3))))), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p2 p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 167 ms. Reduced automaton from 6 states, 24 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLCardinality-02 finished in 60431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 191 transition count 501
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 6 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 185 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 185 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 182 transition count 486
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 179 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 179 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 176 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 176 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 174 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 174 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 172 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 172 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 170 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 170 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 168 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 167 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 165 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 165 transition count 446
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 162 transition count 443
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 159 transition count 449
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 70 place count 159 transition count 443
Applied a total of 70 rules in 52 ms. Remains 159 /192 variables (removed 33) and now considering 443/505 (removed 62) transitions.
[2024-06-02 22:22:13] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
// Phase 1: matrix 404 rows 159 cols
[2024-06-02 22:22:13] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:22:13] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 22:22:13] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2024-06-02 22:22:13] [INFO ] Invariant cache hit.
[2024-06-02 22:22:13] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 22:22:13] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 418 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/192 places, 443/505 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 477 ms. Remains : 158/192 places, 443/505 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 179 ms.
Product exploration explored 100000 steps with 4 reset in 99 ms.
Computed a total of 20 stabilizing places and 55 stable transitions
Computed a total of 20 stabilizing places and 55 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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 27 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1293 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (308 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1430232 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1430232 steps, saw 355778 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
[2024-06-02 22:22:16] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
// Phase 1: matrix 404 rows 158 cols
[2024-06-02 22:22:16] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 22:22:16] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/189 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/377 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/378 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 165/543 variables, 81/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/543 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/543 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/559 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/559 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/559 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/561 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/561 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/561 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/562 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/189 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/377 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/378 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 165/543 variables, 81/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/543 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/543 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/543 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/559 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/559 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/559 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/561 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/561 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/561 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/562 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 397ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 443/443 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 158 transition count 437
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 158 transition count 443
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 155 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 155 transition count 431
Applied a total of 24 rules in 23 ms. Remains 155 /158 variables (removed 3) and now considering 431/443 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 155/158 places, 431/443 transitions.
RANDOM walk for 40000 steps (1262 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (290 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1196179 steps, run visited all 1 properties in 2729 ms. (steps per millisecond=438 )
Probabilistic random walk after 1196179 steps, saw 349960 distinct states, run finished after 2738 ms. (steps per millisecond=436 ) properties seen :1
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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 443/443 transitions.
Applied a total of 0 rules in 12 ms. Remains 158 /158 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-06-02 22:22:20] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2024-06-02 22:22:20] [INFO ] Invariant cache hit.
[2024-06-02 22:22:20] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:22:20] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2024-06-02 22:22:20] [INFO ] Invariant cache hit.
[2024-06-02 22:22:20] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 22:22:20] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-06-02 22:22:20] [INFO ] Redundant transitions in 2 ms returned []
Running 436 sub problems to find dead transitions.
[2024-06-02 22:22:20] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2024-06-02 22:22:20] [INFO ] Invariant cache hit.
[2024-06-02 22:22:20] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-06-02 22:22:23] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:22:23] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:22:24] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 403/561 variables, 158/173 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 59/232 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:22:29] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:22:29] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:22:32] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:22:32] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (OVERLAPS) 0/561 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/562 variables, and 236 constraints, problems are : Problem set: 0 solved, 436 unsolved in 21905 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 403/561 variables, 158/177 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 59/236 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 436/672 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:22:55] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:23:02] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/562 variables, and 674 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 14/14 constraints]
After SMT, in 52301ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 52305ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52696 ms. Remains : 158/158 places, 443/443 transitions.
Computed a total of 20 stabilizing places and 55 stable transitions
Computed a total of 20 stabilizing places and 55 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 33249 steps (1079 resets) in 158 ms. (209 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 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 51 ms.
Product exploration explored 100000 steps with 1 reset in 85 ms.
Built C files in :
/tmp/ltsmin7728443043068384922
[2024-06-02 22:23:13] [INFO ] Computing symmetric may disable matrix : 443 transitions.
[2024-06-02 22:23:13] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:23:13] [INFO ] Computing symmetric may enable matrix : 443 transitions.
[2024-06-02 22:23:13] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:23:13] [INFO ] Computing Do-Not-Accords matrix : 443 transitions.
[2024-06-02 22:23:13] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:23:13] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7728443043068384922
Running compilation step : cd /tmp/ltsmin7728443043068384922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1283 ms.
Running link step : cd /tmp/ltsmin7728443043068384922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin7728443043068384922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5690106271470207306.hoa' '--buchi-type=spotba'
LTSmin run took 1928 ms.
FORMULA FireWire-PT-14-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-14-LTLCardinality-04 finished in 64062 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((p0&&G(p1)))||(F(p0)&&p2))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 497
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 482
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 175 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 175 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 173 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 173 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 172 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 172 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 171 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 171 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 170 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 170 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 169 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 169 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 168 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 168 transition count 446
Applied a total of 48 rules in 15 ms. Remains 168 /192 variables (removed 24) and now considering 446/505 (removed 59) transitions.
[2024-06-02 22:23:17] [INFO ] Flow matrix only has 414 transitions (discarded 32 similar events)
// Phase 1: matrix 414 rows 168 cols
[2024-06-02 22:23:17] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:23:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:23:17] [INFO ] Flow matrix only has 414 transitions (discarded 32 similar events)
[2024-06-02 22:23:17] [INFO ] Invariant cache hit.
[2024-06-02 22:23:17] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 22:23:17] [INFO ] Implicit Places using invariants and state equation in 381 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 461 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/192 places, 446/505 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 478 ms. Remains : 167/192 places, 446/505 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-05 finished in 674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 497
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 482
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 467
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 166 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 166 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 164 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 164 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 162 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 162 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 161 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 161 transition count 431
Applied a total of 62 rules in 20 ms. Remains 161 /192 variables (removed 31) and now considering 431/505 (removed 74) transitions.
[2024-06-02 22:23:17] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 22:23:17] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:23:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 22:23:17] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:23:17] [INFO ] Invariant cache hit.
[2024-06-02 22:23:17] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:23:18] [INFO ] Implicit Places using invariants and state equation in 237 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 316 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/192 places, 431/505 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 338 ms. Remains : 160/192 places, 431/505 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-08 finished in 477 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))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 497
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 482
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 467
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 166 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 166 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 164 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 164 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 162 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 162 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 161 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 161 transition count 431
Applied a total of 62 rules in 21 ms. Remains 161 /192 variables (removed 31) and now considering 431/505 (removed 74) transitions.
[2024-06-02 22:23:18] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:23:18] [INFO ] Invariant cache hit.
[2024-06-02 22:23:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:23:18] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:23:18] [INFO ] Invariant cache hit.
[2024-06-02 22:23:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:23:18] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/192 places, 431/505 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 366 ms. Remains : 160/192 places, 431/505 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 9 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLCardinality-10 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(p1))&&p0))&&X(F(p2))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 190 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 190 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 188 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 188 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 186 transition count 490
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 184 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 184 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 180 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 178 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 178 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 176 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 176 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 174 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 174 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 172 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 172 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 170 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 170 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 169 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 169 transition count 450
Applied a total of 46 rules in 17 ms. Remains 169 /192 variables (removed 23) and now considering 450/505 (removed 55) transitions.
[2024-06-02 22:23:18] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
// Phase 1: matrix 418 rows 169 cols
[2024-06-02 22:23:18] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:23:19] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:23:19] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
[2024-06-02 22:23:19] [INFO ] Invariant cache hit.
[2024-06-02 22:23:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:23:19] [INFO ] Implicit Places using invariants and state equation in 269 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 348 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/192 places, 450/505 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 368 ms. Remains : 168/192 places, 450/505 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-14-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-12 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 191 transition count 501
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 6 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 185 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 185 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 182 transition count 486
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 179 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 179 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 177 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 177 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 175 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 175 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 173 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 173 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 171 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 171 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 169 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 169 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 168 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 167 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 448
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 56 place count 163 transition count 445
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 160 transition count 451
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 68 place count 160 transition count 445
Applied a total of 68 rules in 34 ms. Remains 160 /192 variables (removed 32) and now considering 445/505 (removed 60) transitions.
[2024-06-02 22:23:19] [INFO ] Flow matrix only has 406 transitions (discarded 39 similar events)
// Phase 1: matrix 406 rows 160 cols
[2024-06-02 22:23:19] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:23:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:23:19] [INFO ] Flow matrix only has 406 transitions (discarded 39 similar events)
[2024-06-02 22:23:19] [INFO ] Invariant cache hit.
[2024-06-02 22:23:19] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 22:23:19] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 339 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/192 places, 445/505 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 381 ms. Remains : 159/192 places, 445/505 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLCardinality-13 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)||G(!p1)))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 497
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 482
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 467
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 167 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 167 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 166 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 166 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 165 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 165 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 164 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 164 transition count 437
Applied a total of 56 rules in 20 ms. Remains 164 /192 variables (removed 28) and now considering 437/505 (removed 68) transitions.
[2024-06-02 22:23:20] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 164 cols
[2024-06-02 22:23:20] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:23:20] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:23:20] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 22:23:20] [INFO ] Invariant cache hit.
[2024-06-02 22:23:20] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:23:20] [INFO ] Implicit Places using invariants and state equation in 385 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 462 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/192 places, 437/505 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 484 ms. Remains : 163/192 places, 437/505 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p1), false, (AND (NOT p0) (NOT p1)), p1, (AND p1 (NOT p0)), (NOT p0), false, false]
Running random walk in product with property : FireWire-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 3 reset in 132 ms.
Computed a total of 22 stabilizing places and 49 stable transitions
Computed a total of 22 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (1170 resets) in 495 ms. (80 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (221 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (251 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (247 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
[2024-06-02 22:23:21] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 163 cols
[2024-06-02 22:23:21] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:23:21] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/148 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 392/540 variables, 148/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 54/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 27/567 variables, 15/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/568 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 228 constraints, problems are : Problem set: 0 solved, 3 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/148 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:23:22] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:23:22] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 392/540 variables, 148/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 54/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 27/567 variables, 15/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/568 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/568 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 233 constraints, problems are : Problem set: 0 solved, 3 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 745ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 437/437 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 163 transition count 434
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 163 transition count 431
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 160 transition count 431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 157 transition count 428
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 154 transition count 434
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 154 transition count 425
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 154 transition count 431
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 42 place count 151 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 151 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 150 transition count 418
Applied a total of 49 rules in 24 ms. Remains 150 /163 variables (removed 13) and now considering 418/437 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 150/163 places, 418/437 transitions.
RANDOM walk for 40000 steps (1328 resets) in 120 ms. (330 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (250 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-06-02 22:23:22] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
// Phase 1: matrix 381 rows 150 cols
[2024-06-02 22:23:22] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:23:22] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/325 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/440 variables, 21/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 36/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/441 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 81/522 variables, 41/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/522 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/530 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/531 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/531 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/325 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/440 variables, 21/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 36/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/441 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 81/522 variables, 41/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/530 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/531 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/531 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 418/418 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 150/150 places, 418/418 transitions.
RANDOM walk for 40000 steps (1267 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (255 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 750342 steps, run visited all 1 properties in 1677 ms. (steps per millisecond=447 )
Probabilistic random walk after 750342 steps, saw 221841 distinct states, run finished after 1677 ms. (steps per millisecond=447 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p1))))
Knowledge based reduction with 11 factoid took 249 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLCardinality-15 finished in 4978 ms.
All properties solved by simple procedures.
Total runtime 275746 ms.
BK_STOP 1717367005054
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-14"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FireWire-PT-14, 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 r550-tall-171734899000275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 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 '
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 ;