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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 191K 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-13-LTLFireability-00
FORMULA_NAME CO4-PT-13-LTLFireability-01
FORMULA_NAME CO4-PT-13-LTLFireability-02
FORMULA_NAME CO4-PT-13-LTLFireability-03
FORMULA_NAME CO4-PT-13-LTLFireability-04
FORMULA_NAME CO4-PT-13-LTLFireability-05
FORMULA_NAME CO4-PT-13-LTLFireability-06
FORMULA_NAME CO4-PT-13-LTLFireability-07
FORMULA_NAME CO4-PT-13-LTLFireability-08
FORMULA_NAME CO4-PT-13-LTLFireability-09
FORMULA_NAME CO4-PT-13-LTLFireability-10
FORMULA_NAME CO4-PT-13-LTLFireability-11
FORMULA_NAME CO4-PT-13-LTLFireability-12
FORMULA_NAME CO4-PT-13-LTLFireability-13
FORMULA_NAME CO4-PT-13-LTLFireability-14
FORMULA_NAME CO4-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368716895

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-13
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:51:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:51:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:58] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 22:51:58] [INFO ] Transformed 649 places.
[2024-06-02 22:51:58] [INFO ] Transformed 816 transitions.
[2024-06-02 22:51:58] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:58] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 172 places in 11 ms
Reduce places removed 172 places and 227 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-13-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 589/589 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 585
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 103 place count 378 transition count 500
Iterating global reduction 1 with 83 rules applied. Total rules applied 186 place count 378 transition count 500
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 252 place count 312 transition count 424
Iterating global reduction 1 with 66 rules applied. Total rules applied 318 place count 312 transition count 424
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 324 place count 312 transition count 418
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 356 place count 280 transition count 381
Iterating global reduction 2 with 32 rules applied. Total rules applied 388 place count 280 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 390 place count 280 transition count 379
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 411 place count 259 transition count 357
Iterating global reduction 3 with 21 rules applied. Total rules applied 432 place count 259 transition count 357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 438 place count 259 transition count 351
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 444 place count 253 transition count 345
Iterating global reduction 4 with 6 rules applied. Total rules applied 450 place count 253 transition count 345
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 452 place count 251 transition count 343
Iterating global reduction 4 with 2 rules applied. Total rules applied 454 place count 251 transition count 343
Applied a total of 454 rules in 116 ms. Remains 251 /477 variables (removed 226) and now considering 343/589 (removed 246) transitions.
// Phase 1: matrix 343 rows 251 cols
[2024-06-02 22:51:59] [INFO ] Computed 6 invariants in 17 ms
[2024-06-02 22:51:59] [INFO ] Implicit Places using invariants in 194 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 522 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 250/477 places, 343/589 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 643 ms. Remains : 250/477 places, 343/589 transitions.
Support contains 19 out of 250 places after structural reductions.
[2024-06-02 22:51:59] [INFO ] Flatten gal took : 51 ms
[2024-06-02 22:51:59] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:51:59] [INFO ] Input system was already deterministic with 343 transitions.
Support contains 18 out of 250 places (down from 19) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 343 rows 250 cols
[2024-06-02 22:52:00] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:52:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:00] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 22:52:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:00] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-06-02 22:52:01] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 7 ms to minimize.
[2024-06-02 22:52:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 71 ms
[2024-06-02 22:52:01] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-06-02 22:52:01] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 66 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 2 properties in 20 ms.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 343/343 transitions.
Graph (trivial) has 255 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 545 edges and 248 vertex of which 234 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 114 rules applied. Total rules applied 116 place count 234 transition count 214
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 214 place count 137 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 136 transition count 213
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 215 place count 136 transition count 193
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 255 place count 116 transition count 193
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 261 place count 110 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 110 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 110 transition count 180
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 270 place count 108 transition count 178
Iterating global reduction 4 with 2 rules applied. Total rules applied 272 place count 108 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 108 transition count 177
Performed 42 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 357 place count 66 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 361 place count 66 transition count 119
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 365 place count 62 transition count 113
Iterating global reduction 6 with 4 rules applied. Total rules applied 369 place count 62 transition count 113
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 6 with 4 rules applied. Total rules applied 373 place count 60 transition count 111
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 206 edges and 60 vertex of which 59 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 6 with 3 rules applied. Total rules applied 376 place count 59 transition count 109
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 408 place count 43 transition count 127
Drop transitions removed 32 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 7 with 39 rules applied. Total rules applied 447 place count 43 transition count 88
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 459 place count 31 transition count 64
Iterating global reduction 8 with 12 rules applied. Total rules applied 471 place count 31 transition count 64
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 478 place count 31 transition count 57
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 481 place count 28 transition count 45
Iterating global reduction 9 with 3 rules applied. Total rules applied 484 place count 28 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 486 place count 28 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 488 place count 28 transition count 41
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 489 place count 27 transition count 39
Iterating global reduction 10 with 1 rules applied. Total rules applied 490 place count 27 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 491 place count 27 transition count 38
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 498 place count 27 transition count 31
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 506 place count 20 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 507 place count 19 transition count 29
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 510 place count 17 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 512 place count 17 transition count 26
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 515 place count 17 transition count 23
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 518 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 520 place count 14 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 521 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 522 place count 13 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 524 place count 13 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 525 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 528 place count 12 transition count 15
Applied a total of 528 rules in 52 ms. Remains 12 /250 variables (removed 238) and now considering 15/343 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 12/250 places, 15/343 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 20 stabilizing places and 31 stable transitions
Graph (complete) has 548 edges and 250 vertex of which 245 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Graph (trivial) has 256 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 546 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 242 transition count 242
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 186 place count 150 transition count 242
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 186 place count 150 transition count 221
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 228 place count 129 transition count 221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 123 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 123 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 240 place count 123 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 122 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 244 place count 120 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 120 transition count 205
Performed 42 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 330 place count 78 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 334 place count 78 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 338 place count 74 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 342 place count 74 transition count 139
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 378 place count 56 transition count 159
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 387 place count 56 transition count 150
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 398 place count 45 transition count 106
Iterating global reduction 4 with 11 rules applied. Total rules applied 409 place count 45 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 417 place count 45 transition count 98
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 420 place count 42 transition count 80
Iterating global reduction 5 with 3 rules applied. Total rules applied 423 place count 42 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 425 place count 42 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 429 place count 40 transition count 94
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 455 place count 40 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 457 place count 38 transition count 66
Applied a total of 457 rules in 45 ms. Remains 38 /250 variables (removed 212) and now considering 66/343 (removed 277) transitions.
[2024-06-02 22:52:01] [INFO ] Flow matrix only has 54 transitions (discarded 12 similar events)
// Phase 1: matrix 54 rows 38 cols
[2024-06-02 22:52:01] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:52:01] [INFO ] Implicit Places using invariants in 51 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/250 places, 66/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 37/250 places, 66/343 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 181 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CO4-PT-13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s16 1), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA CO4-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-02 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||X(X(p1))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 243 transition count 331
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 243 transition count 331
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 238 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 238 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 237 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 237 transition count 324
Applied a total of 26 rules in 18 ms. Remains 237 /250 variables (removed 13) and now considering 324/343 (removed 19) transitions.
// Phase 1: matrix 324 rows 237 cols
[2024-06-02 22:52:01] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:52:01] [INFO ] Implicit Places using invariants in 69 ms returned [173]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/250 places, 324/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 236 /236 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 236/250 places, 324/343 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s77 1), p0:(AND (EQ s138 1) (EQ s171 1) (EQ s199 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 2 ms.
FORMULA CO4-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-03 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(X(F(p1))))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 242 transition count 329
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 242 transition count 329
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 237 transition count 324
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 237 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 236 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 236 transition count 322
Applied a total of 28 rules in 18 ms. Remains 236 /250 variables (removed 14) and now considering 322/343 (removed 21) transitions.
// Phase 1: matrix 322 rows 236 cols
[2024-06-02 22:52:02] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:52:02] [INFO ] Implicit Places using invariants in 67 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 322/343 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 235/250 places, 322/343 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s111 0), p1:(AND (EQ s170 1) (EQ s196 1) (EQ s230 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]]
Product exploration explored 100000 steps with 33360 reset in 311 ms.
Product exploration explored 100000 steps with 33147 reset in 221 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 490 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Finished Best-First random walk after 127 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=127 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 322/322 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 235 cols
[2024-06-02 22:52:03] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:52:03] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 22:52:03] [INFO ] Invariant cache hit.
[2024-06-02 22:52:03] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 22:52:03] [INFO ] Invariant cache hit.
[2024-06-02 22:52:04] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 235/235 places, 322/322 transitions.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 490 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 100 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Finished Best-First random walk after 7799 steps, including 56 resets, run visited all 2 properties in 10 ms. (steps per millisecond=779 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33421 reset in 184 ms.
Product exploration explored 100000 steps with 33275 reset in 178 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 322/322 transitions.
Graph (trivial) has 244 edges and 235 vertex of which 3 / 235 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 488 edges and 233 vertex of which 228 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 228 transition count 314
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 88 place count 228 transition count 316
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 228 transition count 316
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 115 place count 204 transition count 292
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 139 place count 204 transition count 292
Performed 51 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 190 place count 204 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 200 place count 204 transition count 307
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 246 place count 158 transition count 259
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 292 place count 158 transition count 259
Performed 28 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 320 place count 158 transition count 403
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 346 place count 158 transition count 377
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 391 place count 113 transition count 251
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 45 rules applied. Total rules applied 436 place count 113 transition count 251
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 453 place count 113 transition count 234
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 480 place count 86 transition count 177
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 4 with 27 rules applied. Total rules applied 507 place count 86 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 510 place count 86 transition count 174
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 516 place count 80 transition count 162
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 522 place count 80 transition count 162
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 525 place count 80 transition count 198
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 529 place count 76 transition count 182
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 533 place count 76 transition count 182
Deduced a syphon composed of 37 places in 0 ms
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 5 with 33 rules applied. Total rules applied 566 place count 76 transition count 149
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 566 rules in 60 ms. Remains 76 /235 variables (removed 159) and now considering 149/322 (removed 173) transitions.
[2024-06-02 22:52:05] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 22:52:05] [INFO ] Flow matrix only has 134 transitions (discarded 15 similar events)
// Phase 1: matrix 134 rows 76 cols
[2024-06-02 22:52:05] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:52:05] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/235 places, 149/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 76/235 places, 149/322 transitions.
Built C files in :
/tmp/ltsmin2452262265609342517
[2024-06-02 22:52:05] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2452262265609342517
Running compilation step : cd /tmp/ltsmin2452262265609342517;'/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 518 ms.
Running link step : cd /tmp/ltsmin2452262265609342517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2452262265609342517;'/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/stateBased990764036284913320.hoa' '--buchi-type=spotba'
LTSmin run took 1074 ms.
FORMULA CO4-PT-13-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-13-LTLFireability-06 finished in 5499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&(p1||G(p2))))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 243 transition count 330
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 243 transition count 330
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 239 transition count 326
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 239 transition count 326
Applied a total of 22 rules in 15 ms. Remains 239 /250 variables (removed 11) and now considering 326/343 (removed 17) transitions.
// Phase 1: matrix 326 rows 239 cols
[2024-06-02 22:52:07] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 22:52:07] [INFO ] Implicit Places using invariants in 67 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/250 places, 326/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 238/250 places, 326/343 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-13-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR p1 p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(OR p1 p2), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p1 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=8 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s126 1) (EQ s42 1)), p2:(EQ s126 1), p0:(EQ s73 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-09 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 243 transition count 330
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 243 transition count 330
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 239 transition count 326
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 239 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 238 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 238 transition count 324
Applied a total of 24 rules in 16 ms. Remains 238 /250 variables (removed 12) and now considering 324/343 (removed 19) transitions.
// Phase 1: matrix 324 rows 238 cols
[2024-06-02 22:52:08] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:52:08] [INFO ] Implicit Places using invariants in 67 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/250 places, 324/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 237/250 places, 324/343 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s226 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][false, false]]
Product exploration explored 100000 steps with 7047 reset in 126 ms.
Stack based approach found an accepted trace after 30439 steps with 2139 reset with depth 22 and stack size 22 in 57 ms.
FORMULA CO4-PT-13-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-13-LTLFireability-10 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Graph (trivial) has 254 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 546 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 242 transition count 243
Reduce places removed 91 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 151 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 188 place count 149 transition count 241
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 188 place count 149 transition count 220
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 230 place count 128 transition count 220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 233 place count 125 transition count 216
Iterating global reduction 3 with 3 rules applied. Total rules applied 236 place count 125 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 237 place count 124 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 124 transition count 214
Performed 45 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 328 place count 79 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 332 place count 79 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 336 place count 75 transition count 142
Iterating global reduction 4 with 4 rules applied. Total rules applied 340 place count 75 transition count 142
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 376 place count 57 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 385 place count 57 transition count 154
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 396 place count 46 transition count 110
Iterating global reduction 5 with 11 rules applied. Total rules applied 407 place count 46 transition count 110
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 414 place count 46 transition count 103
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 417 place count 43 transition count 85
Iterating global reduction 6 with 3 rules applied. Total rules applied 420 place count 43 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 422 place count 43 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 426 place count 41 transition count 101
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 454 place count 41 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 456 place count 39 transition count 71
Applied a total of 456 rules in 32 ms. Remains 39 /250 variables (removed 211) and now considering 71/343 (removed 272) transitions.
[2024-06-02 22:52:08] [INFO ] Flow matrix only has 58 transitions (discarded 13 similar events)
// Phase 1: matrix 58 rows 39 cols
[2024-06-02 22:52:08] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:52:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 22:52:08] [INFO ] Flow matrix only has 58 transitions (discarded 13 similar events)
[2024-06-02 22:52:08] [INFO ] Invariant cache hit.
[2024-06-02 22:52:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:52:08] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-02 22:52:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:52:08] [INFO ] Flow matrix only has 58 transitions (discarded 13 similar events)
[2024-06-02 22:52:08] [INFO ] Invariant cache hit.
[2024-06-02 22:52:08] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/250 places, 71/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 39/250 places, 71/343 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-13-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s17 1) (EQ s28 1)), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-11 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Graph (trivial) has 256 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 546 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 242 transition count 242
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 186 place count 150 transition count 242
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 186 place count 150 transition count 221
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 228 place count 129 transition count 221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 123 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 123 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 240 place count 123 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 122 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 244 place count 120 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 120 transition count 205
Performed 44 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 334 place count 76 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 338 place count 76 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 342 place count 72 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 346 place count 72 transition count 136
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 382 place count 54 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 390 place count 54 transition count 148
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 401 place count 43 transition count 104
Iterating global reduction 4 with 11 rules applied. Total rules applied 412 place count 43 transition count 104
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 419 place count 43 transition count 97
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 422 place count 40 transition count 79
Iterating global reduction 5 with 3 rules applied. Total rules applied 425 place count 40 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 427 place count 40 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 431 place count 38 transition count 93
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 457 place count 38 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 459 place count 36 transition count 65
Applied a total of 459 rules in 27 ms. Remains 36 /250 variables (removed 214) and now considering 65/343 (removed 278) transitions.
[2024-06-02 22:52:08] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
// Phase 1: matrix 53 rows 36 cols
[2024-06-02 22:52:08] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 22:52:08] [INFO ] Implicit Places using invariants in 31 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/250 places, 65/343 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 35/250 places, 65/343 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25 reset in 122 ms.
Product exploration explored 100000 steps with 48 reset in 65 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 340 steps, including 41 resets, run visited all 1 properties in 5 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 35 /35 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-02 22:52:09] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
// Phase 1: matrix 53 rows 35 cols
[2024-06-02 22:52:09] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:52:09] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2024-06-02 22:52:09] [INFO ] Invariant cache hit.
[2024-06-02 22:52:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:52:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-02 22:52:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:52:09] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2024-06-02 22:52:09] [INFO ] Invariant cache hit.
[2024-06-02 22:52:09] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 35/35 places, 65/65 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 102 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 95 reset in 34 ms.
Product exploration explored 100000 steps with 3 reset in 39 ms.
Built C files in :
/tmp/ltsmin17891221695239998261
[2024-06-02 22:52:10] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2024-06-02 22:52:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:52:10] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2024-06-02 22:52:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:52:10] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2024-06-02 22:52:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:52:10] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17891221695239998261
Running compilation step : cd /tmp/ltsmin17891221695239998261;'/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 150 ms.
Running link step : cd /tmp/ltsmin17891221695239998261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17891221695239998261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13701390250502800827.hoa' '--buchi-type=spotba'
LTSmin run took 88 ms.
FORMULA CO4-PT-13-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-13-LTLFireability-12 finished in 1838 ms.
All properties solved by simple procedures.
Total runtime 12284 ms.

BK_STOP 1717368731697

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-13"
export BK_EXAMINATION="LTLFireability"
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-13, examination is LTLFireability"
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-171734910100063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-13.tgz
mv CO4-PT-13 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;