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.r571-tall-171734910400197.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 gold2023
Input is FireWire-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910400197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K 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.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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-19-LTLCardinality-00
FORMULA_NAME FireWire-PT-19-LTLCardinality-01
FORMULA_NAME FireWire-PT-19-LTLCardinality-02
FORMULA_NAME FireWire-PT-19-LTLCardinality-03
FORMULA_NAME FireWire-PT-19-LTLCardinality-04
FORMULA_NAME FireWire-PT-19-LTLCardinality-05
FORMULA_NAME FireWire-PT-19-LTLCardinality-06
FORMULA_NAME FireWire-PT-19-LTLCardinality-07
FORMULA_NAME FireWire-PT-19-LTLCardinality-08
FORMULA_NAME FireWire-PT-19-LTLCardinality-09
FORMULA_NAME FireWire-PT-19-LTLCardinality-10
FORMULA_NAME FireWire-PT-19-LTLCardinality-11
FORMULA_NAME FireWire-PT-19-LTLCardinality-12
FORMULA_NAME FireWire-PT-19-LTLCardinality-13
FORMULA_NAME FireWire-PT-19-LTLCardinality-14
FORMULA_NAME FireWire-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717371621709

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 23:40:23] [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 23:40:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:40:23] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 23:40:23] [INFO ] Transformed 602 places.
[2024-06-02 23:40:23] [INFO ] Transformed 944 transitions.
[2024-06-02 23:40:23] [INFO ] Found NUPN structural information;
[2024-06-02 23:40:23] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-19-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 593 transition count 944
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 130 place count 472 transition count 823
Iterating global reduction 1 with 121 rules applied. Total rules applied 251 place count 472 transition count 823
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 285 place count 438 transition count 749
Iterating global reduction 1 with 34 rules applied. Total rules applied 319 place count 438 transition count 749
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 323 place count 438 transition count 745
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 327 place count 434 transition count 741
Iterating global reduction 2 with 4 rules applied. Total rules applied 331 place count 434 transition count 741
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 334 place count 431 transition count 738
Iterating global reduction 2 with 3 rules applied. Total rules applied 337 place count 431 transition count 738
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 339 place count 429 transition count 736
Iterating global reduction 2 with 2 rules applied. Total rules applied 341 place count 429 transition count 736
Applied a total of 341 rules in 109 ms. Remains 429 /602 variables (removed 173) and now considering 736/944 (removed 208) transitions.
// Phase 1: matrix 736 rows 429 cols
[2024-06-02 23:40:23] [INFO ] Computed 10 invariants in 21 ms
[2024-06-02 23:40:24] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-02 23:40:24] [INFO ] Invariant cache hit.
[2024-06-02 23:40:24] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
[2024-06-02 23:40:24] [INFO ] Invariant cache hit.
[2024-06-02 23:40:24] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 429/602 places, 736/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1453 ms. Remains : 429/602 places, 736/944 transitions.
Support contains 20 out of 429 places after structural reductions.
[2024-06-02 23:40:25] [INFO ] Flatten gal took : 80 ms
[2024-06-02 23:40:25] [INFO ] Flatten gal took : 36 ms
[2024-06-02 23:40:25] [INFO ] Input system was already deterministic with 736 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-06-02 23:40:26] [INFO ] Invariant cache hit.
[2024-06-02 23:40:27] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 23:40:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:40:27] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 23:40:28] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 5 ms to minimize.
[2024-06-02 23:40:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-06-02 23:40:28] [INFO ] After 1037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 251 ms.
[2024-06-02 23:40:28] [INFO ] After 1503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 232 ms.
Support contains 16 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 317 edges and 429 vertex of which 13 / 429 are part of one of the 2 SCC in 4 ms
Free SCC test removed 11 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 418 transition count 649
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 147 place count 348 transition count 643
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 151 place count 345 transition count 642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 344 transition count 642
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 152 place count 344 transition count 601
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 234 place count 303 transition count 601
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 235 place count 302 transition count 571
Iterating global reduction 4 with 1 rules applied. Total rules applied 236 place count 302 transition count 571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 237 place count 302 transition count 570
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 331 place count 255 transition count 523
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 415 place count 213 transition count 631
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 417 place count 213 transition count 629
Free-agglomeration rule applied 31 times.
Iterating global reduction 5 with 31 rules applied. Total rules applied 448 place count 213 transition count 598
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 488 place count 182 transition count 589
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 510 place count 182 transition count 567
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 513 place count 182 transition count 567
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 514 place count 182 transition count 567
Applied a total of 514 rules in 149 ms. Remains 182 /429 variables (removed 247) and now considering 567/736 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 182/429 places, 567/736 transitions.
Incomplete random walk after 10000 steps, including 364 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-06-02 23:40:29] [INFO ] Flow matrix only has 548 transitions (discarded 19 similar events)
// Phase 1: matrix 548 rows 182 cols
[2024-06-02 23:40:29] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:40:29] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 23:40:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:40:29] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 23:40:29] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 23:40:30] [INFO ] After 176ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 23:40:30] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-06-02 23:40:30] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 2 ms.
Support contains 12 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 567/567 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 182 transition count 566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 181 transition count 566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 181 transition count 565
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 180 transition count 565
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 179 transition count 564
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 15 place count 179 transition count 555
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 178 transition count 557
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 3 with 96 rules applied. Total rules applied 113 place count 178 transition count 461
Applied a total of 113 rules in 41 ms. Remains 178 /182 variables (removed 4) and now considering 461/567 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 178/182 places, 461/567 transitions.
Incomplete random walk after 10000 steps, including 408 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 23:40:30] [INFO ] Flow matrix only has 414 transitions (discarded 47 similar events)
// Phase 1: matrix 414 rows 178 cols
[2024-06-02 23:40:30] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:40:30] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:40:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:40:30] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 23:40:30] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 23:40:31] [INFO ] After 113ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 23:40:31] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 4 ms to minimize.
[2024-06-02 23:40:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-06-02 23:40:31] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:40:31] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 0 ms to minimize.
[2024-06-02 23:40:31] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2024-06-02 23:40:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2024-06-02 23:40:31] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-06-02 23:40:31] [INFO ] After 896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 461/461 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 176 transition count 459
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 175 transition count 464
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 175 transition count 458
Applied a total of 12 rules in 25 ms. Remains 175 /178 variables (removed 3) and now considering 458/461 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 175/178 places, 458/461 transitions.
Incomplete random walk after 10000 steps, including 402 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1154996 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :{0=1, 2=1, 3=1, 4=1}
Probabilistic random walk after 1154996 steps, saw 307723 distinct states, run finished after 3002 ms. (steps per millisecond=384 ) properties seen :4
Running SMT prover for 1 properties.
[2024-06-02 23:40:34] [INFO ] Flow matrix only has 411 transitions (discarded 47 similar events)
// Phase 1: matrix 411 rows 175 cols
[2024-06-02 23:40:34] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:40:34] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:40:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:40:35] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:40:35] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-02 23:40:35] [INFO ] After 30ms SMT Verify possible using 95 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:40:35] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-06-02 23:40:35] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 458/458 transitions.
Graph (trivial) has 25 edges and 175 vertex of which 4 / 175 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 172 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 171 transition count 453
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 171 transition count 450
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 168 transition count 450
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 166 transition count 448
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 164 transition count 451
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 164 transition count 445
Applied a total of 23 rules in 26 ms. Remains 164 /175 variables (removed 11) and now considering 445/458 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 164/175 places, 445/458 transitions.
Incomplete random walk after 10000 steps, including 424 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4736 steps, run visited all 1 properties in 19 ms. (steps per millisecond=249 )
Probabilistic random walk after 4736 steps, saw 1781 distinct states, run finished after 19 ms. (steps per millisecond=249 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 65 stabilizing places and 71 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 334 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 413 transition count 647
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 78 rules applied. Total rules applied 151 place count 341 transition count 641
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 338 transition count 641
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 154 place count 338 transition count 597
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 242 place count 294 transition count 597
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 291 transition count 565
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 291 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 291 transition count 564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 249 place count 291 transition count 563
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 290 transition count 563
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 343 place count 244 transition count 517
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -139
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 437 place count 197 transition count 656
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 494 place count 197 transition count 599
Applied a total of 494 rules in 83 ms. Remains 197 /429 variables (removed 232) and now considering 599/736 (removed 137) transitions.
[2024-06-02 23:40:35] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
// Phase 1: matrix 570 rows 197 cols
[2024-06-02 23:40:35] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:40:35] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 23:40:35] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:40:35] [INFO ] Invariant cache hit.
[2024-06-02 23:40:35] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 23:40:36] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-02 23:40:36] [INFO ] Redundant transitions in 87 ms returned []
[2024-06-02 23:40:36] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:40:36] [INFO ] Invariant cache hit.
[2024-06-02 23:40:36] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/429 places, 599/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 925 ms. Remains : 197/429 places, 599/736 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s155 0) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 3 reset in 83 ms.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 613 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 15567 steps, run visited all 1 properties in 59 ms. (steps per millisecond=263 )
Probabilistic random walk after 15567 steps, saw 5778 distinct states, run finished after 59 ms. (steps per millisecond=263 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 599/599 transitions.
Applied a total of 0 rules in 15 ms. Remains 197 /197 variables (removed 0) and now considering 599/599 (removed 0) transitions.
[2024-06-02 23:40:37] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:40:37] [INFO ] Invariant cache hit.
[2024-06-02 23:40:37] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 23:40:37] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:40:37] [INFO ] Invariant cache hit.
[2024-06-02 23:40:37] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 23:40:37] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-06-02 23:40:37] [INFO ] Redundant transitions in 53 ms returned []
[2024-06-02 23:40:37] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:40:37] [INFO ] Invariant cache hit.
[2024-06-02 23:40:38] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 839 ms. Remains : 197/197 places, 599/599 transitions.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 605 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 15567 steps, run visited all 1 properties in 58 ms. (steps per millisecond=268 )
Probabilistic random walk after 15567 steps, saw 5778 distinct states, run finished after 58 ms. (steps per millisecond=268 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Built C files in :
/tmp/ltsmin4971591503971103022
[2024-06-02 23:40:38] [INFO ] Computing symmetric may disable matrix : 599 transitions.
[2024-06-02 23:40:38] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:40:38] [INFO ] Computing symmetric may enable matrix : 599 transitions.
[2024-06-02 23:40:38] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:40:39] [INFO ] Computing Do-Not-Accords matrix : 599 transitions.
[2024-06-02 23:40:39] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:40:39] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4971591503971103022
Running compilation step : cd /tmp/ltsmin4971591503971103022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1452 ms.
Running link step : cd /tmp/ltsmin4971591503971103022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin4971591503971103022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8017051286794400485.hoa' '--buchi-type=spotba'
LTSmin run took 12245 ms.
FORMULA FireWire-PT-19-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-19-LTLCardinality-00 finished in 17420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 330 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 413 transition count 648
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 342 transition count 642
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 339 transition count 642
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 152 place count 339 transition count 599
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 238 place count 296 transition count 599
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 242 place count 292 transition count 566
Iterating global reduction 3 with 4 rules applied. Total rules applied 246 place count 292 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 292 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 247 place count 292 transition count 563
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 251 place count 290 transition count 563
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 339 place count 246 transition count 519
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -137
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 431 place count 200 transition count 656
Drop transitions removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 4 with 63 rules applied. Total rules applied 494 place count 200 transition count 593
Applied a total of 494 rules in 55 ms. Remains 200 /429 variables (removed 229) and now considering 593/736 (removed 143) transitions.
[2024-06-02 23:40:52] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
// Phase 1: matrix 564 rows 200 cols
[2024-06-02 23:40:52] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:40:53] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 23:40:53] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:40:53] [INFO ] Invariant cache hit.
[2024-06-02 23:40:53] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 23:40:53] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-06-02 23:40:53] [INFO ] Redundant transitions in 69 ms returned []
[2024-06-02 23:40:53] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:40:53] [INFO ] Invariant cache hit.
[2024-06-02 23:40:53] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/429 places, 593/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 962 ms. Remains : 200/429 places, 593/736 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s194 0) (EQ s136 1)), p1:(EQ s76 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 323 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Computed a total of 9 stabilizing places and 29 stable transitions
Computed a total of 9 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 67 steps, including 3 resets, run visited all 4 properties in 3 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 593/593 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 593/593 (removed 0) transitions.
[2024-06-02 23:40:54] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:40:54] [INFO ] Invariant cache hit.
[2024-06-02 23:40:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 23:40:55] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:40:55] [INFO ] Invariant cache hit.
[2024-06-02 23:40:55] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 23:40:55] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-06-02 23:40:55] [INFO ] Redundant transitions in 36 ms returned []
[2024-06-02 23:40:55] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:40:55] [INFO ] Invariant cache hit.
[2024-06-02 23:40:55] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 835 ms. Remains : 200/200 places, 593/593 transitions.
Computed a total of 9 stabilizing places and 29 stable transitions
Computed a total of 9 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 166 steps, including 8 resets, run visited all 4 properties in 2 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 181 ms.
Stuttering criterion allowed to conclude after 28 steps with 1 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-04 finished in 3802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 334 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 413 transition count 647
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 78 rules applied. Total rules applied 151 place count 341 transition count 641
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 338 transition count 641
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 154 place count 338 transition count 597
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 242 place count 294 transition count 597
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 246 place count 290 transition count 564
Iterating global reduction 3 with 4 rules applied. Total rules applied 250 place count 290 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 290 transition count 563
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 251 place count 290 transition count 561
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 255 place count 288 transition count 561
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 343 place count 244 transition count 517
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -139
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 437 place count 197 transition count 656
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 494 place count 197 transition count 599
Applied a total of 494 rules in 51 ms. Remains 197 /429 variables (removed 232) and now considering 599/736 (removed 137) transitions.
[2024-06-02 23:40:56] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
// Phase 1: matrix 570 rows 197 cols
[2024-06-02 23:40:56] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 23:40:56] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 23:40:56] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:40:56] [INFO ] Invariant cache hit.
[2024-06-02 23:40:56] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 23:40:57] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-06-02 23:40:57] [INFO ] Redundant transitions in 54 ms returned []
[2024-06-02 23:40:57] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:40:57] [INFO ] Invariant cache hit.
[2024-06-02 23:40:57] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/429 places, 599/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 882 ms. Remains : 197/429 places, 599/736 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s37 0) (EQ s159 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-06 finished in 1006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 420 transition count 727
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 418 transition count 724
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 418 transition count 724
Applied a total of 22 rules in 17 ms. Remains 418 /429 variables (removed 11) and now considering 724/736 (removed 12) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-02 23:40:57] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:40:57] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 23:40:57] [INFO ] Invariant cache hit.
[2024-06-02 23:40:58] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-02 23:40:58] [INFO ] Invariant cache hit.
[2024-06-02 23:40:58] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 418/429 places, 724/736 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 829 ms. Remains : 418/429 places, 724/736 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s195 0) (NEQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-10 finished in 1020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 336 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 413 transition count 646
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 79 rules applied. Total rules applied 153 place count 340 transition count 640
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 156 place count 337 transition count 640
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 156 place count 337 transition count 596
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 244 place count 293 transition count 596
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 247 place count 290 transition count 564
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 290 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 290 transition count 563
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 251 place count 290 transition count 561
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 255 place count 288 transition count 561
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 345 place count 243 transition count 516
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -147
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 441 place count 195 transition count 663
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 444 place count 195 transition count 660
Applied a total of 444 rules in 57 ms. Remains 195 /429 variables (removed 234) and now considering 660/736 (removed 76) transitions.
[2024-06-02 23:40:58] [INFO ] Flow matrix only has 623 transitions (discarded 37 similar events)
// Phase 1: matrix 623 rows 195 cols
[2024-06-02 23:40:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:40:58] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 23:40:58] [INFO ] Flow matrix only has 623 transitions (discarded 37 similar events)
[2024-06-02 23:40:58] [INFO ] Invariant cache hit.
[2024-06-02 23:40:58] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-02 23:40:59] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-06-02 23:40:59] [INFO ] Redundant transitions in 62 ms returned []
[2024-06-02 23:40:59] [INFO ] Flow matrix only has 623 transitions (discarded 37 similar events)
[2024-06-02 23:40:59] [INFO ] Invariant cache hit.
[2024-06-02 23:40:59] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 195/429 places, 660/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 784 ms. Remains : 195/429 places, 660/736 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s13 1), p0:(OR (EQ s146 0) (EQ s176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-19-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-11 finished in 933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 335 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 413 transition count 648
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 75 rules applied. Total rules applied 147 place count 342 transition count 644
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 340 transition count 644
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 149 place count 340 transition count 599
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 239 place count 295 transition count 599
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 243 place count 291 transition count 566
Iterating global reduction 3 with 4 rules applied. Total rules applied 247 place count 291 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 248 place count 291 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 248 place count 291 transition count 563
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 252 place count 289 transition count 563
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 342 place count 244 transition count 518
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -155
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 438 place count 196 transition count 673
Drop transitions removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 4 with 63 rules applied. Total rules applied 501 place count 196 transition count 610
Applied a total of 501 rules in 62 ms. Remains 196 /429 variables (removed 233) and now considering 610/736 (removed 126) transitions.
[2024-06-02 23:40:59] [INFO ] Flow matrix only has 581 transitions (discarded 29 similar events)
// Phase 1: matrix 581 rows 196 cols
[2024-06-02 23:40:59] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:40:59] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:40:59] [INFO ] Flow matrix only has 581 transitions (discarded 29 similar events)
[2024-06-02 23:40:59] [INFO ] Invariant cache hit.
[2024-06-02 23:40:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 23:41:00] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-06-02 23:41:00] [INFO ] Redundant transitions in 82 ms returned []
[2024-06-02 23:41:00] [INFO ] Flow matrix only has 581 transitions (discarded 29 similar events)
[2024-06-02 23:41:00] [INFO ] Invariant cache hit.
[2024-06-02 23:41:00] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/429 places, 610/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 809 ms. Remains : 196/429 places, 610/736 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s194 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-12 finished in 863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(((p1&&G(p2))||p0))))))'
Support contains 5 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 423 transition count 730
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 423 transition count 730
Applied a total of 12 rules in 14 ms. Remains 423 /429 variables (removed 6) and now considering 730/736 (removed 6) transitions.
// Phase 1: matrix 730 rows 423 cols
[2024-06-02 23:41:00] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:41:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 23:41:00] [INFO ] Invariant cache hit.
[2024-06-02 23:41:00] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-06-02 23:41:00] [INFO ] Invariant cache hit.
[2024-06-02 23:41:01] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 423/429 places, 730/736 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 423/429 places, 730/736 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p2:(OR (EQ s176 1) (EQ s351 0) (EQ s14 1)), p0:(OR (EQ s351 0) (EQ s14 1) (AND (EQ s234 0) (EQ s15 1))), p1:(EQ s176 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 385 ms.
Product exploration explored 100000 steps with 20000 reset in 229 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Detected a total of 63/423 stabilizing places and 69/730 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 780387 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :{}
Probabilistic random walk after 780387 steps, saw 135250 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:41:05] [INFO ] Invariant cache hit.
[2024-06-02 23:41:05] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:41:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:41:06] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:41:06] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-06-02 23:41:06] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-06-02 23:41:06] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 730/730 transitions.
Graph (trivial) has 322 edges and 423 vertex of which 13 / 423 are part of one of the 2 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 412 transition count 642
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 341 transition count 636
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 338 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 337 transition count 635
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 154 place count 337 transition count 589
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 246 place count 291 transition count 589
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 290 transition count 559
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 290 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 249 place count 290 transition count 558
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 337 place count 246 transition count 514
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 425 place count 202 transition count 638
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 434 place count 202 transition count 629
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 6 with 52 rules applied. Total rules applied 486 place count 202 transition count 577
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 516 place count 202 transition count 547
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 555 place count 172 transition count 538
Drop transitions removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 7 with 83 rules applied. Total rules applied 638 place count 172 transition count 455
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 641 place count 172 transition count 455
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 642 place count 172 transition count 455
Applied a total of 642 rules in 56 ms. Remains 172 /423 variables (removed 251) and now considering 455/730 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 172/423 places, 455/730 transitions.
Incomplete random walk after 10000 steps, including 388 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1175197 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1175197 steps, saw 322093 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :2
Running SMT prover for 1 properties.
[2024-06-02 23:41:09] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
// Phase 1: matrix 399 rows 172 cols
[2024-06-02 23:41:09] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:41:09] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:41:10] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:10] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 23:41:10] [INFO ] After 60ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:10] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-06-02 23:41:10] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 455/455 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 172/172 places, 455/455 transitions.
Incomplete random walk after 10000 steps, including 389 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1159086 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :{}
Probabilistic random walk after 1159086 steps, saw 317596 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:41:13] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:41:13] [INFO ] Invariant cache hit.
[2024-06-02 23:41:13] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:13] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:13] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 23:41:13] [INFO ] After 63ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:13] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-02 23:41:13] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 455/455 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 172/172 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 455/455 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-06-02 23:41:13] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:41:13] [INFO ] Invariant cache hit.
[2024-06-02 23:41:13] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:41:13] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:41:13] [INFO ] Invariant cache hit.
[2024-06-02 23:41:13] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 23:41:14] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-06-02 23:41:14] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:41:14] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:41:14] [INFO ] Invariant cache hit.
[2024-06-02 23:41:14] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 804 ms. Remains : 172/172 places, 455/455 transitions.
Graph (trivial) has 155 edges and 172 vertex of which 29 / 172 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions removed 115 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 135 transitions.
Graph (complete) has 610 edges and 147 vertex of which 144 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 139 transition count 315
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 139 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 139 transition count 311
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 1 with 2 rules applied. Total rules applied 18 place count 138 transition count 310
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 1 with 6 rules applied. Total rules applied 24 place count 135 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 30 place count 135 transition count 307
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 45 place count 135 transition count 292
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 135 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 134 transition count 291
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 47 place count 134 transition count 289
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 51 place count 132 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 130 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 57 place count 130 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 59 place count 129 transition count 286
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 64 place count 129 transition count 281
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 65 place count 129 transition count 280
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 6 with 2 rules applied. Total rules applied 67 place count 128 transition count 279
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 68 place count 127 transition count 244
Iterating global reduction 6 with 1 rules applied. Total rules applied 69 place count 127 transition count 244
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 75 place count 127 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 81 place count 121 transition count 238
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 87 place count 121 transition count 232
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 90 place count 121 transition count 229
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 93 place count 118 transition count 229
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 99 place count 118 transition count 229
Applied a total of 99 rules in 50 ms. Remains 118 /172 variables (removed 54) and now considering 229/455 (removed 226) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:41:14] [INFO ] Flow matrix only has 225 transitions (discarded 4 similar events)
// Phase 1: matrix 225 rows 118 cols
[2024-06-02 23:41:14] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:41:14] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-02 23:41:14] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 23:41:14] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:14] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-02 23:41:14] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 730/730 transitions.
Applied a total of 0 rules in 7 ms. Remains 423 /423 variables (removed 0) and now considering 730/730 (removed 0) transitions.
// Phase 1: matrix 730 rows 423 cols
[2024-06-02 23:41:15] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 23:41:15] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-02 23:41:15] [INFO ] Invariant cache hit.
[2024-06-02 23:41:15] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-02 23:41:15] [INFO ] Invariant cache hit.
[2024-06-02 23:41:15] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 811 ms. Remains : 423/423 places, 730/730 transitions.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Detected a total of 63/423 stabilizing places and 69/730 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 822322 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :{}
Probabilistic random walk after 822322 steps, saw 140805 distinct states, run finished after 3003 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:41:19] [INFO ] Invariant cache hit.
[2024-06-02 23:41:19] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:41:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:41:19] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:41:20] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-06-02 23:41:20] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-06-02 23:41:20] [INFO ] After 583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 730/730 transitions.
Graph (trivial) has 322 edges and 423 vertex of which 13 / 423 are part of one of the 2 SCC in 1 ms
Free SCC test removed 11 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 412 transition count 642
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 341 transition count 636
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 338 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 337 transition count 635
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 154 place count 337 transition count 589
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 246 place count 291 transition count 589
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 290 transition count 559
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 290 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 249 place count 290 transition count 558
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 337 place count 246 transition count 514
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 425 place count 202 transition count 638
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 434 place count 202 transition count 629
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 6 with 52 rules applied. Total rules applied 486 place count 202 transition count 577
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 516 place count 202 transition count 547
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 555 place count 172 transition count 538
Drop transitions removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 7 with 83 rules applied. Total rules applied 638 place count 172 transition count 455
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 641 place count 172 transition count 455
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 642 place count 172 transition count 455
Applied a total of 642 rules in 59 ms. Remains 172 /423 variables (removed 251) and now considering 455/730 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 172/423 places, 455/730 transitions.
Incomplete random walk after 10000 steps, including 413 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1236213 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1236213 steps, saw 342030 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :2
Running SMT prover for 1 properties.
[2024-06-02 23:41:23] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
// Phase 1: matrix 399 rows 172 cols
[2024-06-02 23:41:23] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:41:23] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:23] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:23] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 23:41:23] [INFO ] After 61ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:23] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-02 23:41:23] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 455/455 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 172/172 places, 455/455 transitions.
Incomplete random walk after 10000 steps, including 408 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1250737 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :{}
Probabilistic random walk after 1250737 steps, saw 346273 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:41:26] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:41:26] [INFO ] Invariant cache hit.
[2024-06-02 23:41:26] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:26] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:26] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 23:41:26] [INFO ] After 59ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:26] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-06-02 23:41:26] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 455/455 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 172/172 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 455/455 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-06-02 23:41:27] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:41:27] [INFO ] Invariant cache hit.
[2024-06-02 23:41:27] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:41:27] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:41:27] [INFO ] Invariant cache hit.
[2024-06-02 23:41:27] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 23:41:27] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-06-02 23:41:27] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 23:41:27] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:41:27] [INFO ] Invariant cache hit.
[2024-06-02 23:41:27] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 795 ms. Remains : 172/172 places, 455/455 transitions.
Graph (trivial) has 155 edges and 172 vertex of which 29 / 172 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 115 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 135 transitions.
Graph (complete) has 610 edges and 147 vertex of which 144 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 139 transition count 315
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 139 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 139 transition count 311
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 1 with 2 rules applied. Total rules applied 18 place count 138 transition count 310
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 1 with 6 rules applied. Total rules applied 24 place count 135 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 30 place count 135 transition count 307
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 45 place count 135 transition count 292
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 135 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 134 transition count 291
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 47 place count 134 transition count 289
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 51 place count 132 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 130 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 57 place count 130 transition count 285
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 5 with 2 rules applied. Total rules applied 59 place count 129 transition count 286
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 64 place count 129 transition count 281
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 65 place count 129 transition count 280
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 6 with 2 rules applied. Total rules applied 67 place count 128 transition count 279
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 68 place count 127 transition count 244
Iterating global reduction 6 with 1 rules applied. Total rules applied 69 place count 127 transition count 244
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 75 place count 127 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 81 place count 121 transition count 238
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 87 place count 121 transition count 232
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 90 place count 121 transition count 229
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 93 place count 118 transition count 229
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 99 place count 118 transition count 229
Applied a total of 99 rules in 35 ms. Remains 118 /172 variables (removed 54) and now considering 229/455 (removed 226) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:41:27] [INFO ] Flow matrix only has 225 transitions (discarded 4 similar events)
// Phase 1: matrix 225 rows 118 cols
[2024-06-02 23:41:27] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:41:27] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-02 23:41:27] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 23:41:27] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:27] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-06-02 23:41:27] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p1) p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 20000 reset in 189 ms.
Product exploration explored 100000 steps with 20000 reset in 211 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 730/730 transitions.
Graph (trivial) has 322 edges and 423 vertex of which 13 / 423 are part of one of the 2 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 412 transition count 718
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 412 transition count 715
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 73 place count 412 transition count 745
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 100 place count 412 transition count 745
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 122 place count 390 transition count 694
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 144 place count 390 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 390 transition count 693
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 3 with 55 rules applied. Total rules applied 200 place count 390 transition count 696
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 227 place count 363 transition count 669
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 254 place count 363 transition count 669
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -318
Deduced a syphon composed of 161 places in 0 ms
Iterating global reduction 3 with 58 rules applied. Total rules applied 312 place count 363 transition count 987
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 328 place count 347 transition count 952
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 344 place count 347 transition count 952
Deduced a syphon composed of 145 places in 1 ms
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 3 with 55 rules applied. Total rules applied 399 place count 347 transition count 897
Deduced a syphon composed of 145 places in 0 ms
Applied a total of 399 rules in 75 ms. Remains 347 /423 variables (removed 76) and now considering 897/730 (removed -167) transitions.
[2024-06-02 23:41:29] [INFO ] Redundant transitions in 37 ms returned []
[2024-06-02 23:41:29] [INFO ] Flow matrix only has 872 transitions (discarded 25 similar events)
// Phase 1: matrix 872 rows 347 cols
[2024-06-02 23:41:29] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:41:30] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/423 places, 897/730 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 347/423 places, 897/730 transitions.
Built C files in :
/tmp/ltsmin12907007476680320421
[2024-06-02 23:41:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12907007476680320421
Running compilation step : cd /tmp/ltsmin12907007476680320421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1045 ms.
Running link step : cd /tmp/ltsmin12907007476680320421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12907007476680320421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13491647667876228078.hoa' '--buchi-type=spotba'
LTSmin run took 201 ms.
FORMULA FireWire-PT-19-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-19-LTLCardinality-14 finished in 31020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(X(p1)))))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 421 transition count 728
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 421 transition count 728
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 419 transition count 725
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 419 transition count 725
Applied a total of 20 rules in 22 ms. Remains 419 /429 variables (removed 10) and now considering 725/736 (removed 11) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-02 23:41:31] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:41:31] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 23:41:31] [INFO ] Invariant cache hit.
[2024-06-02 23:41:32] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-06-02 23:41:32] [INFO ] Invariant cache hit.
[2024-06-02 23:41:32] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 419/429 places, 725/736 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 846 ms. Remains : 419/429 places, 725/736 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s88 1), p1:(NEQ s271 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 321 ms.
Product exploration explored 100000 steps with 33333 reset in 264 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-19-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-19-LTLCardinality-15 finished in 1654 ms.
All properties solved by simple procedures.
Total runtime 69987 ms.

BK_STOP 1717371694176

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-19"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is FireWire-PT-19, 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 r571-tall-171734910400197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;