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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 247K 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-20-LTLCardinality-00
FORMULA_NAME FireWire-PT-20-LTLCardinality-01
FORMULA_NAME FireWire-PT-20-LTLCardinality-02
FORMULA_NAME FireWire-PT-20-LTLCardinality-03
FORMULA_NAME FireWire-PT-20-LTLCardinality-04
FORMULA_NAME FireWire-PT-20-LTLCardinality-05
FORMULA_NAME FireWire-PT-20-LTLCardinality-06
FORMULA_NAME FireWire-PT-20-LTLCardinality-07
FORMULA_NAME FireWire-PT-20-LTLCardinality-08
FORMULA_NAME FireWire-PT-20-LTLCardinality-09
FORMULA_NAME FireWire-PT-20-LTLCardinality-10
FORMULA_NAME FireWire-PT-20-LTLCardinality-11
FORMULA_NAME FireWire-PT-20-LTLCardinality-12
FORMULA_NAME FireWire-PT-20-LTLCardinality-13
FORMULA_NAME FireWire-PT-20-LTLCardinality-14
FORMULA_NAME FireWire-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717371761009

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-20
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 23:42:42] [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:42:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:42:42] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-06-02 23:42:42] [INFO ] Transformed 626 places.
[2024-06-02 23:42:42] [INFO ] Transformed 1031 transitions.
[2024-06-02 23:42:42] [INFO ] Found NUPN structural information;
[2024-06-02 23:42:42] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 611 transition count 1031
Discarding 136 places :
Symmetric choice reduction at 1 with 136 rule applications. Total rules 151 place count 475 transition count 895
Iterating global reduction 1 with 136 rules applied. Total rules applied 287 place count 475 transition count 895
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 288 place count 475 transition count 894
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 322 place count 441 transition count 756
Iterating global reduction 2 with 34 rules applied. Total rules applied 356 place count 441 transition count 756
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 441 transition count 755
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 366 place count 432 transition count 743
Iterating global reduction 3 with 9 rules applied. Total rules applied 375 place count 432 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 378 place count 432 transition count 740
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 380 place count 430 transition count 734
Iterating global reduction 4 with 2 rules applied. Total rules applied 382 place count 430 transition count 734
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 384 place count 428 transition count 730
Iterating global reduction 4 with 2 rules applied. Total rules applied 386 place count 428 transition count 730
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 388 place count 426 transition count 724
Iterating global reduction 4 with 2 rules applied. Total rules applied 390 place count 426 transition count 724
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 392 place count 424 transition count 720
Iterating global reduction 4 with 2 rules applied. Total rules applied 394 place count 424 transition count 720
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 395 place count 423 transition count 717
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 423 transition count 717
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 397 place count 422 transition count 715
Iterating global reduction 4 with 1 rules applied. Total rules applied 398 place count 422 transition count 715
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 399 place count 421 transition count 712
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 421 transition count 712
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 401 place count 420 transition count 710
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 420 transition count 710
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 403 place count 419 transition count 707
Iterating global reduction 4 with 1 rules applied. Total rules applied 404 place count 419 transition count 707
Applied a total of 404 rules in 182 ms. Remains 419 /626 variables (removed 207) and now considering 707/1031 (removed 324) transitions.
// Phase 1: matrix 707 rows 419 cols
[2024-06-02 23:42:43] [INFO ] Computed 10 invariants in 24 ms
[2024-06-02 23:42:43] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-06-02 23:42:43] [INFO ] Invariant cache hit.
[2024-06-02 23:42:43] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-06-02 23:42:43] [INFO ] Invariant cache hit.
[2024-06-02 23:42:44] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 419/626 places, 707/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1258 ms. Remains : 419/626 places, 707/1031 transitions.
Support contains 32 out of 419 places after structural reductions.
[2024-06-02 23:42:44] [INFO ] Flatten gal took : 71 ms
[2024-06-02 23:42:44] [INFO ] Flatten gal took : 38 ms
[2024-06-02 23:42:44] [INFO ] Input system was already deterministic with 707 transitions.
Support contains 27 out of 419 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-06-02 23:42:46] [INFO ] Invariant cache hit.
[2024-06-02 23:42:46] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-02 23:42:46] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 23:42:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:42:46] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 23:42:47] [INFO ] After 773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 260 ms.
[2024-06-02 23:42:47] [INFO ] After 1234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 141 ms.
Support contains 11 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 283 edges and 419 vertex of which 11 / 419 are part of one of the 3 SCC in 3 ms
Free SCC test removed 8 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 411 transition count 639
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 60 rules applied. Total rules applied 114 place count 358 transition count 632
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 355 transition count 632
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 117 place count 355 transition count 594
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 193 place count 317 transition count 594
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 200 place count 310 transition count 584
Iterating global reduction 3 with 7 rules applied. Total rules applied 207 place count 310 transition count 584
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 207 place count 310 transition count 581
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 213 place count 307 transition count 581
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 217 place count 303 transition count 574
Iterating global reduction 3 with 4 rules applied. Total rules applied 221 place count 303 transition count 574
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 224 place count 300 transition count 567
Iterating global reduction 3 with 3 rules applied. Total rules applied 227 place count 300 transition count 567
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 229 place count 298 transition count 562
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 298 transition count 562
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 233 place count 296 transition count 557
Iterating global reduction 3 with 2 rules applied. Total rules applied 235 place count 296 transition count 557
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 237 place count 294 transition count 552
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 294 transition count 552
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 241 place count 292 transition count 548
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 292 transition count 548
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 290 transition count 543
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 290 transition count 543
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 248 place count 289 transition count 541
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 289 transition count 541
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 250 place count 288 transition count 538
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 288 transition count 538
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 252 place count 287 transition count 536
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 287 transition count 536
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 254 place count 286 transition count 533
Iterating global reduction 3 with 1 rules applied. Total rules applied 255 place count 286 transition count 533
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 256 place count 285 transition count 531
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 285 transition count 531
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 284 transition count 529
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 284 transition count 529
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 260 place count 283 transition count 527
Iterating global reduction 3 with 1 rules applied. Total rules applied 261 place count 283 transition count 527
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 327 place count 250 transition count 494
Performed 41 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 409 place count 209 transition count 581
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 412 place count 209 transition count 578
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 435 place count 209 transition count 555
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 465 place count 186 transition count 548
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 471 place count 180 transition count 542
Iterating global reduction 4 with 6 rules applied. Total rules applied 477 place count 180 transition count 542
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 483 place count 180 transition count 536
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 505 place count 180 transition count 514
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 508 place count 180 transition count 514
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 509 place count 180 transition count 514
Applied a total of 509 rules in 245 ms. Remains 180 /419 variables (removed 239) and now considering 514/707 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 180/419 places, 514/707 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 23:42:48] [INFO ] Flow matrix only has 505 transitions (discarded 9 similar events)
// Phase 1: matrix 505 rows 180 cols
[2024-06-02 23:42:48] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:42:48] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:42:48] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:42:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:42:48] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 23:42:48] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-02 23:42:48] [INFO ] After 117ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 23:42:48] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-06-02 23:42:49] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-06-02 23:42:49] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 514/514 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 178 transition count 512
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 178 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 177 transition count 510
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 177 transition count 510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 9 place count 176 transition count 513
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 176 transition count 510
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 176 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 175 transition count 509
Applied a total of 14 rules in 50 ms. Remains 175 /180 variables (removed 5) and now considering 509/514 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 175/180 places, 509/514 transitions.
Incomplete random walk after 10000 steps, including 343 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 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 64 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 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 64 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 500220 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 500220 steps, saw 126195 distinct states, run finished after 3002 ms. (steps per millisecond=166 ) properties seen :2
Running SMT prover for 3 properties.
[2024-06-02 23:42:52] [INFO ] Flow matrix only has 499 transitions (discarded 10 similar events)
// Phase 1: matrix 499 rows 175 cols
[2024-06-02 23:42:52] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:42:52] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:42:52] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:42:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:42:52] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:42:52] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-02 23:42:53] [INFO ] After 109ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:42:53] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-06-02 23:42:53] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 509/509 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 174 transition count 508
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 174 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 173 transition count 509
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 173 transition count 503
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 173 transition count 503
Applied a total of 11 rules in 33 ms. Remains 173 /175 variables (removed 2) and now considering 503/509 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 173/175 places, 503/509 transitions.
Incomplete random walk after 10000 steps, including 349 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 695749 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 695749 steps, saw 177654 distinct states, run finished after 3002 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:42:56] [INFO ] Flow matrix only has 493 transitions (discarded 10 similar events)
// Phase 1: matrix 493 rows 173 cols
[2024-06-02 23:42:56] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:42:56] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:42:56] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:42:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-02 23:42:56] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:42:56] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 23:42:56] [INFO ] After 99ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:42:56] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-06-02 23:42:56] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 503/503 transitions.
Applied a total of 0 rules in 8 ms. Remains 173 /173 variables (removed 0) and now considering 503/503 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 173/173 places, 503/503 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 503/503 transitions.
Applied a total of 0 rules in 6 ms. Remains 173 /173 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2024-06-02 23:42:56] [INFO ] Flow matrix only has 493 transitions (discarded 10 similar events)
[2024-06-02 23:42:56] [INFO ] Invariant cache hit.
[2024-06-02 23:42:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:42:56] [INFO ] Flow matrix only has 493 transitions (discarded 10 similar events)
[2024-06-02 23:42:56] [INFO ] Invariant cache hit.
[2024-06-02 23:42:57] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 23:42:57] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2024-06-02 23:42:57] [INFO ] Redundant transitions in 33 ms returned []
[2024-06-02 23:42:57] [INFO ] Flow matrix only has 493 transitions (discarded 10 similar events)
[2024-06-02 23:42:57] [INFO ] Invariant cache hit.
[2024-06-02 23:42:57] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 746 ms. Remains : 173/173 places, 503/503 transitions.
Graph (trivial) has 110 edges and 173 vertex of which 30 / 173 are part of one of the 5 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions removed 146 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 171 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 144 transition count 328
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 144 transition count 328
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 144 transition count 318
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 21 place count 143 transition count 317
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 46 place count 143 transition count 292
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 143 transition count 287
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 58 place count 138 transition count 285
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 138 transition count 283
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 136 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 135 transition count 282
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 135 transition count 279
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 3 with 2 rules applied. Total rules applied 69 place count 134 transition count 278
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 133 transition count 244
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 133 transition count 244
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 133 transition count 239
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 82 place count 128 transition count 238
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 86 place count 128 transition count 234
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 128 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 126 transition count 232
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 94 place count 126 transition count 232
Applied a total of 94 rules in 50 ms. Remains 126 /173 variables (removed 47) and now considering 232/503 (removed 271) transitions.
Running SMT prover for 3 properties.
[2024-06-02 23:42:57] [INFO ] Flow matrix only has 228 transitions (discarded 4 similar events)
// Phase 1: matrix 228 rows 126 cols
[2024-06-02 23:42:57] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 23:42:57] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:42:57] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:42:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:42:57] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:42:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 23:42:57] [INFO ] After 20ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:42:58] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-02 23:42:58] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA FireWire-PT-20-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-20-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 118 stabilizing places and 177 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)&&F(p1))))'
Support contains 3 out of 419 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 294 edges and 419 vertex of which 11 / 419 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 410 transition count 644
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 60 rules applied. Total rules applied 114 place count 357 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 354 transition count 637
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 117 place count 354 transition count 599
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 193 place count 316 transition count 599
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 203 place count 306 transition count 586
Iterating global reduction 3 with 10 rules applied. Total rules applied 213 place count 306 transition count 586
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 213 place count 306 transition count 581
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 301 transition count 581
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 294 transition count 570
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 294 transition count 570
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 240 place count 291 transition count 563
Iterating global reduction 3 with 3 rules applied. Total rules applied 243 place count 291 transition count 563
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 289 transition count 558
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 289 transition count 558
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 249 place count 287 transition count 553
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 287 transition count 553
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 285 transition count 548
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 285 transition count 548
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 257 place count 283 transition count 544
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 283 transition count 544
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 281 transition count 539
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 281 transition count 539
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 280 transition count 537
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 280 transition count 537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 279 transition count 534
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 279 transition count 534
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 278 transition count 532
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 278 transition count 532
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 277 transition count 529
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 277 transition count 529
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 276 transition count 527
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 276 transition count 527
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 275 transition count 525
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 275 transition count 525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 274 transition count 523
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 274 transition count 523
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 343 place count 241 transition count 490
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 431 place count 197 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 432 place count 197 transition count 584
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 434 place count 197 transition count 582
Applied a total of 434 rules in 179 ms. Remains 197 /419 variables (removed 222) and now considering 582/707 (removed 125) transitions.
[2024-06-02 23:42:58] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
// Phase 1: matrix 553 rows 197 cols
[2024-06-02 23:42:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:42:58] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-02 23:42:58] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
[2024-06-02 23:42:58] [INFO ] Invariant cache hit.
[2024-06-02 23:42:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:42:59] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-06-02 23:42:59] [INFO ] Redundant transitions in 14 ms returned []
[2024-06-02 23:42:59] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
[2024-06-02 23:42:59] [INFO ] Invariant cache hit.
[2024-06-02 23:42:59] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/419 places, 582/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1052 ms. Remains : 197/419 places, 582/707 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 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s137 0) (EQ s174 1)), p1:(EQ s124 0)], 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-20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-00 finished in 1298 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)))'
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 292 edges and 419 vertex of which 11 / 419 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 410 transition count 644
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 60 rules applied. Total rules applied 114 place count 357 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 354 transition count 637
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 117 place count 354 transition count 599
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 193 place count 316 transition count 599
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 204 place count 305 transition count 584
Iterating global reduction 3 with 11 rules applied. Total rules applied 215 place count 305 transition count 584
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 215 place count 305 transition count 579
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 225 place count 300 transition count 579
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 293 transition count 568
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 293 transition count 568
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 242 place count 290 transition count 561
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 290 transition count 561
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 288 transition count 556
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 288 transition count 556
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 286 transition count 551
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 286 transition count 551
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 284 transition count 546
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 284 transition count 546
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 282 transition count 542
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 282 transition count 542
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 263 place count 280 transition count 537
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 280 transition count 537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 279 transition count 535
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 279 transition count 535
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 278 transition count 532
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 278 transition count 532
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 277 transition count 530
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 277 transition count 530
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 276 transition count 527
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 276 transition count 527
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 275 transition count 525
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 275 transition count 525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 274 transition count 523
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 274 transition count 523
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 273 transition count 521
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 273 transition count 521
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 341 place count 242 transition count 490
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
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 429 place count 198 transition count 588
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 432 place count 198 transition count 585
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 434 place count 198 transition count 585
Applied a total of 434 rules in 115 ms. Remains 198 /419 variables (removed 221) and now considering 585/707 (removed 122) transitions.
[2024-06-02 23:42:59] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
// Phase 1: matrix 556 rows 198 cols
[2024-06-02 23:42:59] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:42:59] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-02 23:42:59] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:42:59] [INFO ] Invariant cache hit.
[2024-06-02 23:43:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 23:43:00] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-06-02 23:43:00] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 23:43:00] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:43:00] [INFO ] Invariant cache hit.
[2024-06-02 23:43:00] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 198/419 places, 585/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 902 ms. Remains : 198/419 places, 585/707 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-01 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 s82 0) (EQ s27 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 134 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
Computed a total of 33 stabilizing places and 58 stable transitions
Computed a total of 33 stabilizing places and 58 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 64 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 384 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1173515 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :{}
Probabilistic random walk after 1173515 steps, saw 247209 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:43:03] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:43:03] [INFO ] Invariant cache hit.
[2024-06-02 23:43:03] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:43:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:04] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 23:43:04] [INFO ] After 63ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:04] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2024-06-02 23:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-06-02 23:43:04] [INFO ] After 190ms 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:43:04] [INFO ] After 348ms 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 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 585/585 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 198 transition count 582
Free-agglomeration rule applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 25 place count 198 transition count 560
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 56 place count 176 transition count 551
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 170 transition count 545
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 170 transition count 545
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 77 place count 170 transition count 536
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 104 place count 170 transition count 509
Applied a total of 104 rules in 30 ms. Remains 170 /198 variables (removed 28) and now considering 509/585 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 170/198 places, 509/585 transitions.
Incomplete random walk after 10000 steps, including 361 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1208624 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :{}
Probabilistic random walk after 1208624 steps, saw 308739 distinct states, run finished after 3003 ms. (steps per millisecond=402 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:43:07] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
// Phase 1: matrix 498 rows 170 cols
[2024-06-02 23:43:07] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:43:07] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:43:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:43:07] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:07] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-06-02 23:43:07] [INFO ] After 42ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:07] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2024-06-02 23:43:07] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:43:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2024-06-02 23:43:07] [INFO ] After 291ms 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:43:07] [INFO ] After 466ms 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 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 509/509 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 170/170 places, 509/509 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 509/509 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 509/509 (removed 0) transitions.
[2024-06-02 23:43:07] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
[2024-06-02 23:43:07] [INFO ] Invariant cache hit.
[2024-06-02 23:43:08] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-02 23:43:08] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
[2024-06-02 23:43:08] [INFO ] Invariant cache hit.
[2024-06-02 23:43:08] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-06-02 23:43:08] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2024-06-02 23:43:08] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 23:43:08] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
[2024-06-02 23:43:08] [INFO ] Invariant cache hit.
[2024-06-02 23:43:08] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 720 ms. Remains : 170/170 places, 509/509 transitions.
Graph (trivial) has 114 edges and 170 vertex of which 28 / 170 are part of one of the 4 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions removed 144 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 172 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 143 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 143 transition count 334
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 143 transition count 319
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 24 place count 142 transition count 318
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 1 with 28 rules applied. Total rules applied 52 place count 142 transition count 290
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 142 transition count 284
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 67 place count 136 transition count 281
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 67 place count 136 transition count 278
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 133 transition count 278
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 3 with 2 rules applied. Total rules applied 75 place count 132 transition count 277
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 132 transition count 276
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 3 with 2 rules applied. Total rules applied 78 place count 131 transition count 275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 130 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 130 transition count 242
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 130 transition count 238
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 88 place count 126 transition count 238
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 126 transition count 234
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 126 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 124 transition count 232
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 124 transition count 232
Applied a total of 102 rules in 33 ms. Remains 124 /170 variables (removed 46) and now considering 232/509 (removed 277) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:43:08] [INFO ] Flow matrix only has 228 transitions (discarded 4 similar events)
// Phase 1: matrix 228 rows 124 cols
[2024-06-02 23:43:08] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 23:43:08] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:43:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-02 23:43:08] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 23:43:08] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:08] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-06-02 23:43:08] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 585/585 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-02 23:43:09] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
// Phase 1: matrix 556 rows 198 cols
[2024-06-02 23:43:09] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:43:09] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 23:43:09] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:43:09] [INFO ] Invariant cache hit.
[2024-06-02 23:43:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 23:43:09] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-06-02 23:43:09] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 23:43:09] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:43:09] [INFO ] Invariant cache hit.
[2024-06-02 23:43:09] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 632 ms. Remains : 198/198 places, 585/585 transitions.
Computed a total of 33 stabilizing places and 58 stable transitions
Computed a total of 33 stabilizing places and 58 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 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 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1177910 steps, run timeout after 3001 ms. (steps per millisecond=392 ) properties seen :{}
Probabilistic random walk after 1177910 steps, saw 248749 distinct states, run finished after 3001 ms. (steps per millisecond=392 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:43:12] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:43:12] [INFO ] Invariant cache hit.
[2024-06-02 23:43:12] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:43:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:43:13] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 23:43:13] [INFO ] After 57ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:13] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2024-06-02 23:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-06-02 23:43:13] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-02 23:43:13] [INFO ] After 368ms 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 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 585/585 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 198 transition count 582
Free-agglomeration rule applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 25 place count 198 transition count 560
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 56 place count 176 transition count 551
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 170 transition count 545
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 170 transition count 545
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 77 place count 170 transition count 536
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 104 place count 170 transition count 509
Applied a total of 104 rules in 24 ms. Remains 170 /198 variables (removed 28) and now considering 509/585 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 170/198 places, 509/585 transitions.
Incomplete random walk after 10000 steps, including 323 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1206381 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :{}
Probabilistic random walk after 1206381 steps, saw 308027 distinct states, run finished after 3002 ms. (steps per millisecond=401 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:43:16] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
// Phase 1: matrix 498 rows 170 cols
[2024-06-02 23:43:16] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:43:16] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:43:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:43:16] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:16] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-06-02 23:43:16] [INFO ] After 36ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:16] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2024-06-02 23:43:16] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2024-06-02 23:43:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2024-06-02 23:43:16] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-06-02 23:43:16] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 509/509 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 170/170 places, 509/509 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 509/509 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 509/509 (removed 0) transitions.
[2024-06-02 23:43:16] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
[2024-06-02 23:43:16] [INFO ] Invariant cache hit.
[2024-06-02 23:43:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:43:16] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
[2024-06-02 23:43:16] [INFO ] Invariant cache hit.
[2024-06-02 23:43:17] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-06-02 23:43:17] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-06-02 23:43:17] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 23:43:17] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
[2024-06-02 23:43:17] [INFO ] Invariant cache hit.
[2024-06-02 23:43:17] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 681 ms. Remains : 170/170 places, 509/509 transitions.
Graph (trivial) has 114 edges and 170 vertex of which 28 / 170 are part of one of the 4 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions removed 144 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 172 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 143 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 143 transition count 334
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 143 transition count 319
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 24 place count 142 transition count 318
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 1 with 28 rules applied. Total rules applied 52 place count 142 transition count 290
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 142 transition count 284
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 67 place count 136 transition count 281
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 67 place count 136 transition count 278
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 133 transition count 278
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 3 with 2 rules applied. Total rules applied 75 place count 132 transition count 277
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 132 transition count 276
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 3 with 2 rules applied. Total rules applied 78 place count 131 transition count 275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 130 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 130 transition count 242
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 130 transition count 238
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 88 place count 126 transition count 238
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 126 transition count 234
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 126 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 124 transition count 232
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 124 transition count 232
Applied a total of 102 rules in 35 ms. Remains 124 /170 variables (removed 46) and now considering 232/509 (removed 277) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:43:17] [INFO ] Flow matrix only has 228 transitions (discarded 4 similar events)
// Phase 1: matrix 228 rows 124 cols
[2024-06-02 23:43:17] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 23:43:17] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:43:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-02 23:43:17] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:17] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 23:43:17] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:43:17] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-06-02 23:43:17] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 77 ms.
Built C files in :
/tmp/ltsmin205482625663623633
[2024-06-02 23:43:18] [INFO ] Computing symmetric may disable matrix : 585 transitions.
[2024-06-02 23:43:18] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:43:18] [INFO ] Computing symmetric may enable matrix : 585 transitions.
[2024-06-02 23:43:18] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:43:18] [INFO ] Computing Do-Not-Accords matrix : 585 transitions.
[2024-06-02 23:43:18] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:43:18] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin205482625663623633
Running compilation step : cd /tmp/ltsmin205482625663623633;'/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 1414 ms.
Running link step : cd /tmp/ltsmin205482625663623633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin205482625663623633;'/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/stateBased936389787637794164.hoa' '--buchi-type=spotba'
LTSmin run took 3569 ms.
FORMULA FireWire-PT-20-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-20-LTLCardinality-01 finished in 23887 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(((X(!p1) U G(!p2))||p0)))'
Support contains 6 out of 419 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 284 edges and 419 vertex of which 9 / 419 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 412 transition count 649
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 58 rules applied. Total rules applied 110 place count 361 transition count 642
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 114 place count 358 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 357 transition count 641
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 115 place count 357 transition count 603
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 191 place count 319 transition count 603
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 201 place count 309 transition count 589
Iterating global reduction 4 with 10 rules applied. Total rules applied 211 place count 309 transition count 589
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 211 place count 309 transition count 585
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 219 place count 305 transition count 585
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 224 place count 300 transition count 578
Iterating global reduction 4 with 5 rules applied. Total rules applied 229 place count 300 transition count 578
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 232 place count 297 transition count 571
Iterating global reduction 4 with 3 rules applied. Total rules applied 235 place count 297 transition count 571
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 295 transition count 566
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 295 transition count 566
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 293 transition count 561
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 293 transition count 561
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 245 place count 291 transition count 556
Iterating global reduction 4 with 2 rules applied. Total rules applied 247 place count 291 transition count 556
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 249 place count 289 transition count 552
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 289 transition count 552
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 253 place count 287 transition count 547
Iterating global reduction 4 with 2 rules applied. Total rules applied 255 place count 287 transition count 547
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 256 place count 286 transition count 545
Iterating global reduction 4 with 1 rules applied. Total rules applied 257 place count 286 transition count 545
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 258 place count 285 transition count 542
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 285 transition count 542
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 284 transition count 540
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 284 transition count 540
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 262 place count 283 transition count 537
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 283 transition count 537
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 264 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 265 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 266 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 267 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 268 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 280 transition count 531
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 337 place count 246 transition count 497
Performed 41 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 419 place count 205 transition count 586
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 422 place count 205 transition count 583
Applied a total of 422 rules in 84 ms. Remains 205 /419 variables (removed 214) and now considering 583/707 (removed 124) transitions.
[2024-06-02 23:43:23] [INFO ] Flow matrix only has 560 transitions (discarded 23 similar events)
// Phase 1: matrix 560 rows 205 cols
[2024-06-02 23:43:23] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:43:23] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 23:43:23] [INFO ] Flow matrix only has 560 transitions (discarded 23 similar events)
[2024-06-02 23:43:23] [INFO ] Invariant cache hit.
[2024-06-02 23:43:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:43:23] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-06-02 23:43:23] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 23:43:24] [INFO ] Flow matrix only has 560 transitions (discarded 23 similar events)
[2024-06-02 23:43:24] [INFO ] Invariant cache hit.
[2024-06-02 23:43:24] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/419 places, 583/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 805 ms. Remains : 205/419 places, 583/707 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) p2)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s140 0) (EQ s32 1)) (AND (EQ s193 0) (EQ s14 1))), p2:(OR (EQ s74 0) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-02 finished in 854 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)&&X((G(p2)&&p1))))'
Support contains 7 out of 419 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 410 transition count 695
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 410 transition count 695
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 405 transition count 687
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 405 transition count 687
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 404 transition count 684
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 404 transition count 684
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 403 transition count 682
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 403 transition count 682
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 402 transition count 679
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 402 transition count 679
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 401 transition count 677
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 401 transition count 677
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 400 transition count 675
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 400 transition count 675
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 399 transition count 673
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 399 transition count 673
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 398 transition count 672
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 398 transition count 672
Applied a total of 42 rules in 46 ms. Remains 398 /419 variables (removed 21) and now considering 672/707 (removed 35) transitions.
// Phase 1: matrix 672 rows 398 cols
[2024-06-02 23:43:24] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:43:24] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 23:43:24] [INFO ] Invariant cache hit.
[2024-06-02 23:43:24] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-06-02 23:43:24] [INFO ] Invariant cache hit.
[2024-06-02 23:43:25] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 398/419 places, 672/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 824 ms. Remains : 398/419 places, 672/707 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s16 0) (EQ s358 1)), p1:(AND (EQ s127 1) (OR (EQ s198 0) (EQ s46 1))), p2:(AND (EQ s338 0) (EQ s62 1))], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-05 finished in 998 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&&F(p0))))'
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 293 edges and 419 vertex of which 11 / 419 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 410 transition count 645
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 59 rules applied. Total rules applied 112 place count 358 transition count 638
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 355 transition count 638
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 115 place count 355 transition count 601
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 189 place count 318 transition count 601
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 201 place count 306 transition count 585
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 306 transition count 585
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 213 place count 306 transition count 580
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 301 transition count 580
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 294 transition count 569
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 294 transition count 569
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 240 place count 291 transition count 562
Iterating global reduction 3 with 3 rules applied. Total rules applied 243 place count 291 transition count 562
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 289 transition count 557
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 289 transition count 557
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 249 place count 287 transition count 552
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 287 transition count 552
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 285 transition count 547
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 285 transition count 547
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 257 place count 283 transition count 543
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 283 transition count 543
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 281 transition count 538
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 281 transition count 538
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 280 transition count 536
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 280 transition count 536
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 279 transition count 533
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 279 transition count 533
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 278 transition count 531
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 278 transition count 531
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 277 transition count 528
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 277 transition count 528
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 276 transition count 526
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 276 transition count 526
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 275 transition count 524
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 275 transition count 524
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 274 transition count 522
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 274 transition count 522
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 343 place count 241 transition count 489
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
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 433 place count 196 transition count 588
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 436 place count 196 transition count 585
Applied a total of 436 rules in 82 ms. Remains 196 /419 variables (removed 223) and now considering 585/707 (removed 122) transitions.
[2024-06-02 23:43:25] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
// Phase 1: matrix 559 rows 196 cols
[2024-06-02 23:43:25] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:43:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 23:43:25] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2024-06-02 23:43:25] [INFO ] Invariant cache hit.
[2024-06-02 23:43:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:43:25] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-06-02 23:43:25] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 23:43:25] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2024-06-02 23:43:25] [INFO ] Invariant cache hit.
[2024-06-02 23:43:25] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/419 places, 585/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 667 ms. Remains : 196/419 places, 585/707 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s139 0) (NEQ s191 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, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-11 finished in 756 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 419 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 295 edges and 419 vertex of which 11 / 419 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 410 transition count 644
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 60 rules applied. Total rules applied 114 place count 357 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 354 transition count 637
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 117 place count 354 transition count 599
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 193 place count 316 transition count 599
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 205 place count 304 transition count 583
Iterating global reduction 3 with 12 rules applied. Total rules applied 217 place count 304 transition count 583
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 217 place count 304 transition count 578
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 227 place count 299 transition count 578
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 233 place count 293 transition count 568
Iterating global reduction 3 with 6 rules applied. Total rules applied 239 place count 293 transition count 568
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 242 place count 290 transition count 561
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 290 transition count 561
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 288 transition count 556
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 288 transition count 556
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 286 transition count 551
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 286 transition count 551
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 284 transition count 546
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 284 transition count 546
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 282 transition count 542
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 282 transition count 542
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 263 place count 280 transition count 537
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 280 transition count 537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 279 transition count 535
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 279 transition count 535
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 278 transition count 532
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 278 transition count 532
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 277 transition count 530
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 277 transition count 530
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 276 transition count 527
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 276 transition count 527
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 275 transition count 525
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 275 transition count 525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 274 transition count 523
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 274 transition count 523
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 273 transition count 521
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 273 transition count 521
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 345 place count 240 transition count 488
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 433 place count 196 transition count 582
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 436 place count 196 transition count 579
Applied a total of 436 rules in 84 ms. Remains 196 /419 variables (removed 223) and now considering 579/707 (removed 128) transitions.
[2024-06-02 23:43:26] [INFO ] Flow matrix only has 553 transitions (discarded 26 similar events)
// Phase 1: matrix 553 rows 196 cols
[2024-06-02 23:43:26] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:43:26] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 23:43:26] [INFO ] Flow matrix only has 553 transitions (discarded 26 similar events)
[2024-06-02 23:43:26] [INFO ] Invariant cache hit.
[2024-06-02 23:43:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:43:26] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-02 23:43:26] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 23:43:26] [INFO ] Flow matrix only has 553 transitions (discarded 26 similar events)
[2024-06-02 23:43:26] [INFO ] Invariant cache hit.
[2024-06-02 23:43:26] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/419 places, 579/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 797 ms. Remains : 196/419 places, 579/707 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s126 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-20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-12 finished in 838 ms.
All properties solved by simple procedures.
Total runtime 44310 ms.

BK_STOP 1717371807716

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-20"
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-20, 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-171734910500202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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