fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r571-tall-171734910200072
Last Updated
July 7, 2024

About the Execution of 2023-gold for CO4-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
461.976 16986.00 32556.00 368.90 FFTFFFFTFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910200072.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 CO4-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 255K 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 CO4-PT-15-LTLCardinality-00
FORMULA_NAME CO4-PT-15-LTLCardinality-01
FORMULA_NAME CO4-PT-15-LTLCardinality-02
FORMULA_NAME CO4-PT-15-LTLCardinality-03
FORMULA_NAME CO4-PT-15-LTLCardinality-04
FORMULA_NAME CO4-PT-15-LTLCardinality-05
FORMULA_NAME CO4-PT-15-LTLCardinality-06
FORMULA_NAME CO4-PT-15-LTLCardinality-07
FORMULA_NAME CO4-PT-15-LTLCardinality-08
FORMULA_NAME CO4-PT-15-LTLCardinality-09
FORMULA_NAME CO4-PT-15-LTLCardinality-10
FORMULA_NAME CO4-PT-15-LTLCardinality-11
FORMULA_NAME CO4-PT-15-LTLCardinality-12
FORMULA_NAME CO4-PT-15-LTLCardinality-13
FORMULA_NAME CO4-PT-15-LTLCardinality-14
FORMULA_NAME CO4-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368740883

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=CO4-PT-15
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:52:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:52:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:52:22] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 22:52:22] [INFO ] Transformed 833 places.
[2024-06-02 22:52:22] [INFO ] Transformed 1106 transitions.
[2024-06-02 22:52:22] [INFO ] Found NUPN structural information;
[2024-06-02 22:52:22] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 124 places in 9 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 689 transition count 906
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 180 place count 532 transition count 748
Iterating global reduction 1 with 157 rules applied. Total rules applied 337 place count 532 transition count 748
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 344 place count 532 transition count 741
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 422 place count 454 transition count 652
Iterating global reduction 2 with 78 rules applied. Total rules applied 500 place count 454 transition count 652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 501 place count 454 transition count 651
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 517 place count 438 transition count 626
Iterating global reduction 3 with 16 rules applied. Total rules applied 533 place count 438 transition count 626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 534 place count 438 transition count 625
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 542 place count 430 transition count 617
Iterating global reduction 4 with 8 rules applied. Total rules applied 550 place count 430 transition count 617
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 555 place count 425 transition count 612
Iterating global reduction 4 with 5 rules applied. Total rules applied 560 place count 425 transition count 612
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 565 place count 425 transition count 607
Applied a total of 565 rules in 158 ms. Remains 425 /709 variables (removed 284) and now considering 607/909 (removed 302) transitions.
// Phase 1: matrix 607 rows 425 cols
[2024-06-02 22:52:23] [INFO ] Computed 7 invariants in 14 ms
[2024-06-02 22:52:23] [INFO ] Implicit Places using invariants in 279 ms returned [5, 361]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 465 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 423/709 places, 607/909 transitions.
Applied a total of 0 rules in 9 ms. Remains 423 /423 variables (removed 0) and now considering 607/607 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 633 ms. Remains : 423/709 places, 607/909 transitions.
Support contains 26 out of 423 places after structural reductions.
[2024-06-02 22:52:23] [INFO ] Flatten gal took : 64 ms
[2024-06-02 22:52:23] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:52:23] [INFO ] Input system was already deterministic with 607 transitions.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 607 rows 423 cols
[2024-06-02 22:52:24] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 22:52:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-02 22:52:24] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 22:52:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:25] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-02 22:52:26] [INFO ] After 759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 208 ms.
[2024-06-02 22:52:26] [INFO ] After 1393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 9 properties in 40 ms.
Support contains 2 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 607/607 transitions.
Graph (trivial) has 458 edges and 423 vertex of which 2 / 423 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 893 edges and 422 vertex of which 400 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 400 transition count 414
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 154 rules applied. Total rules applied 327 place count 247 transition count 413
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 327 place count 247 transition count 370
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 413 place count 204 transition count 370
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 421 place count 196 transition count 362
Iterating global reduction 2 with 8 rules applied. Total rules applied 429 place count 196 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 431 place count 196 transition count 360
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 431 place count 196 transition count 357
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 437 place count 193 transition count 357
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 442 place count 188 transition count 351
Iterating global reduction 3 with 5 rules applied. Total rules applied 447 place count 188 transition count 351
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 452 place count 188 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 453 place count 187 transition count 346
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 454 place count 186 transition count 345
Iterating global reduction 5 with 1 rules applied. Total rules applied 455 place count 186 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 456 place count 186 transition count 344
Performed 63 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 582 place count 123 transition count 266
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 17 rules applied. Total rules applied 599 place count 123 transition count 249
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 603 place count 121 transition count 247
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 606 place count 118 transition count 241
Iterating global reduction 8 with 3 rules applied. Total rules applied 609 place count 118 transition count 241
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 615 place count 115 transition count 238
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 616 place count 115 transition count 237
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 617 place count 114 transition count 235
Iterating global reduction 9 with 1 rules applied. Total rules applied 618 place count 114 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 619 place count 114 transition count 234
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 697 place count 75 transition count 274
Drop transitions removed 38 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 10 with 58 rules applied. Total rules applied 755 place count 75 transition count 216
Discarding 27 places :
Symmetric choice reduction at 11 with 27 rule applications. Total rules 782 place count 48 transition count 135
Iterating global reduction 11 with 27 rules applied. Total rules applied 809 place count 48 transition count 135
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 828 place count 48 transition count 116
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 834 place count 42 transition count 86
Iterating global reduction 12 with 6 rules applied. Total rules applied 840 place count 42 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 844 place count 42 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 846 place count 41 transition count 97
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 849 place count 41 transition count 94
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 14 with 10 rules applied. Total rules applied 859 place count 41 transition count 84
Free-agglomeration rule applied 8 times.
Iterating global reduction 14 with 8 rules applied. Total rules applied 867 place count 41 transition count 76
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 877 place count 33 transition count 74
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 880 place count 33 transition count 74
Graph (complete) has 127 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 881 place count 32 transition count 74
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 884 place count 32 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 885 place count 31 transition count 70
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t324.t491.t321 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 20 edges and 27 vertex of which 4 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 17 with 5 rules applied. Total rules applied 890 place count 24 transition count 66
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 24 edges and 19 vertex of which 13 / 19 are part of one of the 2 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 905 place count 8 transition count 57
Drop transitions removed 39 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 11 edges and 8 vertex of which 6 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 19 with 49 rules applied. Total rules applied 954 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 955 place count 6 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 956 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 957 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 958 place count 5 transition count 5
Applied a total of 958 rules in 97 ms. Remains 5 /423 variables (removed 418) and now considering 5/607 (removed 602) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 5/423 places, 5/607 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 895 edges and 423 vertex of which 420 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 406 transition count 589
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 406 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 406 transition count 588
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 401 transition count 583
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 401 transition count 583
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 401 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 400 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 400 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 400 transition count 578
Applied a total of 51 rules in 35 ms. Remains 400 /423 variables (removed 23) and now considering 578/607 (removed 29) transitions.
// Phase 1: matrix 578 rows 400 cols
[2024-06-02 22:52:26] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 22:52:26] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 22:52:26] [INFO ] Invariant cache hit.
[2024-06-02 22:52:27] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-06-02 22:52:27] [INFO ] Invariant cache hit.
[2024-06-02 22:52:27] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/423 places, 578/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 400/423 places, 578/607 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 322 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s239 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA CO4-PT-15-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-01 finished in 996 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 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Graph (trivial) has 459 edges and 423 vertex of which 2 / 423 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 894 edges and 422 vertex of which 419 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 418 transition count 443
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 318 place count 262 transition count 442
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 318 place count 262 transition count 398
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 406 place count 218 transition count 398
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 414 place count 210 transition count 390
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 210 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 210 transition count 388
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 424 place count 210 transition count 384
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 432 place count 206 transition count 384
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 435 place count 203 transition count 380
Iterating global reduction 3 with 3 rules applied. Total rules applied 438 place count 203 transition count 380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 441 place count 203 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 442 place count 202 transition count 377
Performed 64 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 570 place count 138 transition count 296
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 18 rules applied. Total rules applied 588 place count 138 transition count 278
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 592 place count 136 transition count 276
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 595 place count 133 transition count 270
Iterating global reduction 7 with 3 rules applied. Total rules applied 598 place count 133 transition count 270
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 606 place count 129 transition count 266
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 607 place count 128 transition count 264
Iterating global reduction 7 with 1 rules applied. Total rules applied 608 place count 128 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 609 place count 128 transition count 263
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 691 place count 87 transition count 306
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 712 place count 87 transition count 285
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 740 place count 59 transition count 173
Iterating global reduction 9 with 28 rules applied. Total rules applied 768 place count 59 transition count 173
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 787 place count 59 transition count 154
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 794 place count 52 transition count 116
Iterating global reduction 10 with 7 rules applied. Total rules applied 801 place count 52 transition count 116
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 806 place count 52 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 808 place count 51 transition count 128
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 11 with 17 rules applied. Total rules applied 825 place count 51 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 827 place count 49 transition count 109
Applied a total of 827 rules in 93 ms. Remains 49 /423 variables (removed 374) and now considering 109/607 (removed 498) transitions.
[2024-06-02 22:52:27] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
// Phase 1: matrix 81 rows 49 cols
[2024-06-02 22:52:27] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 22:52:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:52:27] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
[2024-06-02 22:52:27] [INFO ] Invariant cache hit.
[2024-06-02 22:52:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:52:28] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-06-02 22:52:28] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 22:52:28] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
[2024-06-02 22:52:28] [INFO ] Invariant cache hit.
[2024-06-02 22:52:28] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/423 places, 109/607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 609 ms. Remains : 49/423 places, 109/607 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-03 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:(EQ s45 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 69 steps with 5 reset in 4 ms.
FORMULA CO4-PT-15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-03 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Graph (trivial) has 456 edges and 423 vertex of which 2 / 423 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 894 edges and 422 vertex of which 419 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 418 transition count 447
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 154 rules applied. Total rules applied 311 place count 266 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 312 place count 265 transition count 445
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 312 place count 265 transition count 401
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 400 place count 221 transition count 401
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 408 place count 213 transition count 392
Iterating global reduction 3 with 8 rules applied. Total rules applied 416 place count 213 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 418 place count 213 transition count 390
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 418 place count 213 transition count 387
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 424 place count 210 transition count 387
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 426 place count 208 transition count 384
Iterating global reduction 4 with 2 rules applied. Total rules applied 428 place count 208 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 429 place count 208 transition count 383
Performed 66 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 561 place count 142 transition count 300
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 17 rules applied. Total rules applied 578 place count 142 transition count 283
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 582 place count 140 transition count 281
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 585 place count 137 transition count 275
Iterating global reduction 7 with 3 rules applied. Total rules applied 588 place count 137 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 594 place count 134 transition count 272
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 595 place count 133 transition count 270
Iterating global reduction 7 with 1 rules applied. Total rules applied 596 place count 133 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 597 place count 133 transition count 269
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 679 place count 92 transition count 317
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 700 place count 92 transition count 296
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 728 place count 64 transition count 184
Iterating global reduction 9 with 28 rules applied. Total rules applied 756 place count 64 transition count 184
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 775 place count 64 transition count 165
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 782 place count 57 transition count 127
Iterating global reduction 10 with 7 rules applied. Total rules applied 789 place count 57 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 794 place count 57 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 798 place count 55 transition count 147
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 820 place count 55 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 822 place count 53 transition count 123
Applied a total of 822 rules in 67 ms. Remains 53 /423 variables (removed 370) and now considering 123/607 (removed 484) transitions.
[2024-06-02 22:52:28] [INFO ] Flow matrix only has 92 transitions (discarded 31 similar events)
// Phase 1: matrix 92 rows 53 cols
[2024-06-02 22:52:28] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 22:52:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 22:52:28] [INFO ] Flow matrix only has 92 transitions (discarded 31 similar events)
[2024-06-02 22:52:28] [INFO ] Invariant cache hit.
[2024-06-02 22:52:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:52:28] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 22:52:28] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 22:52:28] [INFO ] Flow matrix only has 92 transitions (discarded 31 similar events)
[2024-06-02 22:52:28] [INFO ] Invariant cache hit.
[2024-06-02 22:52:28] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/423 places, 123/607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 53/423 places, 123/607 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s26 1), p0:(OR (EQ s17 0) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CO4-PT-15-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-05 finished in 594 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' '!((!p0 U (G(p1)&&X(F(p0)))))'
Support contains 6 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 409 transition count 592
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 409 transition count 592
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 405 transition count 588
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 405 transition count 588
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 405 transition count 586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 404 transition count 585
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 404 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 404 transition count 584
Applied a total of 41 rules in 30 ms. Remains 404 /423 variables (removed 19) and now considering 584/607 (removed 23) transitions.
// Phase 1: matrix 584 rows 404 cols
[2024-06-02 22:52:29] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:52:29] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:52:29] [INFO ] Invariant cache hit.
[2024-06-02 22:52:29] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-06-02 22:52:29] [INFO ] Invariant cache hit.
[2024-06-02 22:52:29] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 404/423 places, 584/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 404/423 places, 584/607 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-15-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(OR (EQ s347 0) (EQ s145 1) (EQ s225 0) (EQ s73 1)), p0:(OR (EQ s36 0) (EQ s382 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 338 reset in 210 ms.
Product exploration explored 100000 steps with 972 reset in 151 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 864 edges and 404 vertex of which 401 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 133 ms. Reduced automaton from 5 states, 14 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1443570 steps, run timeout after 3001 ms. (steps per millisecond=481 ) properties seen :{}
Probabilistic random walk after 1443570 steps, saw 253470 distinct states, run finished after 3002 ms. (steps per millisecond=480 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:52:33] [INFO ] Invariant cache hit.
[2024-06-02 22:52:33] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:52:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:33] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:52:33] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-06-02 22:52:33] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 12 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-15-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-15-LTLCardinality-06 finished in 4982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p1)&&G(p2))))'
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 410 transition count 593
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 410 transition count 593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 410 transition count 592
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 405 transition count 587
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 405 transition count 587
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 405 transition count 584
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 404 transition count 583
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 404 transition count 583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 404 transition count 582
Applied a total of 43 rules in 23 ms. Remains 404 /423 variables (removed 19) and now considering 582/607 (removed 25) transitions.
// Phase 1: matrix 582 rows 404 cols
[2024-06-02 22:52:33] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:52:34] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 22:52:34] [INFO ] Invariant cache hit.
[2024-06-02 22:52:34] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-06-02 22:52:34] [INFO ] Invariant cache hit.
[2024-06-02 22:52:34] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 404/423 places, 582/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 621 ms. Remains : 404/423 places, 582/607 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(OR (EQ s326 0) (EQ s17 1)), p0:(EQ s193 1), p1:(OR (EQ s307 0) (EQ s275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1523 steps with 34 reset in 9 ms.
FORMULA CO4-PT-15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-09 finished in 825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(G(p2)&&p1))))))'
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 408 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 408 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 408 transition count 590
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 403 transition count 585
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 403 transition count 585
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 403 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 402 transition count 581
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 402 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 402 transition count 580
Applied a total of 47 rules in 29 ms. Remains 402 /423 variables (removed 21) and now considering 580/607 (removed 27) transitions.
// Phase 1: matrix 580 rows 402 cols
[2024-06-02 22:52:34] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:52:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 22:52:34] [INFO ] Invariant cache hit.
[2024-06-02 22:52:35] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-06-02 22:52:35] [INFO ] Invariant cache hit.
[2024-06-02 22:52:35] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/423 places, 580/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 588 ms. Remains : 402/423 places, 580/607 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CO4-PT-15-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(EQ s73 1), p1:(AND (EQ s298 0) (EQ s42 1)), p2:(EQ s73 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-15-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-10 finished in 885 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(X(p1))&&p0)))'
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 408 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 408 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 408 transition count 590
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 404 transition count 586
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 404 transition count 586
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 404 transition count 584
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 403 transition count 583
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 403 transition count 583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 403 transition count 582
Applied a total of 44 rules in 28 ms. Remains 403 /423 variables (removed 20) and now considering 582/607 (removed 25) transitions.
// Phase 1: matrix 582 rows 403 cols
[2024-06-02 22:52:35] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:52:35] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 22:52:35] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 403/423 places, 582/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 571 ms. Remains : 403/423 places, 582/607 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(AND (EQ s390 1) (OR (EQ s390 0) (EQ s372 0) (EQ s158 1))), p1:(EQ s390 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-11 finished in 788 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)&&F(G(p1)))))'
Support contains 4 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 607/607 transitions.
Graph (trivial) has 454 edges and 423 vertex of which 2 / 423 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 894 edges and 422 vertex of which 419 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 418 transition count 446
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 155 rules applied. Total rules applied 313 place count 265 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 314 place count 264 transition count 444
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 314 place count 264 transition count 401
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 400 place count 221 transition count 401
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 407 place count 214 transition count 393
Iterating global reduction 3 with 7 rules applied. Total rules applied 414 place count 214 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 214 transition count 392
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 415 place count 214 transition count 389
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 211 transition count 389
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 424 place count 208 transition count 385
Iterating global reduction 4 with 3 rules applied. Total rules applied 427 place count 208 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 429 place count 208 transition count 383
Performed 66 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 561 place count 142 transition count 300
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 17 rules applied. Total rules applied 578 place count 142 transition count 283
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 582 place count 140 transition count 281
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 585 place count 137 transition count 275
Iterating global reduction 7 with 3 rules applied. Total rules applied 588 place count 137 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 594 place count 134 transition count 272
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 595 place count 133 transition count 270
Iterating global reduction 7 with 1 rules applied. Total rules applied 596 place count 133 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 597 place count 133 transition count 269
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 677 place count 93 transition count 315
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 697 place count 93 transition count 295
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 723 place count 67 transition count 191
Iterating global reduction 9 with 26 rules applied. Total rules applied 749 place count 67 transition count 191
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 767 place count 67 transition count 173
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 773 place count 61 transition count 137
Iterating global reduction 10 with 6 rules applied. Total rules applied 779 place count 61 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 783 place count 61 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 785 place count 60 transition count 150
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 11 with 18 rules applied. Total rules applied 803 place count 60 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 805 place count 58 transition count 130
Applied a total of 805 rules in 60 ms. Remains 58 /423 variables (removed 365) and now considering 130/607 (removed 477) transitions.
[2024-06-02 22:52:36] [INFO ] Flow matrix only has 109 transitions (discarded 21 similar events)
// Phase 1: matrix 109 rows 58 cols
[2024-06-02 22:52:36] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 22:52:36] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 22:52:36] [INFO ] Flow matrix only has 109 transitions (discarded 21 similar events)
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:52:36] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-02 22:52:36] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:52:36] [INFO ] Flow matrix only has 109 transitions (discarded 21 similar events)
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/423 places, 130/607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 58/423 places, 130/607 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-13 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s22 0) (EQ s47 1)), p1:(OR (EQ s26 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1043 steps with 84 reset in 9 ms.
FORMULA CO4-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-13 finished in 417 ms.
All properties solved by simple procedures.
Total runtime 14453 ms.

BK_STOP 1717368757869

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="CO4-PT-15"
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 CO4-PT-15, 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-171734910200072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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