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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 138K 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-08-LTLCardinality-00
FORMULA_NAME CO4-PT-08-LTLCardinality-01
FORMULA_NAME CO4-PT-08-LTLCardinality-02
FORMULA_NAME CO4-PT-08-LTLCardinality-03
FORMULA_NAME CO4-PT-08-LTLCardinality-04
FORMULA_NAME CO4-PT-08-LTLCardinality-05
FORMULA_NAME CO4-PT-08-LTLCardinality-06
FORMULA_NAME CO4-PT-08-LTLCardinality-07
FORMULA_NAME CO4-PT-08-LTLCardinality-08
FORMULA_NAME CO4-PT-08-LTLCardinality-09
FORMULA_NAME CO4-PT-08-LTLCardinality-10
FORMULA_NAME CO4-PT-08-LTLCardinality-11
FORMULA_NAME CO4-PT-08-LTLCardinality-12
FORMULA_NAME CO4-PT-08-LTLCardinality-13
FORMULA_NAME CO4-PT-08-LTLCardinality-14
FORMULA_NAME CO4-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368634838

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-08
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:50:36] [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:50:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:36] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-02 22:50:36] [INFO ] Transformed 467 places.
[2024-06-02 22:50:36] [INFO ] Transformed 600 transitions.
[2024-06-02 22:50:36] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:36] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 108 places in 7 ms
Reduce places removed 108 places and 155 transitions.
FORMULA CO4-PT-08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 347 transition count 444
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 87 place count 273 transition count 368
Iterating global reduction 1 with 74 rules applied. Total rules applied 161 place count 273 transition count 368
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 166 place count 273 transition count 363
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 198 place count 241 transition count 316
Iterating global reduction 2 with 32 rules applied. Total rules applied 230 place count 241 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 232 place count 241 transition count 314
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 237 transition count 308
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 237 transition count 308
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 241 place count 236 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 236 transition count 307
Applied a total of 242 rules in 66 ms. Remains 236 /359 variables (removed 123) and now considering 307/445 (removed 138) transitions.
// Phase 1: matrix 307 rows 236 cols
[2024-06-02 22:50:36] [INFO ] Computed 6 invariants in 7 ms
[2024-06-02 22:50:37] [INFO ] Implicit Places using invariants in 383 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 408 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/359 places, 307/445 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 480 ms. Remains : 235/359 places, 307/445 transitions.
Support contains 26 out of 235 places after structural reductions.
[2024-06-02 22:50:37] [INFO ] Flatten gal took : 43 ms
[2024-06-02 22:50:37] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:50:37] [INFO ] Input system was already deterministic with 307 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 307 rows 235 cols
[2024-06-02 22:50:37] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 22:50:38] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-06-02 22:50:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:38] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-06-02 22:50:38] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 169 ms.
[2024-06-02 22:50:38] [INFO ] After 827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 5 properties in 85 ms.
Support contains 16 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 307/307 transitions.
Graph (trivial) has 221 edges and 235 vertex of which 2 / 235 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 432 edges and 234 vertex of which 230 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 230 transition count 215
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 150 transition count 210
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 177 place count 148 transition count 205
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 181 place count 144 transition count 205
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 181 place count 144 transition count 189
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 213 place count 128 transition count 189
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 288 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 215 place count 127 transition count 188
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 217 place count 127 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 218 place count 126 transition count 186
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 220 place count 124 transition count 183
Iterating global reduction 7 with 2 rules applied. Total rules applied 222 place count 124 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 223 place count 124 transition count 182
Performed 30 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 283 place count 94 transition count 150
Drop transitions removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 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 8 with 13 rules applied. Total rules applied 296 place count 94 transition count 137
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 298 place count 93 transition count 136
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 302 place count 89 transition count 132
Iterating global reduction 10 with 4 rules applied. Total rules applied 306 place count 89 transition count 132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 314 place count 85 transition count 128
Drop transitions removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 319 place count 85 transition count 123
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 322 place count 82 transition count 120
Iterating global reduction 11 with 3 rules applied. Total rules applied 325 place count 82 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 326 place count 82 transition count 119
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 327 place count 81 transition count 118
Iterating global reduction 12 with 1 rules applied. Total rules applied 328 place count 81 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 330 place count 80 transition count 117
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 331 place count 80 transition count 116
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 332 place count 79 transition count 115
Iterating global reduction 13 with 1 rules applied. Total rules applied 333 place count 79 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 334 place count 79 transition count 114
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 14 with 22 rules applied. Total rules applied 356 place count 68 transition count 116
Drop transitions removed 10 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 14 with 14 rules applied. Total rules applied 370 place count 68 transition count 102
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 378 place count 60 transition count 94
Iterating global reduction 15 with 8 rules applied. Total rules applied 386 place count 60 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 390 place count 60 transition count 90
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 397 place count 60 transition count 83
Free-agglomeration rule applied 15 times.
Iterating global reduction 16 with 15 rules applied. Total rules applied 412 place count 60 transition count 68
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 16 with 15 rules applied. Total rules applied 427 place count 45 transition count 68
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 431 place count 45 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 432 place count 45 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 433 place count 44 transition count 63
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 434 place count 44 transition count 62
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 435 place count 44 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 436 place count 43 transition count 61
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 439 place count 43 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 440 place count 43 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 441 place count 42 transition count 60
Applied a total of 441 rules in 66 ms. Remains 42 /235 variables (removed 193) and now considering 60/307 (removed 247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 42/235 places, 60/307 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 42 cols
[2024-06-02 22:50:39] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 22:50:39] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:50:39] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:39] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:50:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:39] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:50:39] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-06-02 22:50:39] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 26 stable transitions
Graph (complete) has 434 edges and 235 vertex of which 231 are kept as prefixes of interest. Removing 4 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((G(F(p0)) U G(p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 219 transition count 289
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 219 transition count 289
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 209 transition count 276
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 209 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 209 transition count 275
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 206 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 206 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 204 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 204 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 204 transition count 268
Applied a total of 65 rules in 17 ms. Remains 204 /235 variables (removed 31) and now considering 268/307 (removed 39) transitions.
// Phase 1: matrix 268 rows 204 cols
[2024-06-02 22:50:39] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:50:39] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:50:39] [INFO ] Invariant cache hit.
[2024-06-02 22:50:39] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 22:50:39] [INFO ] Invariant cache hit.
[2024-06-02 22:50:39] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/235 places, 268/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 204/235 places, 268/307 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 339 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NOT (OR (EQ s24 0) (EQ s142 1))) (EQ s174 0) (EQ s138 1)), p0:(OR (EQ s24 0) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 68 reset in 221 ms.
Product exploration explored 100000 steps with 21 reset in 156 ms.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 385 edges and 204 vertex of which 201 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 22:50:41] [INFO ] Invariant cache hit.
[2024-06-02 22:50:41] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-06-02 22:50:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:41] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-06-02 22:50:41] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-06-02 22:50:41] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 211 edges and 204 vertex of which 2 / 204 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 383 edges and 203 vertex of which 187 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 187 transition count 172
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 151 place count 120 transition count 170
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 151 place count 120 transition count 147
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 197 place count 97 transition count 147
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 235 edges and 97 vertex of which 96 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 2 with 2 rules applied. Total rules applied 199 place count 96 transition count 146
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 201 place count 96 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 95 transition count 144
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 92 transition count 140
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 92 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 210 place count 92 transition count 138
Performed 31 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 272 place count 61 transition count 100
Drop transitions removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 281 place count 61 transition count 91
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 286 place count 56 transition count 86
Iterating global reduction 7 with 5 rules applied. Total rules applied 291 place count 56 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 292 place count 56 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 302 place count 51 transition count 80
Drop transitions removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 307 place count 51 transition count 75
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 310 place count 48 transition count 72
Iterating global reduction 9 with 3 rules applied. Total rules applied 313 place count 48 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 314 place count 48 transition count 71
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 315 place count 47 transition count 70
Iterating global reduction 10 with 1 rules applied. Total rules applied 316 place count 47 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 317 place count 47 transition count 69
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 11 with 2 rules applied. Total rules applied 319 place count 46 transition count 68
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 320 place count 46 transition count 67
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 321 place count 45 transition count 66
Iterating global reduction 12 with 1 rules applied. Total rules applied 322 place count 45 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 323 place count 45 transition count 65
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 18 rules applied. Total rules applied 341 place count 36 transition count 66
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 356 place count 36 transition count 51
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 364 place count 28 transition count 43
Iterating global reduction 14 with 8 rules applied. Total rules applied 372 place count 28 transition count 43
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 378 place count 28 transition count 37
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 15 with 2 rules applied. Total rules applied 380 place count 27 transition count 40
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 15 with 7 rules applied. Total rules applied 387 place count 27 transition count 33
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 388 place count 26 transition count 32
Iterating global reduction 15 with 1 rules applied. Total rules applied 389 place count 26 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 391 place count 26 transition count 30
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 398 place count 26 transition count 23
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 407 place count 19 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 408 place count 18 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 410 place count 16 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 414 place count 14 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 415 place count 14 transition count 17
Applied a total of 415 rules in 54 ms. Remains 14 /204 variables (removed 190) and now considering 17/268 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 14/204 places, 17/268 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Applied a total of 0 rules in 7 ms. Remains 204 /204 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 22:50:42] [INFO ] Invariant cache hit.
[2024-06-02 22:50:42] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:50:42] [INFO ] Invariant cache hit.
[2024-06-02 22:50:42] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 22:50:42] [INFO ] Invariant cache hit.
[2024-06-02 22:50:42] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 204/204 places, 268/268 transitions.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 385 edges and 204 vertex of which 201 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:50:42] [INFO ] Invariant cache hit.
[2024-06-02 22:50:42] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:50:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:42] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:50:42] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-06-02 22:50:43] [INFO ] After 132ms 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 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 211 edges and 204 vertex of which 2 / 204 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 383 edges and 203 vertex of which 187 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 187 transition count 172
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 151 place count 120 transition count 170
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 151 place count 120 transition count 147
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 197 place count 97 transition count 147
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 235 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 96 transition count 146
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 201 place count 96 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 95 transition count 144
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 92 transition count 140
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 92 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 210 place count 92 transition count 138
Performed 31 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 272 place count 61 transition count 100
Drop transitions removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 281 place count 61 transition count 91
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 286 place count 56 transition count 86
Iterating global reduction 7 with 5 rules applied. Total rules applied 291 place count 56 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 292 place count 56 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 302 place count 51 transition count 80
Drop transitions removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 307 place count 51 transition count 75
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 310 place count 48 transition count 72
Iterating global reduction 9 with 3 rules applied. Total rules applied 313 place count 48 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 314 place count 48 transition count 71
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 315 place count 47 transition count 70
Iterating global reduction 10 with 1 rules applied. Total rules applied 316 place count 47 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 317 place count 47 transition count 69
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 11 with 2 rules applied. Total rules applied 319 place count 46 transition count 68
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 320 place count 46 transition count 67
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 321 place count 45 transition count 66
Iterating global reduction 12 with 1 rules applied. Total rules applied 322 place count 45 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 323 place count 45 transition count 65
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 18 rules applied. Total rules applied 341 place count 36 transition count 66
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 356 place count 36 transition count 51
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 364 place count 28 transition count 43
Iterating global reduction 14 with 8 rules applied. Total rules applied 372 place count 28 transition count 43
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 378 place count 28 transition count 37
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 15 with 2 rules applied. Total rules applied 380 place count 27 transition count 40
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 15 with 7 rules applied. Total rules applied 387 place count 27 transition count 33
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 388 place count 26 transition count 32
Iterating global reduction 15 with 1 rules applied. Total rules applied 389 place count 26 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 391 place count 26 transition count 30
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 398 place count 26 transition count 23
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 407 place count 19 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 408 place count 18 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 410 place count 16 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 414 place count 14 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 415 place count 14 transition count 17
Applied a total of 415 rules in 22 ms. Remains 14 /204 variables (removed 190) and now considering 17/268 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 14/204 places, 17/268 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 97 reset in 107 ms.
Product exploration explored 100000 steps with 234 reset in 123 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 209 edges and 204 vertex of which 2 / 204 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 384 edges and 203 vertex of which 200 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 200 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 200 transition count 262
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 70 place count 200 transition count 280
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 90 place count 200 transition count 280
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 185 transition count 265
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 185 transition count 265
Performed 31 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 151 place count 185 transition count 281
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 185 transition count 276
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 175 place count 166 transition count 255
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 194 place count 166 transition count 255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 166 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 197 place count 166 transition count 253
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 164 transition count 251
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 164 transition count 251
Performed 23 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 224 place count 164 transition count 374
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 242 place count 164 transition count 356
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 288 place count 118 transition count 223
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 5 with 46 rules applied. Total rules applied 334 place count 118 transition count 223
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 343 place count 118 transition count 214
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 370 place count 91 transition count 166
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 6 with 27 rules applied. Total rules applied 397 place count 91 transition count 166
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 402 place count 91 transition count 161
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 408 place count 85 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 414 place count 85 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 433 place count 85 transition count 130
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 434 place count 84 transition count 129
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 435 place count 84 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 436 place count 84 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 436 rules in 47 ms. Remains 84 /204 variables (removed 120) and now considering 149/268 (removed 119) transitions.
[2024-06-02 22:50:44] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 22:50:44] [INFO ] Flow matrix only has 146 transitions (discarded 3 similar events)
// Phase 1: matrix 146 rows 84 cols
[2024-06-02 22:50:44] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 22:50:44] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/204 places, 149/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 84/204 places, 149/268 transitions.
Built C files in :
/tmp/ltsmin14079570812012807705
[2024-06-02 22:50:44] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14079570812012807705
Running compilation step : cd /tmp/ltsmin14079570812012807705;'/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 445 ms.
Running link step : cd /tmp/ltsmin14079570812012807705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14079570812012807705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12018087019023852108.hoa' '--buchi-type=spotba'
LTSmin run took 109 ms.
FORMULA CO4-PT-08-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLCardinality-00 finished in 5576 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 X(!p1)))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 217 transition count 284
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 217 transition count 284
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 208 transition count 273
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 208 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 204 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 204 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 204 transition count 267
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 202 transition count 265
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 202 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 202 transition count 263
Applied a total of 70 rules in 12 ms. Remains 202 /235 variables (removed 33) and now considering 263/307 (removed 44) transitions.
// Phase 1: matrix 263 rows 202 cols
[2024-06-02 22:50:45] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:50:45] [INFO ] Implicit Places using invariants in 58 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/235 places, 263/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 201/235 places, 263/307 transitions.
Stuttering acceptance computed with spot in 108 ms :[p1, true, p1, p1]
Running random walk in product with property : CO4-PT-08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s165 1) (NEQ s136 0)), p1:(OR (EQ s36 0) (EQ s165 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 29 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-02 finished in 199 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((G(p0)||G(F(p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 218 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 218 transition count 285
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 208 transition count 273
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 208 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 204 transition count 268
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 204 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 204 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 202 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 202 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 202 transition count 263
Applied a total of 70 rules in 10 ms. Remains 202 /235 variables (removed 33) and now considering 263/307 (removed 44) transitions.
// Phase 1: matrix 263 rows 202 cols
[2024-06-02 22:50:45] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:50:45] [INFO ] Implicit Places using invariants in 62 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/235 places, 263/307 transitions.
Applied a total of 0 rules in 1 ms. Remains 201 /201 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 201/235 places, 263/307 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s190 0) (EQ s183 1)), p1:(AND (EQ s185 0) (EQ s178 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-04 finished in 254 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(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U X(X((G(p2)||F(G(p1)))))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 219 transition count 286
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 219 transition count 286
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 210 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 210 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 210 transition count 275
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 208 transition count 273
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 208 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 207 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 207 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 207 transition count 270
Applied a total of 59 rules in 10 ms. Remains 207 /235 variables (removed 28) and now considering 270/307 (removed 37) transitions.
// Phase 1: matrix 270 rows 207 cols
[2024-06-02 22:50:45] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 22:50:45] [INFO ] Implicit Places using invariants in 55 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 206/235 places, 270/307 transitions.
Applied a total of 0 rules in 1 ms. Remains 206 /206 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 206/235 places, 270/307 transitions.
Stuttering acceptance computed with spot in 465 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 7}, { cond=p1, acceptance={} source=2 dest: 8}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 3}], [{ cond=p1, acceptance={} source=6 dest: 2}, { cond=true, acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 4}], [{ cond=p2, acceptance={} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}, { cond=(NOT p2), acceptance={} source=8 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 10}], [{ cond=p0, acceptance={} source=9 dest: 4}], [{ cond=true, acceptance={} source=10 dest: 9}, { cond=p1, acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(OR (EQ s172 0) (EQ s106 1)), p0:(OR (EQ s28 0) (EQ s38 1)), p2:(EQ s75 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 72 ms.
Stack based approach found an accepted trace after 121 steps with 3 reset with depth 31 and stack size 31 in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-08-LTLCardinality-05 finished in 642 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(F(!p0))||(F(!p0)&&X(!p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 219 transition count 286
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 219 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 212 transition count 278
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 212 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 209 transition count 275
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 209 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 209 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 208 transition count 273
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 208 transition count 272
Applied a total of 56 rules in 13 ms. Remains 208 /235 variables (removed 27) and now considering 272/307 (removed 35) transitions.
// Phase 1: matrix 272 rows 208 cols
[2024-06-02 22:50:46] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:50:46] [INFO ] Implicit Places using invariants in 53 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 207/235 places, 272/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 207/235 places, 272/307 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : CO4-PT-08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s170 0) (EQ s144 1)), p1:(OR (EQ s91 0) (EQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-10 finished in 215 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((F(p0)||G(p1))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 217 transition count 285
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 217 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 207 transition count 273
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 207 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 207 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 203 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 203 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 203 transition count 267
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 201 transition count 265
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 201 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 201 transition count 263
Applied a total of 72 rules in 18 ms. Remains 201 /235 variables (removed 34) and now considering 263/307 (removed 44) transitions.
// Phase 1: matrix 263 rows 201 cols
[2024-06-02 22:50:46] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:50:46] [INFO ] Implicit Places using invariants in 57 ms returned [137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/235 places, 263/307 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 200/235 places, 263/307 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), 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 s144 0), p1:(OR (EQ s132 0) (EQ s95 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 186 ms.
Product exploration explored 100000 steps with 25000 reset in 177 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 360 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 156 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 263 rows 200 cols
[2024-06-02 22:50:47] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 22:50:47] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:50:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:47] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:50:47] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-06-02 22:50:47] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 33 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-02 22:50:48] [INFO ] Invariant cache hit.
[2024-06-02 22:50:48] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:50:48] [INFO ] Invariant cache hit.
[2024-06-02 22:50:48] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-02 22:50:48] [INFO ] Invariant cache hit.
[2024-06-02 22:50:48] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 200/200 places, 263/263 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 360 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1059 steps, run visited all 3 properties in 18 ms. (steps per millisecond=58 )
Probabilistic random walk after 1059 steps, saw 741 distinct states, run finished after 18 ms. (steps per millisecond=58 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 127 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 263/263 transitions.
Graph (trivial) has 207 edges and 200 vertex of which 2 / 200 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 359 edges and 199 vertex of which 196 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
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 196 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 196 transition count 257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 69 place count 196 transition count 276
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 89 place count 196 transition count 276
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 105 place count 180 transition count 260
Deduced a syphon composed of 69 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 121 place count 180 transition count 260
Performed 31 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 152 place count 180 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 158 place count 180 transition count 275
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 174 place count 164 transition count 257
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 190 place count 164 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 164 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 164 transition count 255
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 196 place count 161 transition count 252
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 199 place count 161 transition count 252
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 222 place count 161 transition count 343
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 244 place count 161 transition count 321
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 289 place count 116 transition count 217
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 5 with 45 rules applied. Total rules applied 334 place count 116 transition count 217
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 344 place count 116 transition count 207
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 373 place count 87 transition count 153
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 402 place count 87 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 405 place count 87 transition count 150
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 411 place count 81 transition count 138
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 417 place count 81 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 418 place count 81 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 421 place count 81 transition count 150
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 424 place count 78 transition count 132
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 427 place count 78 transition count 132
Deduced a syphon composed of 39 places in 0 ms
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 437 place count 78 transition count 122
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 437 rules in 35 ms. Remains 78 /200 variables (removed 122) and now considering 122/263 (removed 141) transitions.
[2024-06-02 22:50:50] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:50:50] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
// Phase 1: matrix 118 rows 78 cols
[2024-06-02 22:50:50] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:50:50] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/200 places, 122/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 78/200 places, 122/263 transitions.
Built C files in :
/tmp/ltsmin17479915328430072127
[2024-06-02 22:50:50] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17479915328430072127
Running compilation step : cd /tmp/ltsmin17479915328430072127;'/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 343 ms.
Running link step : cd /tmp/ltsmin17479915328430072127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17479915328430072127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17495265011225656826.hoa' '--buchi-type=spotba'
LTSmin run took 183 ms.
FORMULA CO4-PT-08-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLCardinality-12 finished in 4499 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((p0||F(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 217 transition count 284
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 217 transition count 284
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 207 transition count 272
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 207 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 207 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 203 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 203 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 203 transition count 266
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 201 transition count 264
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 201 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 201 transition count 262
Applied a total of 72 rules in 9 ms. Remains 201 /235 variables (removed 34) and now considering 262/307 (removed 45) transitions.
// Phase 1: matrix 262 rows 201 cols
[2024-06-02 22:50:50] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:50:50] [INFO ] Implicit Places using invariants in 64 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/235 places, 262/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 200/235 places, 262/307 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s91 1), p0:(EQ s122 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][false, false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-13 finished in 196 ms.
All properties solved by simple procedures.
Total runtime 14789 ms.

BK_STOP 1717368652698

--------------------
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="CO4-PT-08"
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-08, 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-171734910100037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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