Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575700043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575700043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.6K Apr 29 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 241K May 10 09: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 FlexibleBarrier-PT-08b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652614784348

Running Version 202205111006
[2022-05-15 11:39:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 11:39:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 11:39:46] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2022-05-15 11:39:46] [INFO ] Transformed 920 places.
[2022-05-15 11:39:46] [INFO ] Transformed 1057 transitions.
[2022-05-15 11:39:46] [INFO ] Found NUPN structural information;
[2022-05-15 11:39:46] [INFO ] Parsed PT model containing 920 places and 1057 transitions in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 316 places :
Symmetric choice reduction at 0 with 316 rule applications. Total rules 316 place count 604 transition count 741
Iterating global reduction 0 with 316 rules applied. Total rules applied 632 place count 604 transition count 741
Discarding 136 places :
Symmetric choice reduction at 0 with 136 rule applications. Total rules 768 place count 468 transition count 605
Iterating global reduction 0 with 136 rules applied. Total rules applied 904 place count 468 transition count 605
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 980 place count 392 transition count 529
Iterating global reduction 0 with 76 rules applied. Total rules applied 1056 place count 392 transition count 529
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 1086 place count 392 transition count 499
Applied a total of 1086 rules in 188 ms. Remains 392 /920 variables (removed 528) and now considering 499/1057 (removed 558) transitions.
// Phase 1: matrix 499 rows 392 cols
[2022-05-15 11:39:47] [INFO ] Computed 10 place invariants in 34 ms
[2022-05-15 11:39:47] [INFO ] Implicit Places using invariants in 472 ms returned []
// Phase 1: matrix 499 rows 392 cols
[2022-05-15 11:39:47] [INFO ] Computed 10 place invariants in 10 ms
[2022-05-15 11:39:48] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
// Phase 1: matrix 499 rows 392 cols
[2022-05-15 11:39:48] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-15 11:39:48] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/920 places, 499/1057 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/920 places, 499/1057 transitions.
Support contains 40 out of 392 places after structural reductions.
[2022-05-15 11:39:49] [INFO ] Flatten gal took : 110 ms
[2022-05-15 11:39:49] [INFO ] Flatten gal took : 50 ms
[2022-05-15 11:39:49] [INFO ] Input system was already deterministic with 499 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 1027 ms. (steps per millisecond=9 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 499 rows 392 cols
[2022-05-15 11:39:50] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:39:50] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-15 11:39:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-15 11:39:51] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2022-05-15 11:39:52] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 9 ms to minimize.
[2022-05-15 11:39:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-15 11:39:52] [INFO ] Deduced a trap composed of 94 places in 244 ms of which 3 ms to minimize.
[2022-05-15 11:39:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2022-05-15 11:39:53] [INFO ] After 1693ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 352 ms.
[2022-05-15 11:39:53] [INFO ] After 2639ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 7 properties in 234 ms.
Support contains 13 out of 392 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 392/392 places, 499/499 transitions.
Graph (trivial) has 344 edges and 392 vertex of which 43 / 392 are part of one of the 7 SCC in 5 ms
Free SCC test removed 36 places
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 356 transition count 416
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 317 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 316 transition count 415
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 81 place count 316 transition count 391
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 129 place count 292 transition count 391
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 161 place count 260 transition count 359
Iterating global reduction 3 with 32 rules applied. Total rules applied 193 place count 260 transition count 359
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 193 place count 260 transition count 357
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 197 place count 258 transition count 357
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 204 place count 251 transition count 350
Iterating global reduction 3 with 7 rules applied. Total rules applied 211 place count 251 transition count 350
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 217 place count 251 transition count 344
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 327 place count 196 transition count 289
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 342 place count 196 transition count 274
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 355 place count 183 transition count 261
Iterating global reduction 5 with 13 rules applied. Total rules applied 368 place count 183 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 373 place count 183 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 375 place count 182 transition count 263
Free-agglomeration rule applied 118 times.
Iterating global reduction 6 with 118 rules applied. Total rules applied 493 place count 182 transition count 145
Reduce places removed 118 places and 0 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 151 rules applied. Total rules applied 644 place count 64 transition count 112
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 647 place count 64 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 648 place count 63 transition count 108
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 41 edges and 62 vertex of which 14 / 62 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 650 place count 55 transition count 108
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 664 place count 55 transition count 94
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 664 place count 55 transition count 86
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 680 place count 47 transition count 86
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 688 place count 47 transition count 78
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 706 place count 38 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 708 place count 37 transition count 69
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 710 place count 37 transition count 67
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 717 place count 37 transition count 60
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 739 place count 27 transition count 48
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 748 place count 27 transition count 39
Applied a total of 748 rules in 168 ms. Remains 27 /392 variables (removed 365) and now considering 39/499 (removed 460) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/392 places, 39/499 transitions.
Finished random walk after 191 steps, including 0 resets, run visited all 8 properties in 7 ms. (steps per millisecond=27 )
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G((G(p0) U p0))||F(p1)) U !p2))'
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 499/499 transitions.
Graph (trivial) has 357 edges and 392 vertex of which 49 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 350 transition count 411
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 305 transition count 411
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 91 place count 305 transition count 389
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 135 place count 283 transition count 389
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 174 place count 244 transition count 350
Iterating global reduction 2 with 39 rules applied. Total rules applied 213 place count 244 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 213 place count 244 transition count 349
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 243 transition count 349
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 223 place count 235 transition count 341
Iterating global reduction 2 with 8 rules applied. Total rules applied 231 place count 235 transition count 341
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 237 place count 235 transition count 335
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 333 place count 187 transition count 287
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 344 place count 176 transition count 276
Iterating global reduction 3 with 11 rules applied. Total rules applied 355 place count 176 transition count 276
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 366 place count 176 transition count 265
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 374 place count 176 transition count 257
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 375 place count 176 transition count 257
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 377 place count 174 transition count 255
Applied a total of 377 rules in 153 ms. Remains 174 /392 variables (removed 218) and now considering 255/499 (removed 244) transitions.
[2022-05-15 11:39:54] [INFO ] Flow matrix only has 240 transitions (discarded 15 similar events)
// Phase 1: matrix 240 rows 174 cols
[2022-05-15 11:39:54] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:39:54] [INFO ] Implicit Places using invariants in 198 ms returned []
[2022-05-15 11:39:54] [INFO ] Flow matrix only has 240 transitions (discarded 15 similar events)
// Phase 1: matrix 240 rows 174 cols
[2022-05-15 11:39:54] [INFO ] Computed 10 place invariants in 12 ms
[2022-05-15 11:39:55] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2022-05-15 11:39:55] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-15 11:39:55] [INFO ] Flow matrix only has 240 transitions (discarded 15 similar events)
// Phase 1: matrix 240 rows 174 cols
[2022-05-15 11:39:55] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:39:55] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/392 places, 255/499 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/392 places, 255/499 transitions.
Stuttering acceptance computed with spot in 518 ms :[true, (OR p0 p1), (AND p1 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), p1, (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=5, aps=[p1:(OR (EQ s167 0) (EQ s61 1)), p0:(OR (EQ s171 0) (EQ s29 1)), p2:(OR (EQ s44 0) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 38504 steps with 2263 reset in 467 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-01 finished in 2353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((G((X(X(p0))&&p1))&&(p2 U p3)&&p4)))))'
Support contains 9 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 499/499 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 366 transition count 473
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 366 transition count 473
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 69 place count 349 transition count 456
Iterating global reduction 0 with 17 rules applied. Total rules applied 86 place count 349 transition count 456
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 94 place count 349 transition count 448
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 342 transition count 441
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 342 transition count 441
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 114 place count 342 transition count 435
Applied a total of 114 rules in 43 ms. Remains 342 /392 variables (removed 50) and now considering 435/499 (removed 64) transitions.
// Phase 1: matrix 435 rows 342 cols
[2022-05-15 11:39:56] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:39:56] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 435 rows 342 cols
[2022-05-15 11:39:56] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:39:57] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
// Phase 1: matrix 435 rows 342 cols
[2022-05-15 11:39:57] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:39:57] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 342/392 places, 435/499 transitions.
Finished structural reductions, in 1 iterations. Remains : 342/392 places, 435/499 transitions.
Stuttering acceptance computed with spot in 772 ms :[(OR (NOT p3) (NOT p1) (NOT p4) (NOT p0)), (OR (NOT p3) (NOT p1) (NOT p4) (NOT p0)), (OR (NOT p3) (NOT p1) (NOT p4) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p4) (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p4 p1 p3) (AND p4 p1 p2)), acceptance={0} source=2 dest: 3}, { cond=(OR (AND p4 p1 p3) (AND p4 p1 p2)), acceptance={} source=2 dest: 4}, { cond=(AND p4 p1 (NOT p3) p2), acceptance={0} source=2 dest: 5}], [{ cond=(OR (NOT p4) (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 6}, { cond=(OR (AND p4 p1 p3) (AND p4 p1 p2)), acceptance={0} source=3 dest: 7}, { cond=(OR (AND p4 p1 p3) (AND p4 p1 p2)), acceptance={} source=3 dest: 8}, { cond=(AND p4 p1 (NOT p3) p2), acceptance={0} source=3 dest: 9}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p4) (NOT p0)) (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0} source=6 dest: 2}, { cond=(OR (AND p4 p1 p3 (NOT p0)) (AND p4 p1 p2 (NOT p0))), acceptance={0} source=6 dest: 3}, { cond=(OR (AND p4 p1 p3 (NOT p0)) (AND p4 p1 p2 (NOT p0))), acceptance={} source=6 dest: 4}, { cond=(AND p4 p1 (NOT p3) p2 (NOT p0)), acceptance={0} source=6 dest: 5}], [{ cond=(OR (AND (NOT p4) (NOT p0)) (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p4 p1 p3 (NOT p0)) (AND p4 p1 p2 (NOT p0))), acceptance={0} source=7 dest: 7}, { cond=(OR (AND p4 p1 p3 (NOT p0)) (AND p4 p1 p2 (NOT p0))), acceptance={} source=7 dest: 8}, { cond=(AND p4 p1 (NOT p3) p2 (NOT p0)), acceptance={0} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=8 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=9 dest: 5}]], initial=0, aps=[p4:(OR (EQ s102 0) (EQ s123 1)), p1:(OR (EQ s182 0) (EQ s19 1)), p3:(EQ s54 1), p2:(OR (EQ s255 0) (EQ s328 1)), p0:(OR (EQ s220 0) (EQ s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 2 reset in 3 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-03 finished in 1902 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!X(G(F(!p0))) U X(p1))))'
Support contains 5 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 499/499 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 362 transition count 469
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 362 transition count 469
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 81 place count 341 transition count 448
Iterating global reduction 0 with 21 rules applied. Total rules applied 102 place count 341 transition count 448
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 115 place count 341 transition count 435
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 120 place count 336 transition count 430
Iterating global reduction 1 with 5 rules applied. Total rules applied 125 place count 336 transition count 430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 129 place count 336 transition count 426
Applied a total of 129 rules in 60 ms. Remains 336 /392 variables (removed 56) and now considering 426/499 (removed 73) transitions.
// Phase 1: matrix 426 rows 336 cols
[2022-05-15 11:39:58] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:39:58] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 426 rows 336 cols
[2022-05-15 11:39:58] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:39:59] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 336 cols
[2022-05-15 11:39:59] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:39:59] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/392 places, 426/499 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/392 places, 426/499 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s73 0) (EQ s222 1)), p0:(AND (EQ s285 1) (NOT (OR (EQ s114 0) (EQ s38 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3752 steps with 58 reset in 15 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-06 finished in 1193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(p1)||p0) U (G(!p1)&&p2)))'
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 499/499 transitions.
Graph (trivial) has 358 edges and 392 vertex of which 43 / 392 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 355 transition count 414
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 308 transition count 414
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 95 place count 308 transition count 392
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 139 place count 286 transition count 392
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 175 place count 250 transition count 356
Iterating global reduction 2 with 36 rules applied. Total rules applied 211 place count 250 transition count 356
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 211 place count 250 transition count 354
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 248 transition count 354
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 224 place count 239 transition count 345
Iterating global reduction 2 with 9 rules applied. Total rules applied 233 place count 239 transition count 345
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 241 place count 239 transition count 337
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 347 place count 186 transition count 284
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 354 place count 179 transition count 277
Iterating global reduction 3 with 7 rules applied. Total rules applied 361 place count 179 transition count 277
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 368 place count 179 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 370 place count 178 transition count 270
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 379 place count 178 transition count 261
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 381 place count 176 transition count 259
Applied a total of 381 rules in 94 ms. Remains 176 /392 variables (removed 216) and now considering 259/499 (removed 240) transitions.
[2022-05-15 11:39:59] [INFO ] Flow matrix only has 245 transitions (discarded 14 similar events)
// Phase 1: matrix 245 rows 176 cols
[2022-05-15 11:39:59] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:39:59] [INFO ] Implicit Places using invariants in 144 ms returned []
[2022-05-15 11:39:59] [INFO ] Flow matrix only has 245 transitions (discarded 14 similar events)
// Phase 1: matrix 245 rows 176 cols
[2022-05-15 11:39:59] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:00] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2022-05-15 11:40:00] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-15 11:40:00] [INFO ] Flow matrix only has 245 transitions (discarded 14 similar events)
// Phase 1: matrix 245 rows 176 cols
[2022-05-15 11:40:00] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:40:00] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 176/392 places, 259/499 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/392 places, 259/499 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s35 1) (EQ s33 1)), p1:(OR (EQ s93 0) (EQ s161 1)), p2:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6454 reset in 475 ms.
Product exploration explored 100000 steps with 6466 reset in 674 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 670 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 11:40:02] [INFO ] Flow matrix only has 245 transitions (discarded 14 similar events)
// Phase 1: matrix 245 rows 176 cols
[2022-05-15 11:40:02] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:40:02] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 11:40:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-15 11:40:02] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 11:40:02] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-15 11:40:02] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 259/259 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 176 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 175 transition count 243
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 25 place count 167 transition count 235
Iterating global reduction 2 with 8 rules applied. Total rules applied 33 place count 167 transition count 235
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 164 transition count 232
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 162 transition count 230
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 162 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 162 transition count 228
Free-agglomeration rule applied 116 times.
Iterating global reduction 3 with 116 rules applied. Total rules applied 161 place count 162 transition count 112
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (trivial) has 41 edges and 45 vertex of which 14 / 45 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 3 with 154 rules applied. Total rules applied 315 place count 38 transition count 76
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 329 place count 38 transition count 62
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 329 place count 38 transition count 54
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 345 place count 30 transition count 54
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 353 place count 30 transition count 46
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 371 place count 21 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 372 place count 21 transition count 36
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 385 place count 21 transition count 23
Graph (complete) has 35 edges and 21 vertex of which 11 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 386 place count 11 transition count 18
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 391 place count 11 transition count 13
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 9 with 2 rules applied. Total rules applied 393 place count 10 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 395 place count 10 transition count 10
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 400 place count 7 transition count 8
Applied a total of 400 rules in 41 ms. Remains 7 /176 variables (removed 169) and now considering 8/259 (removed 251) transitions.
Finished structural reductions, in 1 iterations. Remains : 7/176 places, 8/259 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 7 factoid took 337 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) p2), (NOT p1)]
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 259/259 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2022-05-15 11:40:03] [INFO ] Flow matrix only has 245 transitions (discarded 14 similar events)
// Phase 1: matrix 245 rows 176 cols
[2022-05-15 11:40:03] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:40:03] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-15 11:40:03] [INFO ] Flow matrix only has 245 transitions (discarded 14 similar events)
// Phase 1: matrix 245 rows 176 cols
[2022-05-15 11:40:03] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:40:03] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2022-05-15 11:40:03] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-15 11:40:03] [INFO ] Flow matrix only has 245 transitions (discarded 14 similar events)
// Phase 1: matrix 245 rows 176 cols
[2022-05-15 11:40:03] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:04] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 259/259 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p1), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 266 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 670 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 11:40:04] [INFO ] Flow matrix only has 245 transitions (discarded 14 similar events)
// Phase 1: matrix 245 rows 176 cols
[2022-05-15 11:40:04] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:40:04] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 11:40:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-15 11:40:05] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 11:40:05] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-15 11:40:05] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 259/259 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 176 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 175 transition count 243
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 25 place count 167 transition count 235
Iterating global reduction 2 with 8 rules applied. Total rules applied 33 place count 167 transition count 235
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 164 transition count 232
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 162 transition count 230
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 162 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 162 transition count 228
Free-agglomeration rule applied 116 times.
Iterating global reduction 3 with 116 rules applied. Total rules applied 161 place count 162 transition count 112
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (trivial) has 41 edges and 45 vertex of which 14 / 45 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 3 with 154 rules applied. Total rules applied 315 place count 38 transition count 76
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 329 place count 38 transition count 62
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 329 place count 38 transition count 54
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 345 place count 30 transition count 54
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 353 place count 30 transition count 46
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 371 place count 21 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 372 place count 21 transition count 36
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 385 place count 21 transition count 23
Graph (complete) has 35 edges and 21 vertex of which 11 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 386 place count 11 transition count 18
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 391 place count 11 transition count 13
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 9 with 2 rules applied. Total rules applied 393 place count 10 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 395 place count 10 transition count 10
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 400 place count 7 transition count 8
Applied a total of 400 rules in 36 ms. Remains 7 /176 variables (removed 169) and now considering 8/259 (removed 251) transitions.
Finished structural reductions, in 1 iterations. Remains : 7/176 places, 8/259 transitions.
Finished random walk after 19 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p1), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) p2), (NOT p1)]
Stuttering criterion allowed to conclude after 63718 steps with 4115 reset in 202 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-10 finished in 6382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(X(p0))))&&(X(p1)||F(p2))))'
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 499/499 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 362 transition count 469
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 362 transition count 469
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 81 place count 341 transition count 448
Iterating global reduction 0 with 21 rules applied. Total rules applied 102 place count 341 transition count 448
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 113 place count 341 transition count 437
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 119 place count 335 transition count 431
Iterating global reduction 1 with 6 rules applied. Total rules applied 125 place count 335 transition count 431
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 130 place count 335 transition count 426
Applied a total of 130 rules in 21 ms. Remains 335 /392 variables (removed 57) and now considering 426/499 (removed 73) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-05-15 11:40:06] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:06] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-05-15 11:40:06] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:40:06] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-05-15 11:40:06] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:40:07] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/392 places, 426/499 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/392 places, 426/499 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0), true, (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s139 1), p1:(OR (EQ s300 0) (EQ s245 1)), p0:(EQ s139 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5799 steps with 175 reset in 20 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-11 finished in 1425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U ((p1 U X(p1))&&!p2)))'
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 499/499 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 364 transition count 471
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 364 transition count 471
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 75 place count 345 transition count 452
Iterating global reduction 0 with 19 rules applied. Total rules applied 94 place count 345 transition count 452
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 105 place count 345 transition count 441
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 111 place count 339 transition count 435
Iterating global reduction 1 with 6 rules applied. Total rules applied 117 place count 339 transition count 435
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 123 place count 339 transition count 429
Applied a total of 123 rules in 23 ms. Remains 339 /392 variables (removed 53) and now considering 429/499 (removed 70) transitions.
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:07] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:07] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:07] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:40:08] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:08] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:08] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 339/392 places, 429/499 transitions.
Finished structural reductions, in 1 iterations. Remains : 339/392 places, 429/499 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p2:(OR (EQ s214 0) (EQ s333 1)), p1:(OR (EQ s320 0) (EQ s236 1)), p0:(OR (EQ s148 0) (EQ s331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1527 reset in 198 ms.
Product exploration explored 100000 steps with 1536 reset in 276 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 633 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 155 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 237469 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237469 steps, saw 69309 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:13] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:14] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 11:40:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-15 11:40:14] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 11:40:14] [INFO ] Deduced a trap composed of 83 places in 253 ms of which 1 ms to minimize.
[2022-05-15 11:40:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 283 ms
[2022-05-15 11:40:15] [INFO ] Deduced a trap composed of 91 places in 218 ms of which 1 ms to minimize.
[2022-05-15 11:40:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2022-05-15 11:40:15] [INFO ] After 1041ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 114 ms.
[2022-05-15 11:40:15] [INFO ] After 1340ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 46 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 5 properties in 24 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 14 factoid took 867 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:16] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:16] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-15 11:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:40:17] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-05-15 11:40:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:40:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-15 11:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:40:17] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-05-15 11:40:17] [INFO ] Computed and/alt/rep : 425/890/425 causal constraints (skipped 3 transitions) in 122 ms.
[2022-05-15 11:40:23] [INFO ] Added : 420 causal constraints over 84 iterations in 5356 ms. Result :sat
Could not prove EG p2
Support contains 6 out of 339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 429/429 transitions.
Applied a total of 0 rules in 9 ms. Remains 339 /339 variables (removed 0) and now considering 429/429 (removed 0) transitions.
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:23] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:40:23] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:23] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:24] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 339/339 places, 429/429 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 446 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 152 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:25] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:40:25] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 11:40:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-15 11:40:25] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 11:40:25] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-05-15 11:40:25] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 52 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 548 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
// Phase 1: matrix 429 rows 339 cols
[2022-05-15 11:40:26] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:27] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-15 11:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:40:27] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-05-15 11:40:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:40:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-15 11:40:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:40:27] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2022-05-15 11:40:28] [INFO ] Computed and/alt/rep : 425/890/425 causal constraints (skipped 3 transitions) in 45 ms.
[2022-05-15 11:40:32] [INFO ] Added : 420 causal constraints over 84 iterations in 4872 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1528 reset in 264 ms.
Product exploration explored 100000 steps with 1524 reset in 476 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Support contains 6 out of 339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 339/339 places, 429/429 transitions.
Graph (trivial) has 302 edges and 339 vertex of which 43 / 339 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 303 transition count 392
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 31 place count 303 transition count 392
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 56 place count 303 transition count 392
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 90 place count 269 transition count 358
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 124 place count 269 transition count 358
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 174 place count 269 transition count 374
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 197 place count 246 transition count 351
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 220 place count 246 transition count 351
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 228 place count 246 transition count 367
Deduced a syphon composed of 69 places in 0 ms
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 243 place count 246 transition count 352
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 70 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 246 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 245 place count 245 transition count 365
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 246 place count 245 transition count 365
Deduced a syphon composed of 69 places in 0 ms
Applied a total of 246 rules in 123 ms. Remains 245 /339 variables (removed 94) and now considering 365/429 (removed 64) transitions.
[2022-05-15 11:40:34] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 11:40:34] [INFO ] Flow matrix only has 351 transitions (discarded 14 similar events)
// Phase 1: matrix 351 rows 245 cols
[2022-05-15 11:40:34] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-15 11:40:35] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/339 places, 365/429 transitions.
Finished structural reductions, in 1 iterations. Remains : 245/339 places, 365/429 transitions.
Stuttering criterion allowed to conclude after 33679 steps with 1661 reset in 196 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-13 finished in 27782 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((X(X(p0))||F(X(X(F(p1)))))))))'
Support contains 4 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 499/499 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 362 transition count 469
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 362 transition count 469
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 79 place count 343 transition count 450
Iterating global reduction 0 with 19 rules applied. Total rules applied 98 place count 343 transition count 450
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 109 place count 343 transition count 439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 114 place count 338 transition count 434
Iterating global reduction 1 with 5 rules applied. Total rules applied 119 place count 338 transition count 434
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 123 place count 338 transition count 430
Applied a total of 123 rules in 40 ms. Remains 338 /392 variables (removed 54) and now considering 430/499 (removed 69) transitions.
// Phase 1: matrix 430 rows 338 cols
[2022-05-15 11:40:35] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:35] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 430 rows 338 cols
[2022-05-15 11:40:35] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:35] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
// Phase 1: matrix 430 rows 338 cols
[2022-05-15 11:40:35] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:36] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 338/392 places, 430/499 transitions.
Finished structural reductions, in 1 iterations. Remains : 338/392 places, 430/499 transitions.
Stuttering acceptance computed with spot in 150 ms :[(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 : FlexibleBarrier-PT-08b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s118 0) (EQ s12 1)), p1:(OR (EQ s216 0) (EQ s255 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]]
Product exploration explored 100000 steps with 25000 reset in 242 ms.
Product exploration explored 100000 steps with 25000 reset in 435 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 177 ms :[(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 152 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 796252 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 796252 steps, saw 184515 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 430 rows 338 cols
[2022-05-15 11:40:40] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:40] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 11:40:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-15 11:40:40] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 11:40:40] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-15 11:40:40] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 338 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 338/338 places, 430/430 transitions.
Graph (trivial) has 306 edges and 338 vertex of which 49 / 338 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 297 transition count 344
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 261 transition count 344
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 73 place count 261 transition count 326
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 109 place count 243 transition count 326
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 124 place count 228 transition count 311
Iterating global reduction 2 with 15 rules applied. Total rules applied 139 place count 228 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 226 transition count 309
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 226 transition count 309
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 247 place count 174 transition count 257
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 263 place count 174 transition count 241
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 271 place count 166 transition count 233
Iterating global reduction 3 with 8 rules applied. Total rules applied 279 place count 166 transition count 233
Free-agglomeration rule applied 117 times.
Iterating global reduction 3 with 117 rules applied. Total rules applied 396 place count 166 transition count 116
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 132 edges and 49 vertex of which 44 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 167 rules applied. Total rules applied 563 place count 44 transition count 67
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 570 place count 44 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 571 place count 43 transition count 59
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 49 edges and 41 vertex of which 35 / 41 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 574 place count 13 transition count 59
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 6 with 52 rules applied. Total rules applied 626 place count 10 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 626 place count 10 transition count 8
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 630 place count 8 transition count 8
Applied a total of 630 rules in 52 ms. Remains 8 /338 variables (removed 330) and now considering 8/430 (removed 422) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/338 places, 8/430 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 167 ms :[(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 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 430/430 transitions.
Applied a total of 0 rules in 8 ms. Remains 338 /338 variables (removed 0) and now considering 430/430 (removed 0) transitions.
// Phase 1: matrix 430 rows 338 cols
[2022-05-15 11:40:41] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:41] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 430 rows 338 cols
[2022-05-15 11:40:41] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:40:41] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
// Phase 1: matrix 430 rows 338 cols
[2022-05-15 11:40:41] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:42] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 338/338 places, 430/430 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 179 ms :[(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 151 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 869121 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 869121 steps, saw 198832 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 430 rows 338 cols
[2022-05-15 11:40:45] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:45] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 11:40:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-15 11:40:45] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 11:40:45] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-15 11:40:45] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 338 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 338/338 places, 430/430 transitions.
Graph (trivial) has 306 edges and 338 vertex of which 49 / 338 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 297 transition count 344
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 261 transition count 344
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 73 place count 261 transition count 326
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 109 place count 243 transition count 326
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 124 place count 228 transition count 311
Iterating global reduction 2 with 15 rules applied. Total rules applied 139 place count 228 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 226 transition count 309
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 226 transition count 309
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 247 place count 174 transition count 257
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 263 place count 174 transition count 241
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 271 place count 166 transition count 233
Iterating global reduction 3 with 8 rules applied. Total rules applied 279 place count 166 transition count 233
Free-agglomeration rule applied 117 times.
Iterating global reduction 3 with 117 rules applied. Total rules applied 396 place count 166 transition count 116
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 132 edges and 49 vertex of which 44 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 167 rules applied. Total rules applied 563 place count 44 transition count 67
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 570 place count 44 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 571 place count 43 transition count 59
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 49 edges and 41 vertex of which 35 / 41 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 574 place count 13 transition count 59
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 6 with 52 rules applied. Total rules applied 626 place count 10 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 626 place count 10 transition count 8
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 630 place count 8 transition count 8
Applied a total of 630 rules in 88 ms. Remains 8 /338 variables (removed 330) and now considering 8/430 (removed 422) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/338 places, 8/430 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 175 ms :[(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 179 ms :[(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 180 ms :[(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 210 ms.
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 338/338 places, 430/430 transitions.
Graph (trivial) has 306 edges and 338 vertex of which 49 / 338 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 297 transition count 388
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 32 place count 297 transition count 388
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 53 place count 297 transition count 388
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 86 place count 264 transition count 355
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 119 place count 264 transition count 355
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 262 transition count 353
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 262 transition count 353
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 169 place count 262 transition count 369
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 191 place count 240 transition count 347
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 213 place count 240 transition count 347
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 221 place count 240 transition count 363
Deduced a syphon composed of 66 places in 0 ms
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 237 place count 240 transition count 347
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 237 rules in 44 ms. Remains 240 /338 variables (removed 98) and now considering 347/430 (removed 83) transitions.
[2022-05-15 11:40:47] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 11:40:47] [INFO ] Flow matrix only has 332 transitions (discarded 15 similar events)
// Phase 1: matrix 332 rows 240 cols
[2022-05-15 11:40:47] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:40:47] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/338 places, 347/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/338 places, 347/430 transitions.
Product exploration explored 100000 steps with 25000 reset in 764 ms.
Product exploration explored 100000 steps with 25000 reset in 742 ms.
Built C files in :
/tmp/ltsmin69049243873301111
[2022-05-15 11:40:49] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin69049243873301111
Running compilation step : cd /tmp/ltsmin69049243873301111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1382 ms.
Running link step : cd /tmp/ltsmin69049243873301111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin69049243873301111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7848086845958842755.hoa' '--buchi-type=spotba'
LTSmin run took 178 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-14 finished in 15797 ms.
All properties solved by simple procedures.
Total runtime 64665 ms.

BK_STOP 1652614851298

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="FlexibleBarrier-PT-08b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-08b, 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 r096-smll-165260575700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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