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-165271820900468.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820900468
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S08C4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652792929748

Running Version 202205111006
[2022-05-17 13:08:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 13:08:51] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2022-05-17 13:08:51] [INFO ] Transformed 462 places.
[2022-05-17 13:08:51] [INFO ] Transformed 409 transitions.
[2022-05-17 13:08:51] [INFO ] Parsed PT model containing 462 places and 409 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 377 transition count 409
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 154 place count 308 transition count 340
Iterating global reduction 1 with 69 rules applied. Total rules applied 223 place count 308 transition count 340
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 266 place count 265 transition count 297
Iterating global reduction 1 with 43 rules applied. Total rules applied 309 place count 265 transition count 297
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 349 place count 225 transition count 257
Iterating global reduction 1 with 40 rules applied. Total rules applied 389 place count 225 transition count 257
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 397 place count 217 transition count 257
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 403 place count 211 transition count 251
Iterating global reduction 2 with 6 rules applied. Total rules applied 409 place count 211 transition count 251
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 412 place count 208 transition count 248
Iterating global reduction 2 with 3 rules applied. Total rules applied 415 place count 208 transition count 248
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 417 place count 206 transition count 246
Iterating global reduction 2 with 2 rules applied. Total rules applied 419 place count 206 transition count 246
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 421 place count 204 transition count 244
Iterating global reduction 2 with 2 rules applied. Total rules applied 423 place count 204 transition count 244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 427 place count 200 transition count 240
Iterating global reduction 2 with 4 rules applied. Total rules applied 431 place count 200 transition count 240
Applied a total of 431 rules in 96 ms. Remains 200 /462 variables (removed 262) and now considering 240/409 (removed 169) transitions.
[2022-05-17 13:08:51] [INFO ] Flow matrix only has 236 transitions (discarded 4 similar events)
// Phase 1: matrix 236 rows 200 cols
[2022-05-17 13:08:51] [INFO ] Computed 22 place invariants in 13 ms
[2022-05-17 13:08:51] [INFO ] Implicit Places using invariants in 260 ms returned [4, 24, 44, 63, 88, 91, 131, 179]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 293 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 192/462 places, 240/409 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 178 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 178 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 176 transition count 224
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 176 transition count 224
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 174 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 174 transition count 222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 172 transition count 220
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 172 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 169 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 169 transition count 217
Applied a total of 46 rules in 23 ms. Remains 169 /192 variables (removed 23) and now considering 217/240 (removed 23) transitions.
[2022-05-17 13:08:51] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
// Phase 1: matrix 208 rows 169 cols
[2022-05-17 13:08:51] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-17 13:08:51] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-17 13:08:51] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
// Phase 1: matrix 208 rows 169 cols
[2022-05-17 13:08:51] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-17 13:08:51] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 169/462 places, 217/409 transitions.
Finished structural reductions, in 2 iterations. Remains : 169/462 places, 217/409 transitions.
Support contains 47 out of 169 places after structural reductions.
[2022-05-17 13:08:52] [INFO ] Flatten gal took : 41 ms
[2022-05-17 13:08:52] [INFO ] Flatten gal took : 18 ms
[2022-05-17 13:08:52] [INFO ] Input system was already deterministic with 217 transitions.
Incomplete random walk after 10000 steps, including 278 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 29) seen :28
Finished Best-First random walk after 3164 steps, including 15 resets, run visited all 1 properties in 12 ms. (steps per millisecond=263 )
Computed a total of 169 stabilizing places and 217 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 169 transition count 217
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' '!(X(((G((X(F(p1))||p2))&&F(p2))||p0)))'
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 154 transition count 202
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 154 transition count 202
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 140 transition count 188
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 140 transition count 188
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 135 transition count 188
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 79 place count 119 transition count 172
Iterating global reduction 1 with 16 rules applied. Total rules applied 95 place count 119 transition count 172
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 117 transition count 172
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 114 place count 100 transition count 155
Iterating global reduction 2 with 17 rules applied. Total rules applied 131 place count 100 transition count 155
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 138 place count 93 transition count 148
Iterating global reduction 2 with 7 rules applied. Total rules applied 145 place count 93 transition count 148
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 152 place count 86 transition count 141
Iterating global reduction 2 with 7 rules applied. Total rules applied 159 place count 86 transition count 141
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 176 place count 69 transition count 124
Iterating global reduction 2 with 17 rules applied. Total rules applied 193 place count 69 transition count 124
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 65 transition count 120
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 65 transition count 120
Applied a total of 201 rules in 17 ms. Remains 65 /169 variables (removed 104) and now considering 120/217 (removed 97) transitions.
[2022-05-17 13:08:52] [INFO ] Flow matrix only has 72 transitions (discarded 48 similar events)
// Phase 1: matrix 72 rows 65 cols
[2022-05-17 13:08:52] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 13:08:52] [INFO ] Implicit Places using invariants in 47 ms returned [37, 43, 49, 53]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/169 places, 120/217 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 50 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 50 transition count 109
Applied a total of 22 rules in 6 ms. Remains 50 /61 variables (removed 11) and now considering 109/120 (removed 11) transitions.
[2022-05-17 13:08:52] [INFO ] Flow matrix only has 58 transitions (discarded 51 similar events)
// Phase 1: matrix 58 rows 50 cols
[2022-05-17 13:08:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-17 13:08:52] [INFO ] Flow matrix only has 58 transitions (discarded 51 similar events)
// Phase 1: matrix 58 rows 50 cols
[2022-05-17 13:08:52] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:53] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/169 places, 109/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 50/169 places, 109/217 transitions.
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s16 1) (LT s43 1)), p2:(AND (GEQ s24 1) (GEQ s26 1)), p1:(GEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 50 stabilizing places and 109 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 109
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 p0 (NOT p2) (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT p1))), (X (X (NOT p2))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-00 finished in 1264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X((p1 U p2))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 154 transition count 202
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 154 transition count 202
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 140 transition count 188
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 140 transition count 188
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 135 transition count 188
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 79 place count 119 transition count 172
Iterating global reduction 1 with 16 rules applied. Total rules applied 95 place count 119 transition count 172
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 117 transition count 172
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 108 place count 106 transition count 161
Iterating global reduction 2 with 11 rules applied. Total rules applied 119 place count 106 transition count 161
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 126 place count 99 transition count 154
Iterating global reduction 2 with 7 rules applied. Total rules applied 133 place count 99 transition count 154
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 140 place count 92 transition count 147
Iterating global reduction 2 with 7 rules applied. Total rules applied 147 place count 92 transition count 147
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 165 place count 74 transition count 129
Iterating global reduction 2 with 18 rules applied. Total rules applied 183 place count 74 transition count 129
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 70 transition count 125
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 70 transition count 125
Applied a total of 191 rules in 20 ms. Remains 70 /169 variables (removed 99) and now considering 125/217 (removed 92) transitions.
[2022-05-17 13:08:54] [INFO ] Flow matrix only has 80 transitions (discarded 45 similar events)
// Phase 1: matrix 80 rows 70 cols
[2022-05-17 13:08:54] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 13:08:54] [INFO ] Implicit Places using invariants in 44 ms returned [28, 52, 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 : 67/169 places, 125/217 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 58 transition count 116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 58 transition count 116
Applied a total of 18 rules in 2 ms. Remains 58 /67 variables (removed 9) and now considering 116/125 (removed 9) transitions.
[2022-05-17 13:08:54] [INFO ] Flow matrix only has 68 transitions (discarded 48 similar events)
// Phase 1: matrix 68 rows 58 cols
[2022-05-17 13:08:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:08:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-17 13:08:54] [INFO ] Flow matrix only has 68 transitions (discarded 48 similar events)
// Phase 1: matrix 68 rows 58 cols
[2022-05-17 13:08:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:08:54] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/169 places, 116/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/169 places, 116/217 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LT s55 1), p1:(OR (GEQ s51 1) (AND (GEQ s19 1) (GEQ s26 1))), p0:(AND (GEQ s36 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Computed a total of 58 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 116
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 p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2) p1)))
Knowledge based reduction with 9 factoid took 167 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-01 finished in 878 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0)) U p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Graph (complete) has 455 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 168 transition count 200
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 152 transition count 200
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 33 place count 152 transition count 184
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 65 place count 136 transition count 184
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 79 place count 122 transition count 170
Iterating global reduction 2 with 14 rules applied. Total rules applied 93 place count 122 transition count 170
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 105 place count 110 transition count 158
Iterating global reduction 2 with 12 rules applied. Total rules applied 117 place count 110 transition count 158
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 121 place count 106 transition count 158
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 121 place count 106 transition count 154
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 129 place count 102 transition count 154
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 141 place count 90 transition count 142
Iterating global reduction 3 with 12 rules applied. Total rules applied 153 place count 90 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 157 place count 86 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 161 place count 86 transition count 138
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 172 place count 75 transition count 127
Iterating global reduction 3 with 11 rules applied. Total rules applied 183 place count 75 transition count 127
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 211 place count 61 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 213 place count 59 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 215 place count 59 transition count 111
Applied a total of 215 rules in 43 ms. Remains 59 /169 variables (removed 110) and now considering 111/217 (removed 106) transitions.
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 68 transitions (discarded 43 similar events)
// Phase 1: matrix 68 rows 59 cols
[2022-05-17 13:08:55] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 13:08:55] [INFO ] Implicit Places using invariants in 44 ms returned [13, 19, 23, 27, 41, 45, 47]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 45 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/169 places, 111/217 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 52 transition count 110
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 51 transition count 110
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 11 place count 42 transition count 101
Iterating global reduction 0 with 9 rules applied. Total rules applied 20 place count 42 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 40 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 40 transition count 99
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 38 place count 33 transition count 92
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 31 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 31 transition count 90
Applied a total of 42 rules in 12 ms. Remains 31 /52 variables (removed 21) and now considering 90/111 (removed 21) transitions.
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 32 transitions (discarded 58 similar events)
// Phase 1: matrix 32 rows 31 cols
[2022-05-17 13:08:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:55] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 32 transitions (discarded 58 similar events)
// Phase 1: matrix 32 rows 31 cols
[2022-05-17 13:08:55] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/169 places, 90/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 31/169 places, 90/217 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s17 1) (GEQ s19 1))], 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-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-02 finished in 234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(p1)||F(p2)||p3)))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 154 transition count 202
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 154 transition count 202
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 140 transition count 188
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 140 transition count 188
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 136 transition count 188
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 77 place count 121 transition count 173
Iterating global reduction 1 with 15 rules applied. Total rules applied 92 place count 121 transition count 173
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 104 place count 109 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 116 place count 109 transition count 161
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 105 transition count 157
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 105 transition count 157
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 128 place count 101 transition count 153
Iterating global reduction 1 with 4 rules applied. Total rules applied 132 place count 101 transition count 153
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 143 place count 90 transition count 142
Iterating global reduction 1 with 11 rules applied. Total rules applied 154 place count 90 transition count 142
Applied a total of 154 rules in 8 ms. Remains 90 /169 variables (removed 79) and now considering 142/217 (removed 75) transitions.
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 99 transitions (discarded 43 similar events)
// Phase 1: matrix 99 rows 90 cols
[2022-05-17 13:08:55] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 13:08:55] [INFO ] Implicit Places using invariants in 56 ms returned [9, 42, 46, 50, 61, 65]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 62 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/169 places, 142/217 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 68 transition count 126
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 68 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 66 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 66 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 64 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 64 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 62 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 62 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 60 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 60 transition count 118
Applied a total of 48 rules in 8 ms. Remains 60 /84 variables (removed 24) and now considering 118/142 (removed 24) transitions.
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 67 transitions (discarded 51 similar events)
// Phase 1: matrix 67 rows 60 cols
[2022-05-17 13:08:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:08:55] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 67 transitions (discarded 51 similar events)
// Phase 1: matrix 67 rows 60 cols
[2022-05-17 13:08:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:08:55] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 60/169 places, 118/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/169 places, 118/217 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(GEQ s34 1), p3:(GEQ s47 1), p0:(GEQ s23 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-05 finished in 349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&(G(!p0)||F(p1))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 151 transition count 199
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 151 transition count 199
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 53 place count 134 transition count 182
Iterating global reduction 0 with 17 rules applied. Total rules applied 70 place count 134 transition count 182
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 128 transition count 182
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 96 place count 108 transition count 162
Iterating global reduction 1 with 20 rules applied. Total rules applied 116 place count 108 transition count 162
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 118 place count 106 transition count 162
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 136 place count 88 transition count 144
Iterating global reduction 2 with 18 rules applied. Total rules applied 154 place count 88 transition count 144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 162 place count 80 transition count 136
Iterating global reduction 2 with 8 rules applied. Total rules applied 170 place count 80 transition count 136
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 178 place count 72 transition count 128
Iterating global reduction 2 with 8 rules applied. Total rules applied 186 place count 72 transition count 128
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 206 place count 52 transition count 108
Iterating global reduction 2 with 20 rules applied. Total rules applied 226 place count 52 transition count 108
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 230 place count 48 transition count 104
Iterating global reduction 2 with 4 rules applied. Total rules applied 234 place count 48 transition count 104
Applied a total of 234 rules in 19 ms. Remains 48 /169 variables (removed 121) and now considering 104/217 (removed 113) transitions.
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 47 transitions (discarded 57 similar events)
// Phase 1: matrix 47 rows 48 cols
[2022-05-17 13:08:55] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 13:08:55] [INFO ] Implicit Places using invariants in 54 ms returned [23, 27, 33, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/169 places, 104/217 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 36 transition count 96
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 36 transition count 96
Applied a total of 16 rules in 0 ms. Remains 36 /44 variables (removed 8) and now considering 96/104 (removed 8) transitions.
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 36 transitions (discarded 60 similar events)
// Phase 1: matrix 36 rows 36 cols
[2022-05-17 13:08:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 13:08:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 36 transitions (discarded 60 similar events)
// Phase 1: matrix 36 rows 36 cols
[2022-05-17 13:08:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 13:08:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 36/169 places, 96/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 36/169 places, 96/217 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-06 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}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(OR (LT s23 1) (LT s28 1)), p1:(OR (LT s17 1) (LT s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 104 steps with 3 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-06 finished in 371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X((X(p1) U X(p0)))||G(p2)||p0)))'
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 154 transition count 202
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 154 transition count 202
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 140 transition count 188
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 140 transition count 188
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 135 transition count 188
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 79 place count 119 transition count 172
Iterating global reduction 1 with 16 rules applied. Total rules applied 95 place count 119 transition count 172
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 118 transition count 172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 109 place count 105 transition count 159
Iterating global reduction 2 with 13 rules applied. Total rules applied 122 place count 105 transition count 159
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 128 place count 99 transition count 153
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 99 transition count 153
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 140 place count 93 transition count 147
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 93 transition count 147
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 162 place count 77 transition count 131
Iterating global reduction 2 with 16 rules applied. Total rules applied 178 place count 77 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 180 place count 75 transition count 129
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 75 transition count 129
Applied a total of 182 rules in 14 ms. Remains 75 /169 variables (removed 94) and now considering 129/217 (removed 88) transitions.
[2022-05-17 13:08:55] [INFO ] Flow matrix only has 84 transitions (discarded 45 similar events)
// Phase 1: matrix 84 rows 75 cols
[2022-05-17 13:08:55] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-17 13:08:56] [INFO ] Implicit Places using invariants in 50 ms returned [33, 37, 48, 52]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/169 places, 129/217 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 58 transition count 116
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 58 transition count 116
Applied a total of 26 rules in 1 ms. Remains 58 /71 variables (removed 13) and now considering 116/129 (removed 13) transitions.
[2022-05-17 13:08:56] [INFO ] Flow matrix only has 68 transitions (discarded 48 similar events)
// Phase 1: matrix 68 rows 58 cols
[2022-05-17 13:08:56] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 13:08:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-17 13:08:56] [INFO ] Flow matrix only has 68 transitions (discarded 48 similar events)
// Phase 1: matrix 68 rows 58 cols
[2022-05-17 13:08:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:08:56] [INFO ] Implicit Places using invariants and state equation in 55 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 : 58/169 places, 116/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/169 places, 116/217 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 6}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=2, aps=[p0:(AND (GEQ s41 1) (GEQ s46 1)), p1:(GEQ s55 1), p2:(AND (GEQ s16 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-07 finished in 420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p0) U X(p1))))||G(p2)))'
Support contains 7 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Graph (complete) has 455 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 168 transition count 203
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 155 transition count 200
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 152 transition count 200
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 33 place count 152 transition count 183
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 67 place count 135 transition count 183
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 81 place count 121 transition count 169
Iterating global reduction 3 with 14 rules applied. Total rules applied 95 place count 121 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 95 place count 121 transition count 168
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 97 place count 120 transition count 168
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 108 place count 109 transition count 157
Iterating global reduction 3 with 11 rules applied. Total rules applied 119 place count 109 transition count 157
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 108 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 120 place count 108 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 107 transition count 156
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 131 place count 98 transition count 147
Iterating global reduction 4 with 9 rules applied. Total rules applied 140 place count 98 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 97 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 97 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 144 place count 95 transition count 144
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 95 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 4 with 38 rules applied. Total rules applied 184 place count 76 transition count 125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 74 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 74 transition count 123
Applied a total of 188 rules in 32 ms. Remains 74 /169 variables (removed 95) and now considering 123/217 (removed 94) transitions.
[2022-05-17 13:08:56] [INFO ] Flow matrix only has 92 transitions (discarded 31 similar events)
// Phase 1: matrix 92 rows 74 cols
[2022-05-17 13:08:56] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-17 13:08:56] [INFO ] Implicit Places using invariants in 58 ms returned [5, 11, 17, 33, 36, 41, 44, 56, 58]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 59 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/169 places, 123/217 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 55 transition count 113
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 55 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 50 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 50 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 42 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 42 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 37 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 36 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 36 transition count 94
Applied a total of 58 rules in 7 ms. Remains 36 /65 variables (removed 29) and now considering 94/123 (removed 29) transitions.
[2022-05-17 13:08:56] [INFO ] Flow matrix only has 39 transitions (discarded 55 similar events)
// Phase 1: matrix 39 rows 36 cols
[2022-05-17 13:08:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:08:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-17 13:08:56] [INFO ] Flow matrix only has 39 transitions (discarded 55 similar events)
// Phase 1: matrix 39 rows 36 cols
[2022-05-17 13:08:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:08:56] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/169 places, 94/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 36/169 places, 94/217 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s26 1))), p0:(AND (GEQ s3 1) (GEQ s25 1)), p1:(AND (GEQ s15 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6516 steps with 780 reset in 31 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-09 finished in 405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Graph (complete) has 455 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 168 transition count 200
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 152 transition count 200
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 33 place count 152 transition count 184
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 65 place count 136 transition count 184
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 78 place count 123 transition count 171
Iterating global reduction 2 with 13 rules applied. Total rules applied 91 place count 123 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 101 place count 113 transition count 161
Iterating global reduction 2 with 10 rules applied. Total rules applied 111 place count 113 transition count 161
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 110 transition count 161
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 114 place count 110 transition count 158
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 107 transition count 158
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 129 place count 98 transition count 149
Iterating global reduction 3 with 9 rules applied. Total rules applied 138 place count 98 transition count 149
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 96 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 96 transition count 147
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 148 place count 90 transition count 141
Iterating global reduction 3 with 6 rules applied. Total rules applied 154 place count 90 transition count 141
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 192 place count 71 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 68 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 68 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 199 place count 67 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 67 transition count 118
Applied a total of 200 rules in 23 ms. Remains 67 /169 variables (removed 102) and now considering 118/217 (removed 99) transitions.
[2022-05-17 13:08:56] [INFO ] Flow matrix only has 83 transitions (discarded 35 similar events)
// Phase 1: matrix 83 rows 67 cols
[2022-05-17 13:08:56] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 13:08:56] [INFO ] Implicit Places using invariants in 52 ms returned [13, 19, 23, 34, 37, 45, 51, 53]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 53 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/169 places, 118/217 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 47 transition count 106
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 47 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 45 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 45 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 43 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 43 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 35 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 33 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 33 transition count 92
Applied a total of 52 rules in 6 ms. Remains 33 /59 variables (removed 26) and now considering 92/118 (removed 26) transitions.
[2022-05-17 13:08:56] [INFO ] Flow matrix only has 38 transitions (discarded 54 similar events)
// Phase 1: matrix 38 rows 33 cols
[2022-05-17 13:08:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-17 13:08:56] [INFO ] Flow matrix only has 38 transitions (discarded 54 similar events)
// Phase 1: matrix 38 rows 33 cols
[2022-05-17 13:08:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:56] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/169 places, 92/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 33/169 places, 92/217 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s29 1), p1:(AND (GEQ s14 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-10 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 200
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 200
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 50 place count 136 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 66 place count 136 transition count 184
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 71 place count 131 transition count 184
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 90 place count 112 transition count 165
Iterating global reduction 1 with 19 rules applied. Total rules applied 109 place count 112 transition count 165
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 110 transition count 165
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 128 place count 93 transition count 148
Iterating global reduction 2 with 17 rules applied. Total rules applied 145 place count 93 transition count 148
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 152 place count 86 transition count 141
Iterating global reduction 2 with 7 rules applied. Total rules applied 159 place count 86 transition count 141
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 166 place count 79 transition count 134
Iterating global reduction 2 with 7 rules applied. Total rules applied 173 place count 79 transition count 134
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 189 place count 63 transition count 118
Iterating global reduction 2 with 16 rules applied. Total rules applied 205 place count 63 transition count 118
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 59 transition count 114
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 59 transition count 114
Applied a total of 213 rules in 10 ms. Remains 59 /169 variables (removed 110) and now considering 114/217 (removed 103) transitions.
[2022-05-17 13:08:57] [INFO ] Flow matrix only has 60 transitions (discarded 54 similar events)
// Phase 1: matrix 60 rows 59 cols
[2022-05-17 13:08:57] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 13:08:57] [INFO ] Implicit Places using invariants in 42 ms returned [23, 27, 43, 47]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/169 places, 114/217 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 45 transition count 104
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 45 transition count 104
Applied a total of 20 rules in 1 ms. Remains 45 /55 variables (removed 10) and now considering 104/114 (removed 10) transitions.
[2022-05-17 13:08:57] [INFO ] Flow matrix only has 47 transitions (discarded 57 similar events)
// Phase 1: matrix 47 rows 45 cols
[2022-05-17 13:08:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-17 13:08:57] [INFO ] Flow matrix only has 47 transitions (discarded 57 similar events)
// Phase 1: matrix 47 rows 45 cols
[2022-05-17 13:08:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:57] [INFO ] Implicit Places using invariants and state equation in 49 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 : 45/169 places, 104/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 45/169 places, 104/217 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s24 1) (GEQ s29 1)), p1:(AND (GEQ s16 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-12 finished in 313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Graph (complete) has 455 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 168 transition count 199
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 151 transition count 199
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 35 place count 151 transition count 182
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 69 place count 134 transition count 182
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 84 place count 119 transition count 167
Iterating global reduction 2 with 15 rules applied. Total rules applied 99 place count 119 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 99 place count 119 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 118 transition count 166
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 113 place count 106 transition count 154
Iterating global reduction 2 with 12 rules applied. Total rules applied 125 place count 106 transition count 154
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 105 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 126 place count 105 transition count 153
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 128 place count 104 transition count 153
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 137 place count 95 transition count 144
Iterating global reduction 3 with 9 rules applied. Total rules applied 146 place count 95 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 94 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 94 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 92 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 92 transition count 141
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 190 place count 73 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 71 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 71 transition count 120
Applied a total of 194 rules in 25 ms. Remains 71 /169 variables (removed 98) and now considering 120/217 (removed 97) transitions.
[2022-05-17 13:08:57] [INFO ] Flow matrix only has 89 transitions (discarded 31 similar events)
// Phase 1: matrix 89 rows 71 cols
[2022-05-17 13:08:57] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-17 13:08:57] [INFO ] Implicit Places using invariants in 63 ms returned [5, 11, 17, 23, 33, 38, 41, 49, 53, 55]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 64 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/169 places, 120/217 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 45 transition count 104
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 45 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 39 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 39 transition count 98
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 34 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 34 transition count 93
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 30 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 29 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 29 transition count 88
Applied a total of 64 rules in 6 ms. Remains 29 /61 variables (removed 32) and now considering 88/120 (removed 32) transitions.
[2022-05-17 13:08:57] [INFO ] Flow matrix only has 28 transitions (discarded 60 similar events)
// Phase 1: matrix 28 rows 29 cols
[2022-05-17 13:08:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-17 13:08:57] [INFO ] Flow matrix only has 28 transitions (discarded 60 similar events)
// Phase 1: matrix 28 rows 29 cols
[2022-05-17 13:08:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:57] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/169 places, 88/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 29/169 places, 88/217 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-13 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:(AND (GEQ s12 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-13 finished in 552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(p0 U p1))||G(p2))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 200
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 200
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 50 place count 136 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 66 place count 136 transition count 184
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 71 place count 131 transition count 184
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 89 place count 113 transition count 166
Iterating global reduction 1 with 18 rules applied. Total rules applied 107 place count 113 transition count 166
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 109 place count 111 transition count 166
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 126 place count 94 transition count 149
Iterating global reduction 2 with 17 rules applied. Total rules applied 143 place count 94 transition count 149
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 87 transition count 142
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 87 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 80 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 80 transition count 135
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 187 place count 64 transition count 119
Iterating global reduction 2 with 16 rules applied. Total rules applied 203 place count 64 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 207 place count 60 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 60 transition count 115
Applied a total of 211 rules in 15 ms. Remains 60 /169 variables (removed 109) and now considering 115/217 (removed 102) transitions.
[2022-05-17 13:08:57] [INFO ] Flow matrix only has 63 transitions (discarded 52 similar events)
// Phase 1: matrix 63 rows 60 cols
[2022-05-17 13:08:57] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 13:08:58] [INFO ] Implicit Places using invariants in 46 ms returned [33, 37, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/169 places, 115/217 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 50 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 50 transition count 108
Applied a total of 14 rules in 1 ms. Remains 50 /57 variables (removed 7) and now considering 108/115 (removed 7) transitions.
[2022-05-17 13:08:58] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 50 cols
[2022-05-17 13:08:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:08:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-17 13:08:58] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 50 cols
[2022-05-17 13:08:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:08:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/169 places, 108/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 50/169 places, 108/217 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, p1, (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s32 1) (GEQ s38 1) (GEQ s12 1) (GEQ s16 1)), p0:(AND (GEQ s12 1) (GEQ s16 1)), p2:(OR (LT s32 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 148 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Computed a total of 50 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 108
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 p1) (NOT p0) p2), (X p2), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p2 p1))))
Knowledge based reduction with 11 factoid took 204 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-14 finished in 918 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(!(X(p1) U X(p2))||G(!p0)))))'
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 217/217 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 200
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 200
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 50 place count 136 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 66 place count 136 transition count 184
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 72 place count 130 transition count 184
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 91 place count 111 transition count 165
Iterating global reduction 1 with 19 rules applied. Total rules applied 110 place count 111 transition count 165
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 109 transition count 165
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 130 place count 91 transition count 147
Iterating global reduction 2 with 18 rules applied. Total rules applied 148 place count 91 transition count 147
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 156 place count 83 transition count 139
Iterating global reduction 2 with 8 rules applied. Total rules applied 164 place count 83 transition count 139
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 172 place count 75 transition count 131
Iterating global reduction 2 with 8 rules applied. Total rules applied 180 place count 75 transition count 131
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 200 place count 55 transition count 111
Iterating global reduction 2 with 20 rules applied. Total rules applied 220 place count 55 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 224 place count 51 transition count 107
Iterating global reduction 2 with 4 rules applied. Total rules applied 228 place count 51 transition count 107
Applied a total of 228 rules in 14 ms. Remains 51 /169 variables (removed 118) and now considering 107/217 (removed 110) transitions.
[2022-05-17 13:08:58] [INFO ] Flow matrix only has 52 transitions (discarded 55 similar events)
// Phase 1: matrix 52 rows 51 cols
[2022-05-17 13:08:58] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 13:08:58] [INFO ] Implicit Places using invariants in 68 ms returned [26, 36, 40]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 69 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/169 places, 107/217 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 42 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 42 transition count 101
Applied a total of 12 rules in 1 ms. Remains 42 /48 variables (removed 6) and now considering 101/107 (removed 6) transitions.
[2022-05-17 13:08:58] [INFO ] Flow matrix only has 43 transitions (discarded 58 similar events)
// Phase 1: matrix 43 rows 42 cols
[2022-05-17 13:08:58] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:08:58] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-17 13:08:58] [INFO ] Flow matrix only has 43 transitions (discarded 58 similar events)
// Phase 1: matrix 43 rows 42 cols
[2022-05-17 13:08:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:08:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/169 places, 101/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 42/169 places, 101/217 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) p2), (NOT p0), p2]
Running random walk in product with property : LeafsetExtension-PT-S08C4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={1} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s6 1), p2:(AND (GEQ s16 1) (GEQ s20 1)), p1:(AND (GEQ s17 1) (GEQ s25 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C4-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C4-LTLFireability-15 finished in 278 ms.
All properties solved by simple procedures.
Total runtime 8261 ms.

BK_STOP 1652792939526

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820900468"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;