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.r132-tall-165271820900467.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 LeafsetExtension-PT-S08C4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820900467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 10K Apr 29 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 12:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 12:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 254K May 10 09:34 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 LeafsetExtension-PT-S08C4-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652792902677

Running Version 202205111006
[2022-05-17 13:08:24] [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-17 13:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 13:08:24] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-17 13:08:24] [INFO ] Transformed 462 places.
[2022-05-17 13:08:24] [INFO ] Transformed 409 transitions.
[2022-05-17 13:08:24] [INFO ] Parsed PT model containing 462 places and 409 transitions in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 381 transition count 409
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 141 place count 321 transition count 349
Iterating global reduction 1 with 60 rules applied. Total rules applied 201 place count 321 transition count 349
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 241 place count 281 transition count 309
Iterating global reduction 1 with 40 rules applied. Total rules applied 281 place count 281 transition count 309
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 316 place count 246 transition count 274
Iterating global reduction 1 with 35 rules applied. Total rules applied 351 place count 246 transition count 274
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 356 place count 241 transition count 274
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 359 place count 238 transition count 271
Iterating global reduction 2 with 3 rules applied. Total rules applied 362 place count 238 transition count 271
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 365 place count 235 transition count 268
Iterating global reduction 2 with 3 rules applied. Total rules applied 368 place count 235 transition count 268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 371 place count 232 transition count 265
Iterating global reduction 2 with 3 rules applied. Total rules applied 374 place count 232 transition count 265
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 377 place count 229 transition count 262
Iterating global reduction 2 with 3 rules applied. Total rules applied 380 place count 229 transition count 262
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 386 place count 223 transition count 256
Iterating global reduction 2 with 6 rules applied. Total rules applied 392 place count 223 transition count 256
Applied a total of 392 rules in 100 ms. Remains 223 /462 variables (removed 239) and now considering 256/409 (removed 153) transitions.
[2022-05-17 13:08:24] [INFO ] Flow matrix only has 250 transitions (discarded 6 similar events)
// Phase 1: matrix 250 rows 223 cols
[2022-05-17 13:08:24] [INFO ] Computed 26 place invariants in 18 ms
[2022-05-17 13:08:24] [INFO ] Implicit Places using invariants in 308 ms returned [43, 53, 69, 97, 125, 141, 145, 152, 163, 175]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 347 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 213/462 places, 256/409 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 231
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 231
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 185 transition count 228
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 185 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 184 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 184 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 183 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 183 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 181 transition count 224
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 181 transition count 224
Applied a total of 64 rules in 20 ms. Remains 181 /213 variables (removed 32) and now considering 224/256 (removed 32) transitions.
[2022-05-17 13:08:24] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
// Phase 1: matrix 214 rows 181 cols
[2022-05-17 13:08:24] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-17 13:08:25] [INFO ] Implicit Places using invariants in 212 ms returned []
[2022-05-17 13:08:25] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
// Phase 1: matrix 214 rows 181 cols
[2022-05-17 13:08:25] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-17 13:08:26] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 181/462 places, 224/409 transitions.
Finished structural reductions, in 2 iterations. Remains : 181/462 places, 224/409 transitions.
Support contains 36 out of 181 places after structural reductions.
[2022-05-17 13:08:26] [INFO ] Flatten gal took : 41 ms
[2022-05-17 13:08:26] [INFO ] Flatten gal took : 20 ms
[2022-05-17 13:08:26] [INFO ] Input system was already deterministic with 224 transitions.
Incomplete random walk after 10000 steps, including 284 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 13:08:26] [INFO ] Flow matrix only has 214 transitions (discarded 10 similar events)
// Phase 1: matrix 214 rows 181 cols
[2022-05-17 13:08:26] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-17 13:08:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 13:08:27] [INFO ] [Real]Absence check using 1 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-17 13:08:27] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 181 stabilizing places and 224 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 181 transition count 224
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(!(p0 U X(G(F(p0)))))))))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Graph (complete) has 452 edges and 181 vertex of which 176 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 176 transition count 183
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 137 transition count 183
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 79 place count 137 transition count 169
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 107 place count 123 transition count 169
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 124 place count 106 transition count 152
Iterating global reduction 2 with 17 rules applied. Total rules applied 141 place count 106 transition count 152
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 149 place count 98 transition count 144
Iterating global reduction 2 with 8 rules applied. Total rules applied 157 place count 98 transition count 144
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 97 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 158 place count 97 transition count 143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 96 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 95 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 95 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 94 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 94 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 92 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 92 transition count 139
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 204 place count 74 transition count 121
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 211 place count 67 transition count 114
Iterating global reduction 3 with 7 rules applied. Total rules applied 218 place count 67 transition count 114
Applied a total of 218 rules in 47 ms. Remains 67 /181 variables (removed 114) and now considering 114/224 (removed 110) transitions.
[2022-05-17 13:08:27] [INFO ] Flow matrix only has 88 transitions (discarded 26 similar events)
// Phase 1: matrix 88 rows 67 cols
[2022-05-17 13:08:27] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-17 13:08:27] [INFO ] Implicit Places using invariants in 63 ms returned [2, 10, 21, 22, 28, 30, 31, 37, 48, 49, 53]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 64 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/181 places, 114/224 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 56 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 49 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 49 transition count 107
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 43 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 43 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 39 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 39 transition count 97
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 46 place count 33 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 31 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 31 transition count 89
Applied a total of 50 rules in 9 ms. Remains 31 /56 variables (removed 25) and now considering 89/114 (removed 25) transitions.
[2022-05-17 13:08:27] [INFO ] Flow matrix only has 31 transitions (discarded 58 similar events)
// Phase 1: matrix 31 rows 31 cols
[2022-05-17 13:08:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:08:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-17 13:08:27] [INFO ] Flow matrix only has 31 transitions (discarded 58 similar events)
// Phase 1: matrix 31 rows 31 cols
[2022-05-17 13:08:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:08:27] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/181 places, 89/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 31/181 places, 89/224 transitions.
Stuttering acceptance computed with spot in 130 ms :[p0]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s22 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-00 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U G(p1))) U !p0))'
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Graph (complete) has 452 edges and 181 vertex of which 175 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 175 transition count 186
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 139 transition count 186
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 73 place count 139 transition count 171
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 103 place count 124 transition count 171
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 119 place count 108 transition count 155
Iterating global reduction 2 with 16 rules applied. Total rules applied 135 place count 108 transition count 155
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 101 transition count 148
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 101 transition count 148
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 187 place count 82 transition count 129
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 194 place count 75 transition count 122
Iterating global reduction 2 with 7 rules applied. Total rules applied 201 place count 75 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 202 place count 74 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 203 place count 74 transition count 121
Applied a total of 203 rules in 25 ms. Remains 74 /181 variables (removed 107) and now considering 121/224 (removed 103) transitions.
[2022-05-17 13:08:27] [INFO ] Flow matrix only has 99 transitions (discarded 22 similar events)
// Phase 1: matrix 99 rows 74 cols
[2022-05-17 13:08:27] [INFO ] Computed 15 place invariants in 9 ms
[2022-05-17 13:08:27] [INFO ] Implicit Places using invariants in 63 ms returned [2, 3, 8, 24, 25, 32, 34, 36, 44, 54, 55, 59]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 64 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/181 places, 121/224 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 120
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 55 transition count 114
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 55 transition count 114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 50 transition count 109
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 50 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 47 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 47 transition count 106
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 2 with 18 rules applied. Total rules applied 48 place count 38 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 36 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 36 transition count 95
Applied a total of 52 rules in 13 ms. Remains 36 /62 variables (removed 26) and now considering 95/121 (removed 26) transitions.
[2022-05-17 13:08:27] [INFO ] Flow matrix only has 45 transitions (discarded 50 similar events)
// Phase 1: matrix 45 rows 36 cols
[2022-05-17 13:08:27] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-17 13:08:27] [INFO ] Flow matrix only has 45 transitions (discarded 50 similar events)
// Phase 1: matrix 45 rows 36 cols
[2022-05-17 13:08:27] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 13:08:27] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/181 places, 95/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 36/181 places, 95/224 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), true, p0, (OR (NOT p1) p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s20 s31), p0:(LEQ s9 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-01 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(F(p0)))))'
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Graph (complete) has 452 edges and 181 vertex of which 175 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 175 transition count 183
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 136 transition count 183
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 79 place count 136 transition count 169
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 107 place count 122 transition count 169
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 125 place count 104 transition count 151
Iterating global reduction 2 with 18 rules applied. Total rules applied 143 place count 104 transition count 151
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 151 place count 96 transition count 143
Iterating global reduction 2 with 8 rules applied. Total rules applied 159 place count 96 transition count 143
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 95 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 160 place count 95 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 94 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 93 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 93 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 92 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 92 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 90 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 90 transition count 138
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 206 place count 72 transition count 120
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 212 place count 66 transition count 114
Iterating global reduction 3 with 6 rules applied. Total rules applied 218 place count 66 transition count 114
Applied a total of 218 rules in 25 ms. Remains 66 /181 variables (removed 115) and now considering 114/224 (removed 110) transitions.
[2022-05-17 13:08:28] [INFO ] Flow matrix only has 88 transitions (discarded 26 similar events)
// Phase 1: matrix 88 rows 66 cols
[2022-05-17 13:08:28] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 13:08:28] [INFO ] Implicit Places using invariants in 48 ms returned [2, 3, 8, 19, 20, 26, 28, 29, 35, 45, 52]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 49 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/181 places, 114/224 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 49 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 49 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 43 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 43 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 38 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 38 transition count 97
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 46 place count 32 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 30 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 30 transition count 89
Applied a total of 50 rules in 7 ms. Remains 30 /55 variables (removed 25) and now considering 89/114 (removed 25) transitions.
[2022-05-17 13:08:28] [INFO ] Flow matrix only has 31 transitions (discarded 58 similar events)
// Phase 1: matrix 31 rows 30 cols
[2022-05-17 13:08:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-17 13:08:28] [INFO ] Flow matrix only has 31 transitions (discarded 58 similar events)
// Phase 1: matrix 31 rows 30 cols
[2022-05-17 13:08:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:28] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/181 places, 89/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 30/181 places, 89/224 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s22)], 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 7087 reset in 368 ms.
Product exploration explored 100000 steps with 7080 reset in 182 ms.
Computed a total of 30 stabilizing places and 89 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 89
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-02 finished in 903 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 178 transition count 224
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 28 place count 153 transition count 199
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 153 transition count 199
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 72 place count 134 transition count 180
Iterating global reduction 1 with 19 rules applied. Total rules applied 91 place count 134 transition count 180
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 94 place count 131 transition count 180
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 112 place count 113 transition count 162
Iterating global reduction 2 with 18 rules applied. Total rules applied 130 place count 113 transition count 162
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 107 transition count 162
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 149 place count 94 transition count 149
Iterating global reduction 3 with 13 rules applied. Total rules applied 162 place count 94 transition count 149
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 171 place count 85 transition count 140
Iterating global reduction 3 with 9 rules applied. Total rules applied 180 place count 85 transition count 140
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 189 place count 76 transition count 131
Iterating global reduction 3 with 9 rules applied. Total rules applied 198 place count 76 transition count 131
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 210 place count 64 transition count 119
Iterating global reduction 3 with 12 rules applied. Total rules applied 222 place count 64 transition count 119
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 233 place count 53 transition count 108
Iterating global reduction 3 with 11 rules applied. Total rules applied 244 place count 53 transition count 108
Applied a total of 244 rules in 17 ms. Remains 53 /181 variables (removed 128) and now considering 108/224 (removed 116) transitions.
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 53 transitions (discarded 55 similar events)
// Phase 1: matrix 53 rows 53 cols
[2022-05-17 13:08:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants in 36 ms returned [20, 33, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/181 places, 108/224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 48 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 106
Applied a total of 4 rules in 1 ms. Remains 48 /50 variables (removed 2) and now considering 106/108 (removed 2) transitions.
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 51 transitions (discarded 55 similar events)
// Phase 1: matrix 51 rows 48 cols
[2022-05-17 13:08:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 51 transitions (discarded 55 similar events)
// Phase 1: matrix 51 rows 48 cols
[2022-05-17 13:08:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 48/181 places, 106/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/181 places, 106/224 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s10 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 385 steps with 11 reset in 3 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-04 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 177 transition count 224
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 28 place count 153 transition count 200
Iterating global reduction 1 with 24 rules applied. Total rules applied 52 place count 153 transition count 200
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 134 transition count 181
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 134 transition count 181
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 93 place count 131 transition count 181
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 111 place count 113 transition count 163
Iterating global reduction 2 with 18 rules applied. Total rules applied 129 place count 113 transition count 163
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 135 place count 107 transition count 163
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 149 place count 93 transition count 149
Iterating global reduction 3 with 14 rules applied. Total rules applied 163 place count 93 transition count 149
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 172 place count 84 transition count 140
Iterating global reduction 3 with 9 rules applied. Total rules applied 181 place count 84 transition count 140
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 190 place count 75 transition count 131
Iterating global reduction 3 with 9 rules applied. Total rules applied 199 place count 75 transition count 131
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 211 place count 63 transition count 119
Iterating global reduction 3 with 12 rules applied. Total rules applied 223 place count 63 transition count 119
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 233 place count 53 transition count 109
Iterating global reduction 3 with 10 rules applied. Total rules applied 243 place count 53 transition count 109
Applied a total of 243 rules in 11 ms. Remains 53 /181 variables (removed 128) and now considering 109/224 (removed 115) transitions.
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 54 transitions (discarded 55 similar events)
// Phase 1: matrix 54 rows 53 cols
[2022-05-17 13:08:29] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants in 34 ms returned [14, 25, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/181 places, 109/224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 48 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 107
Applied a total of 4 rules in 1 ms. Remains 48 /50 variables (removed 2) and now considering 107/109 (removed 2) transitions.
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 52 transitions (discarded 55 similar events)
// Phase 1: matrix 52 rows 48 cols
[2022-05-17 13:08:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 52 transitions (discarded 55 similar events)
// Phase 1: matrix 52 rows 48 cols
[2022-05-17 13:08:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 48/181 places, 107/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/181 places, 107/224 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT s16 s19) (GT s30 s32))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-05 finished in 226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Graph (complete) has 452 edges and 181 vertex of which 175 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 175 transition count 185
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 138 transition count 185
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 75 place count 138 transition count 171
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 103 place count 124 transition count 171
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 120 place count 107 transition count 154
Iterating global reduction 2 with 17 rules applied. Total rules applied 137 place count 107 transition count 154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 102 transition count 149
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 102 transition count 149
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 101 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 148 place count 101 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 100 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 99 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 99 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 98 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 98 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 96 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 96 transition count 144
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 196 place count 77 transition count 125
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 204 place count 69 transition count 117
Iterating global reduction 3 with 8 rules applied. Total rules applied 212 place count 69 transition count 117
Applied a total of 212 rules in 21 ms. Remains 69 /181 variables (removed 112) and now considering 117/224 (removed 107) transitions.
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 96 transitions (discarded 21 similar events)
// Phase 1: matrix 96 rows 69 cols
[2022-05-17 13:08:29] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants in 49 ms returned [2, 3, 8, 19, 20, 26, 28, 29, 35, 50, 51, 55]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 50 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/181 places, 117/224 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 50 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 50 transition count 110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 43 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 43 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 38 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 38 transition count 98
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 52 place count 31 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 29 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 29 transition count 89
Applied a total of 56 rules in 5 ms. Remains 29 /57 variables (removed 28) and now considering 89/117 (removed 28) transitions.
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 32 transitions (discarded 57 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-17 13:08:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 32 transitions (discarded 57 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-17 13:08:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/181 places, 89/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 29/181 places, 89/224 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s18 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-06 finished in 192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 177 transition count 224
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 29 place count 152 transition count 199
Iterating global reduction 1 with 25 rules applied. Total rules applied 54 place count 152 transition count 199
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 73 place count 133 transition count 180
Iterating global reduction 1 with 19 rules applied. Total rules applied 92 place count 133 transition count 180
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 131 transition count 180
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 112 place count 113 transition count 162
Iterating global reduction 2 with 18 rules applied. Total rules applied 130 place count 113 transition count 162
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 137 place count 106 transition count 162
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 151 place count 92 transition count 148
Iterating global reduction 3 with 14 rules applied. Total rules applied 165 place count 92 transition count 148
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 174 place count 83 transition count 139
Iterating global reduction 3 with 9 rules applied. Total rules applied 183 place count 83 transition count 139
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 192 place count 74 transition count 130
Iterating global reduction 3 with 9 rules applied. Total rules applied 201 place count 74 transition count 130
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 212 place count 63 transition count 119
Iterating global reduction 3 with 11 rules applied. Total rules applied 223 place count 63 transition count 119
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 235 place count 51 transition count 107
Iterating global reduction 3 with 12 rules applied. Total rules applied 247 place count 51 transition count 107
Applied a total of 247 rules in 13 ms. Remains 51 /181 variables (removed 130) and now considering 107/224 (removed 117) transitions.
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 52 transitions (discarded 55 similar events)
// Phase 1: matrix 52 rows 51 cols
[2022-05-17 13:08:29] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants in 35 ms returned [14, 24, 42]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/181 places, 107/224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 46 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 105
Applied a total of 4 rules in 1 ms. Remains 46 /48 variables (removed 2) and now considering 105/107 (removed 2) transitions.
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 50 transitions (discarded 55 similar events)
// Phase 1: matrix 50 rows 46 cols
[2022-05-17 13:08:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-17 13:08:29] [INFO ] Flow matrix only has 50 transitions (discarded 55 similar events)
// Phase 1: matrix 50 rows 46 cols
[2022-05-17 13:08:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:29] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/181 places, 105/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 46/181 places, 105/224 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s23 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 133 ms.
Product exploration explored 100000 steps with 33333 reset in 209 ms.
Computed a total of 46 stabilizing places and 105 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 105
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-08 finished in 709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 178 transition count 224
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 154 transition count 200
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 154 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 136 transition count 182
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 136 transition count 182
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 90 place count 133 transition count 182
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 108 place count 115 transition count 164
Iterating global reduction 2 with 18 rules applied. Total rules applied 126 place count 115 transition count 164
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 132 place count 109 transition count 164
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 146 place count 95 transition count 150
Iterating global reduction 3 with 14 rules applied. Total rules applied 160 place count 95 transition count 150
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 169 place count 86 transition count 141
Iterating global reduction 3 with 9 rules applied. Total rules applied 178 place count 86 transition count 141
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 187 place count 77 transition count 132
Iterating global reduction 3 with 9 rules applied. Total rules applied 196 place count 77 transition count 132
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 208 place count 65 transition count 120
Iterating global reduction 3 with 12 rules applied. Total rules applied 220 place count 65 transition count 120
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 230 place count 55 transition count 110
Iterating global reduction 3 with 10 rules applied. Total rules applied 240 place count 55 transition count 110
Applied a total of 240 rules in 13 ms. Remains 55 /181 variables (removed 126) and now considering 110/224 (removed 114) transitions.
[2022-05-17 13:08:30] [INFO ] Flow matrix only has 56 transitions (discarded 54 similar events)
// Phase 1: matrix 56 rows 55 cols
[2022-05-17 13:08:30] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 13:08:30] [INFO ] Implicit Places using invariants in 49 ms returned [14, 23, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/181 places, 110/224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 50 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 108
Applied a total of 4 rules in 0 ms. Remains 50 /52 variables (removed 2) and now considering 108/110 (removed 2) transitions.
[2022-05-17 13:08:30] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 50 cols
[2022-05-17 13:08:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-17 13:08:30] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 50 cols
[2022-05-17 13:08:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:30] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/181 places, 108/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 50/181 places, 108/224 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT s35 s28), p0:(LEQ 1 s25)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-11 finished in 592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(p0))||(p1 U p2)||p3)))'
Support contains 7 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Graph (complete) has 452 edges and 181 vertex of which 175 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 175 transition count 195
Reduce places removed 27 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 34 rules applied. Total rules applied 62 place count 148 transition count 188
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 69 place count 141 transition count 188
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 69 place count 141 transition count 171
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 103 place count 124 transition count 171
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 119 place count 108 transition count 155
Iterating global reduction 3 with 16 rules applied. Total rules applied 135 place count 108 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 140 place count 103 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 103 transition count 150
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 102 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 101 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 101 transition count 149
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 186 place count 82 transition count 130
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 193 place count 75 transition count 123
Iterating global reduction 4 with 7 rules applied. Total rules applied 200 place count 75 transition count 123
Applied a total of 200 rules in 19 ms. Remains 75 /181 variables (removed 106) and now considering 123/224 (removed 101) transitions.
[2022-05-17 13:08:31] [INFO ] Flow matrix only has 106 transitions (discarded 17 similar events)
// Phase 1: matrix 106 rows 75 cols
[2022-05-17 13:08:31] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 13:08:31] [INFO ] Implicit Places using invariants in 53 ms returned [2, 3, 26, 32, 34, 35, 41, 56, 57]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 53 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/181 places, 123/224 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 117
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 54 transition count 111
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 54 transition count 111
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 50 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 50 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 48 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 46 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 46 transition count 103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 44 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 44 transition count 101
Applied a total of 44 rules in 6 ms. Remains 44 /66 variables (removed 22) and now considering 101/123 (removed 22) transitions.
[2022-05-17 13:08:31] [INFO ] Flow matrix only has 52 transitions (discarded 49 similar events)
// Phase 1: matrix 52 rows 44 cols
[2022-05-17 13:08:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:08:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-17 13:08:31] [INFO ] Flow matrix only has 52 transitions (discarded 49 similar events)
// Phase 1: matrix 52 rows 44 cols
[2022-05-17 13:08:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 13:08:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/181 places, 101/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 44/181 places, 101/224 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(LEQ 1 s6), p2:(LEQ s32 s20), p1:(LEQ s38 s13), p0:(LEQ s29 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6572 reset in 274 ms.
Product exploration explored 100000 steps with 6558 reset in 312 ms.
Computed a total of 44 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 11 factoid took 270 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-12 finished in 1193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p0)||F(G(p1))))||X(p2))))'
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 177 transition count 224
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 27 place count 154 transition count 201
Iterating global reduction 1 with 23 rules applied. Total rules applied 50 place count 154 transition count 201
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 138 transition count 185
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 138 transition count 185
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 136 transition count 185
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 99 place count 121 transition count 170
Iterating global reduction 2 with 15 rules applied. Total rules applied 114 place count 121 transition count 170
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 119 place count 116 transition count 170
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 131 place count 104 transition count 158
Iterating global reduction 3 with 12 rules applied. Total rules applied 143 place count 104 transition count 158
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 150 place count 97 transition count 151
Iterating global reduction 3 with 7 rules applied. Total rules applied 157 place count 97 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 164 place count 90 transition count 144
Iterating global reduction 3 with 7 rules applied. Total rules applied 171 place count 90 transition count 144
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 180 place count 81 transition count 135
Iterating global reduction 3 with 9 rules applied. Total rules applied 189 place count 81 transition count 135
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 197 place count 73 transition count 127
Iterating global reduction 3 with 8 rules applied. Total rules applied 205 place count 73 transition count 127
Applied a total of 205 rules in 6 ms. Remains 73 /181 variables (removed 108) and now considering 127/224 (removed 97) transitions.
[2022-05-17 13:08:32] [INFO ] Flow matrix only has 80 transitions (discarded 47 similar events)
// Phase 1: matrix 80 rows 73 cols
[2022-05-17 13:08:32] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 13:08:32] [INFO ] Implicit Places using invariants in 78 ms returned [14, 34, 62]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/181 places, 127/224 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 124
Applied a total of 6 rules in 1 ms. Remains 67 /70 variables (removed 3) and now considering 124/127 (removed 3) transitions.
[2022-05-17 13:08:32] [INFO ] Flow matrix only has 77 transitions (discarded 47 similar events)
// Phase 1: matrix 77 rows 67 cols
[2022-05-17 13:08:32] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 13:08:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-17 13:08:32] [INFO ] Flow matrix only has 77 transitions (discarded 47 similar events)
// Phase 1: matrix 77 rows 67 cols
[2022-05-17 13:08:32] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-17 13:08:32] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/181 places, 124/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 67/181 places, 124/224 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s15 s36), p0:(LEQ 1 s43), p1:(LEQ 1 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 125 ms.
Product exploration explored 100000 steps with 33333 reset in 134 ms.
Computed a total of 67 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 124
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p2) p0))))
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-14 finished in 879 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p0))||p1) U (F(p2) U (G(!p1)||p2)))))'
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 224/224 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 178 transition count 224
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 155 transition count 201
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 155 transition count 201
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 138 transition count 184
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 138 transition count 184
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 135 transition count 184
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 102 place count 119 transition count 168
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 119 transition count 168
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 123 place count 114 transition count 168
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 134 place count 103 transition count 157
Iterating global reduction 3 with 11 rules applied. Total rules applied 145 place count 103 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 153 place count 95 transition count 149
Iterating global reduction 3 with 8 rules applied. Total rules applied 161 place count 95 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 169 place count 87 transition count 141
Iterating global reduction 3 with 8 rules applied. Total rules applied 177 place count 87 transition count 141
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 188 place count 76 transition count 130
Iterating global reduction 3 with 11 rules applied. Total rules applied 199 place count 76 transition count 130
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 208 place count 67 transition count 121
Iterating global reduction 3 with 9 rules applied. Total rules applied 217 place count 67 transition count 121
Applied a total of 217 rules in 14 ms. Remains 67 /181 variables (removed 114) and now considering 121/224 (removed 103) transitions.
[2022-05-17 13:08:33] [INFO ] Flow matrix only has 68 transitions (discarded 53 similar events)
// Phase 1: matrix 68 rows 67 cols
[2022-05-17 13:08:33] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 13:08:33] [INFO ] Implicit Places using invariants in 43 ms returned [24, 46, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/181 places, 121/224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 119
Applied a total of 4 rules in 1 ms. Remains 62 /64 variables (removed 2) and now considering 119/121 (removed 2) transitions.
[2022-05-17 13:08:33] [INFO ] Flow matrix only has 66 transitions (discarded 53 similar events)
// Phase 1: matrix 66 rows 62 cols
[2022-05-17 13:08:33] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:08:33] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-17 13:08:33] [INFO ] Flow matrix only has 66 transitions (discarded 53 similar events)
// Phase 1: matrix 66 rows 62 cols
[2022-05-17 13:08:33] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-17 13:08:33] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 62/181 places, 119/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 62/181 places, 119/224 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 1 s53), p1:(GT 1 s35), p0:(LEQ s5 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLCardinality-15 finished in 393 ms.
All properties solved by simple procedures.
Total runtime 9303 ms.

BK_STOP 1652792913831

--------------------
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="LeafsetExtension-PT-S08C4"
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 LeafsetExtension-PT-S08C4, 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 r132-tall-165271820900467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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