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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 11K Apr 29 12:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 12:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 12:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 12:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K 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-S08C3-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652792158743

Running Version 202205111006
[2022-05-17 12:55:59] [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 12:55:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 12:56:00] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2022-05-17 12:56:00] [INFO ] Transformed 462 places.
[2022-05-17 12:56:00] [INFO ] Transformed 409 transitions.
[2022-05-17 12:56:00] [INFO ] Parsed PT model containing 462 places and 409 transitions in 203 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-S08C3-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 150 place count 312 transition count 344
Iterating global reduction 1 with 65 rules applied. Total rules applied 215 place count 312 transition count 344
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 260 place count 267 transition count 299
Iterating global reduction 1 with 45 rules applied. Total rules applied 305 place count 267 transition count 299
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 349 place count 223 transition count 255
Iterating global reduction 1 with 44 rules applied. Total rules applied 393 place count 223 transition count 255
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 403 place count 213 transition count 255
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 411 place count 205 transition count 247
Iterating global reduction 2 with 8 rules applied. Total rules applied 419 place count 205 transition count 247
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 427 place count 197 transition count 239
Iterating global reduction 2 with 8 rules applied. Total rules applied 435 place count 197 transition count 239
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 442 place count 190 transition count 232
Iterating global reduction 2 with 7 rules applied. Total rules applied 449 place count 190 transition count 232
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 456 place count 183 transition count 225
Iterating global reduction 2 with 7 rules applied. Total rules applied 463 place count 183 transition count 225
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 484 place count 162 transition count 204
Iterating global reduction 2 with 21 rules applied. Total rules applied 505 place count 162 transition count 204
Applied a total of 505 rules in 100 ms. Remains 162 /462 variables (removed 300) and now considering 204/409 (removed 205) transitions.
[2022-05-17 12:56:00] [INFO ] Flow matrix only has 184 transitions (discarded 20 similar events)
// Phase 1: matrix 184 rows 162 cols
[2022-05-17 12:56:00] [INFO ] Computed 20 place invariants in 21 ms
[2022-05-17 12:56:00] [INFO ] Implicit Places using invariants in 337 ms returned [34, 54, 74, 89, 95, 123]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 363 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/462 places, 204/409 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 143 transition count 191
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 143 transition count 191
Applied a total of 26 rules in 5 ms. Remains 143 /156 variables (removed 13) and now considering 191/204 (removed 13) transitions.
[2022-05-17 12:56:00] [INFO ] Flow matrix only has 169 transitions (discarded 22 similar events)
// Phase 1: matrix 169 rows 143 cols
[2022-05-17 12:56:00] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-17 12:56:00] [INFO ] Implicit Places using invariants in 71 ms returned []
[2022-05-17 12:56:00] [INFO ] Flow matrix only has 169 transitions (discarded 22 similar events)
// Phase 1: matrix 169 rows 143 cols
[2022-05-17 12:56:00] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 12:56:02] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 1583 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/462 places, 191/409 transitions.
Finished structural reductions, in 2 iterations. Remains : 143/462 places, 191/409 transitions.
Support contains 35 out of 143 places after structural reductions.
[2022-05-17 12:56:02] [INFO ] Flatten gal took : 38 ms
[2022-05-17 12:56:02] [INFO ] Flatten gal took : 18 ms
[2022-05-17 12:56:02] [INFO ] Input system was already deterministic with 191 transitions.
Support contains 34 out of 143 places (down from 35) after GAL structural reductions.
Finished random walk after 1851 steps, including 66 resets, run visited all 23 properties in 138 ms. (steps per millisecond=13 )
Computed a total of 143 stabilizing places and 191 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 143 transition count 191
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' '!(F(X((X(p0)||(F(p0)&&p1)))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 179
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 179
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 122 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 122 transition count 170
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 120 transition count 170
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 108 transition count 158
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 108 transition count 158
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 103 transition count 158
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 94 transition count 149
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 94 transition count 149
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 87 transition count 142
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 87 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 112 place count 80 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 119 place count 80 transition count 135
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 128 place count 71 transition count 126
Iterating global reduction 2 with 9 rules applied. Total rules applied 137 place count 71 transition count 126
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 152 place count 56 transition count 111
Iterating global reduction 2 with 15 rules applied. Total rules applied 167 place count 56 transition count 111
Applied a total of 167 rules in 13 ms. Remains 56 /143 variables (removed 87) and now considering 111/191 (removed 80) transitions.
[2022-05-17 12:56:03] [INFO ] Flow matrix only has 57 transitions (discarded 54 similar events)
// Phase 1: matrix 57 rows 56 cols
[2022-05-17 12:56:03] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-17 12:56:03] [INFO ] Implicit Places using invariants in 64 ms returned [16, 24, 41, 47]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/143 places, 111/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 46 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 46 transition count 105
Applied a total of 12 rules in 1 ms. Remains 46 /52 variables (removed 6) and now considering 105/111 (removed 6) transitions.
[2022-05-17 12:56:03] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2022-05-17 12:56:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:03] [INFO ] Implicit Places using invariants in 72 ms returned []
[2022-05-17 12:56:03] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2022-05-17 12:56:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:03] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/143 places, 105/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 46/143 places, 105/191 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s23 1)), p0:(LT s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 34624 reset in 249 ms.
Product exploration explored 100000 steps with 34599 reset in 171 ms.
Computed a total of 46 stabilizing places and 105 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 105
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p0))), (X (NOT (OR (NOT p1) (NOT p0))))]
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-00 finished in 1189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(p0))))'
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 179
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 179
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 122 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 122 transition count 170
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 120 transition count 170
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 108 transition count 158
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 108 transition count 158
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 103 transition count 158
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 81 place count 95 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 89 place count 95 transition count 150
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 88 transition count 143
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 88 transition count 143
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 110 place count 81 transition count 136
Iterating global reduction 2 with 7 rules applied. Total rules applied 117 place count 81 transition count 136
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 126 place count 72 transition count 127
Iterating global reduction 2 with 9 rules applied. Total rules applied 135 place count 72 transition count 127
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 149 place count 58 transition count 113
Iterating global reduction 2 with 14 rules applied. Total rules applied 163 place count 58 transition count 113
Applied a total of 163 rules in 13 ms. Remains 58 /143 variables (removed 85) and now considering 113/191 (removed 78) transitions.
[2022-05-17 12:56:04] [INFO ] Flow matrix only has 59 transitions (discarded 54 similar events)
// Phase 1: matrix 59 rows 58 cols
[2022-05-17 12:56:04] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 12:56:04] [INFO ] Implicit Places using invariants in 75 ms returned [16, 35, 43, 49]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/143 places, 113/191 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 46 transition count 105
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 46 transition count 105
Applied a total of 16 rules in 1 ms. Remains 46 /54 variables (removed 8) and now considering 105/113 (removed 8) transitions.
[2022-05-17 12:56:04] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2022-05-17 12:56:04] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-17 12:56:04] [INFO ] Implicit Places using invariants in 360 ms returned []
[2022-05-17 12:56:04] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2022-05-17 12:56:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:04] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/143 places, 105/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 46/143 places, 105/191 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-01 finished in 616 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(X(F(X(X(p0)))))))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 179
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 179
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 122 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 122 transition count 170
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 121 transition count 170
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 110 transition count 159
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 110 transition count 159
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 104 transition count 159
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 95 transition count 150
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 95 transition count 150
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 88 transition count 143
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 88 transition count 143
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 110 place count 81 transition count 136
Iterating global reduction 2 with 7 rules applied. Total rules applied 117 place count 81 transition count 136
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 124 place count 74 transition count 129
Iterating global reduction 2 with 7 rules applied. Total rules applied 131 place count 74 transition count 129
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 148 place count 57 transition count 112
Iterating global reduction 2 with 17 rules applied. Total rules applied 165 place count 57 transition count 112
Applied a total of 165 rules in 17 ms. Remains 57 /143 variables (removed 86) and now considering 112/191 (removed 79) transitions.
[2022-05-17 12:56:04] [INFO ] Flow matrix only has 58 transitions (discarded 54 similar events)
// Phase 1: matrix 58 rows 57 cols
[2022-05-17 12:56:04] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 12:56:04] [INFO ] Implicit Places using invariants in 50 ms returned [16, 24, 32, 48]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/143 places, 112/191 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 45 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 45 transition count 104
Applied a total of 16 rules in 1 ms. Remains 45 /53 variables (removed 8) and now considering 104/112 (removed 8) transitions.
[2022-05-17 12:56:04] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
// Phase 1: matrix 48 rows 45 cols
[2022-05-17 12:56:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:04] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-17 12:56:04] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
// Phase 1: matrix 48 rows 45 cols
[2022-05-17 12:56:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:04] [INFO ] Implicit Places using invariants and state equation in 48 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 : 45/143 places, 104/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 45/143 places, 104/191 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(AND (GEQ s33 1) (GEQ s35 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]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-02 finished in 433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Graph (complete) has 399 edges and 143 vertex of which 142 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 170
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 122 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 112 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 107 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 107 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 104 transition count 152
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 104 transition count 152
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 102 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 79 place count 102 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 100 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 98 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 98 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 96 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 96 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 92 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 92 transition count 142
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 135 place count 74 transition count 124
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 141 place count 68 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 68 transition count 118
Applied a total of 147 rules in 42 ms. Remains 68 /143 variables (removed 75) and now considering 118/191 (removed 73) transitions.
[2022-05-17 12:56:05] [INFO ] Flow matrix only has 86 transitions (discarded 32 similar events)
// Phase 1: matrix 86 rows 68 cols
[2022-05-17 12:56:05] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 12:56:05] [INFO ] Implicit Places using invariants in 55 ms returned [8, 11, 18, 27, 32, 35, 43, 47, 49, 57]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 56 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/143 places, 118/191 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 44 transition count 104
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 44 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 40 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 40 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 36 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 36 transition count 96
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 58 place count 29 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 27 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 27 transition count 87
Applied a total of 62 rules in 8 ms. Remains 27 /58 variables (removed 31) and now considering 87/118 (removed 31) transitions.
[2022-05-17 12:56:05] [INFO ] Flow matrix only has 29 transitions (discarded 58 similar events)
// Phase 1: matrix 29 rows 27 cols
[2022-05-17 12:56:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 12:56:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-17 12:56:05] [INFO ] Flow matrix only has 29 transitions (discarded 58 similar events)
// Phase 1: matrix 29 rows 27 cols
[2022-05-17 12:56:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 12:56:05] [INFO ] Implicit Places using invariants and state equation in 39 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 : 27/143 places, 87/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 27/143 places, 87/191 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-03 finished in 222 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((G((p0 U X(p1)))&&p0)))||F(p2)))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 133 transition count 181
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 133 transition count 181
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 126 transition count 174
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 126 transition count 174
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 124 transition count 174
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 114 transition count 164
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 114 transition count 164
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 111 transition count 164
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 105 transition count 158
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 105 transition count 158
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 100 transition count 153
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 100 transition count 153
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 95 transition count 148
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 95 transition count 148
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 88 transition count 141
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 88 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 113 place count 80 transition count 133
Iterating global reduction 2 with 8 rules applied. Total rules applied 121 place count 80 transition count 133
Applied a total of 121 rules in 22 ms. Remains 80 /143 variables (removed 63) and now considering 133/191 (removed 58) transitions.
[2022-05-17 12:56:05] [INFO ] Flow matrix only has 87 transitions (discarded 46 similar events)
// Phase 1: matrix 87 rows 80 cols
[2022-05-17 12:56:05] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 12:56:05] [INFO ] Implicit Places using invariants in 50 ms returned [16, 45, 53, 69]
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 : 76/143 places, 133/191 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 66 transition count 123
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 66 transition count 123
Applied a total of 20 rules in 1 ms. Remains 66 /76 variables (removed 10) and now considering 123/133 (removed 10) transitions.
[2022-05-17 12:56:05] [INFO ] Flow matrix only has 75 transitions (discarded 48 similar events)
// Phase 1: matrix 75 rows 66 cols
[2022-05-17 12:56:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 12:56:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-17 12:56:05] [INFO ] Flow matrix only has 75 transitions (discarded 48 similar events)
// Phase 1: matrix 75 rows 66 cols
[2022-05-17 12:56:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 12:56:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/143 places, 123/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 66/143 places, 123/191 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(GEQ s33 1), p0:(GEQ s22 1), p1:(GEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-05 finished in 551 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 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Graph (complete) has 399 edges and 143 vertex of which 142 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 170
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 170
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 41 place count 122 transition count 159
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 63 place count 111 transition count 159
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 106 transition count 154
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 106 transition count 154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 100 transition count 148
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 100 transition count 148
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 98 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 87 place count 98 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 96 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 94 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 94 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 92 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 92 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 88 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 88 transition count 138
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 141 place count 71 transition count 121
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 147 place count 65 transition count 115
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 65 transition count 115
Applied a total of 153 rules in 31 ms. Remains 65 /143 variables (removed 78) and now considering 115/191 (removed 76) transitions.
[2022-05-17 12:56:06] [INFO ] Flow matrix only has 80 transitions (discarded 35 similar events)
// Phase 1: matrix 80 rows 65 cols
[2022-05-17 12:56:06] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 12:56:06] [INFO ] Implicit Places using invariants in 51 ms returned [11, 18, 23, 28, 31, 40, 44, 46, 54]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 51 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/143 places, 115/191 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 45 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 45 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 41 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 41 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 37 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 37 transition count 96
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 31 transition count 90
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 29 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 29 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 28 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 28 transition count 87
Applied a total of 56 rules in 27 ms. Remains 28 /56 variables (removed 28) and now considering 87/115 (removed 28) transitions.
[2022-05-17 12:56:06] [INFO ] Flow matrix only has 26 transitions (discarded 61 similar events)
// Phase 1: matrix 26 rows 28 cols
[2022-05-17 12:56:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-17 12:56:06] [INFO ] Flow matrix only has 26 transitions (discarded 61 similar events)
// Phase 1: matrix 26 rows 28 cols
[2022-05-17 12:56:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:56:06] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/143 places, 87/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 28/143 places, 87/191 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-06 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:(OR (LT s5 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9030 reset in 214 ms.
Product exploration explored 100000 steps with 9036 reset in 153 ms.
Computed a total of 28 stabilizing places and 87 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 87
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-06 finished in 743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0)) U p0) U (p1 U (X(G(p3))&&p2))))'
Support contains 7 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 179
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 179
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 122 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 122 transition count 170
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 121 transition count 170
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 111 transition count 160
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 111 transition count 160
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 68 place count 106 transition count 160
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 99 transition count 153
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 99 transition count 153
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 93 transition count 147
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 93 transition count 147
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 88 transition count 142
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 88 transition count 142
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 82 transition count 136
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 82 transition count 136
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 126 place count 72 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 136 place count 72 transition count 126
Applied a total of 136 rules in 11 ms. Remains 72 /143 variables (removed 71) and now considering 126/191 (removed 65) transitions.
[2022-05-17 12:56:06] [INFO ] Flow matrix only has 81 transitions (discarded 45 similar events)
// Phase 1: matrix 81 rows 72 cols
[2022-05-17 12:56:06] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 12:56:06] [INFO ] Implicit Places using invariants in 56 ms returned [16, 21, 46, 62]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/143 places, 126/191 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 58 transition count 116
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 58 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 57 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 57 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 56 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 56 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 55 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 55 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 54 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 54 transition count 112
Applied a total of 28 rules in 3 ms. Remains 54 /68 variables (removed 14) and now considering 112/126 (removed 14) transitions.
[2022-05-17 12:56:06] [INFO ] Flow matrix only has 63 transitions (discarded 49 similar events)
// Phase 1: matrix 63 rows 54 cols
[2022-05-17 12:56:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 12:56:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-17 12:56:06] [INFO ] Flow matrix only has 63 transitions (discarded 49 similar events)
// Phase 1: matrix 63 rows 54 cols
[2022-05-17 12:56:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 12:56:06] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/143 places, 112/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/143 places, 112/191 transitions.
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), true, (NOT p3), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={0} source=0 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(OR (AND p2 (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p2 p1 (NOT p0)) (AND p1 (NOT p0) p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p2 (NOT p1) p0) (AND (NOT p1) p0 p3)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p2 p1 p0) (AND p1 p0 p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(OR (AND p2 (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(OR (AND p2 p1 (NOT p0)) (AND p1 (NOT p0) p3)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p2 p1), acceptance={0} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p3)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=9 dest: 8}, { cond=(AND p1 p3), acceptance={} source=9 dest: 9}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s27 1) (GEQ s49 1)), p1:(OR (GEQ s16 1) (AND (GEQ s22 1) (GEQ s36 1))), p0:(AND (GEQ s22 1) (GEQ s36 1)), p3:(AND (GEQ s39 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-07 finished in 664 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U G(!p1))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Graph (complete) has 399 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 142 transition count 172
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 124 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 122 transition count 170
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 41 place count 122 transition count 159
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 63 place count 111 transition count 159
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 68 place count 106 transition count 154
Iterating global reduction 3 with 5 rules applied. Total rules applied 73 place count 106 transition count 154
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 79 place count 100 transition count 148
Iterating global reduction 3 with 6 rules applied. Total rules applied 85 place count 100 transition count 148
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 98 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 87 place count 98 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 91 place count 96 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 93 place count 94 transition count 144
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 94 transition count 144
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 97 place count 92 transition count 142
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 92 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 103 place count 88 transition count 138
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 88 transition count 138
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 141 place count 71 transition count 121
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 147 place count 65 transition count 115
Iterating global reduction 4 with 6 rules applied. Total rules applied 153 place count 65 transition count 115
Applied a total of 153 rules in 23 ms. Remains 65 /143 variables (removed 78) and now considering 115/191 (removed 76) transitions.
[2022-05-17 12:56:07] [INFO ] Flow matrix only has 80 transitions (discarded 35 similar events)
// Phase 1: matrix 80 rows 65 cols
[2022-05-17 12:56:07] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 12:56:07] [INFO ] Implicit Places using invariants in 55 ms returned [8, 11, 18, 23, 28, 31, 40, 46, 54]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 56 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/143 places, 115/191 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 49 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 49 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 45 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 45 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 39 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 39 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 46 place count 33 transition count 92
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 31 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 31 transition count 90
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 29 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 29 transition count 88
Applied a total of 54 rules in 6 ms. Remains 29 /56 variables (removed 27) and now considering 88/115 (removed 27) transitions.
[2022-05-17 12:56:07] [INFO ] Flow matrix only has 28 transitions (discarded 60 similar events)
// Phase 1: matrix 28 rows 29 cols
[2022-05-17 12:56:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:07] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-17 12:56:07] [INFO ] Flow matrix only has 28 transitions (discarded 60 similar events)
// Phase 1: matrix 28 rows 29 cols
[2022-05-17 12:56:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/143 places, 88/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 29/143 places, 88/191 transitions.
Stuttering acceptance computed with spot in 101 ms :[p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s15 1) (GEQ s19 1)), p0:(AND (GEQ s1 1) (GEQ s11 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 235 steps with 20 reset in 2 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-08 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&p1)))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 179
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 179
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 122 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 122 transition count 170
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 120 transition count 170
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 108 transition count 158
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 108 transition count 158
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 103 transition count 158
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 94 transition count 149
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 94 transition count 149
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 87 transition count 142
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 87 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 112 place count 80 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 119 place count 80 transition count 135
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 128 place count 71 transition count 126
Iterating global reduction 2 with 9 rules applied. Total rules applied 137 place count 71 transition count 126
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 151 place count 57 transition count 112
Iterating global reduction 2 with 14 rules applied. Total rules applied 165 place count 57 transition count 112
Applied a total of 165 rules in 12 ms. Remains 57 /143 variables (removed 86) and now considering 112/191 (removed 79) transitions.
[2022-05-17 12:56:07] [INFO ] Flow matrix only has 58 transitions (discarded 54 similar events)
// Phase 1: matrix 58 rows 57 cols
[2022-05-17 12:56:07] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 12:56:07] [INFO ] Implicit Places using invariants in 44 ms returned [16, 24, 42, 48]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/143 places, 112/191 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 46 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 46 transition count 105
Applied a total of 14 rules in 1 ms. Remains 46 /53 variables (removed 7) and now considering 105/112 (removed 7) transitions.
[2022-05-17 12:56:07] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2022-05-17 12:56:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:56:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-17 12:56:07] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2022-05-17 12:56:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:07] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/143 places, 105/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 46/143 places, 105/191 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s26 1) (AND (GEQ s31 1) (GEQ s32 1))), p0:(AND (GEQ s18 1) (GEQ s34 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-09 finished in 329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U (p0 U p1)))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 179
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 179
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 123 transition count 171
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 123 transition count 171
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 122 transition count 171
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 111 transition count 160
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 111 transition count 160
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 68 place count 106 transition count 160
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 99 transition count 153
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 99 transition count 153
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 93 transition count 147
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 93 transition count 147
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 87 transition count 141
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 87 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 114 place count 79 transition count 133
Iterating global reduction 2 with 8 rules applied. Total rules applied 122 place count 79 transition count 133
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 135 place count 66 transition count 120
Iterating global reduction 2 with 13 rules applied. Total rules applied 148 place count 66 transition count 120
Applied a total of 148 rules in 15 ms. Remains 66 /143 variables (removed 77) and now considering 120/191 (removed 71) transitions.
[2022-05-17 12:56:08] [INFO ] Flow matrix only has 70 transitions (discarded 50 similar events)
// Phase 1: matrix 70 rows 66 cols
[2022-05-17 12:56:08] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 12:56:08] [INFO ] Implicit Places using invariants in 47 ms returned [16, 34, 42, 49, 56]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 49 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/143 places, 120/191 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 51 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 51 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 50 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 50 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 49 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 49 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 48 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 48 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 47 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 47 transition count 106
Applied a total of 28 rules in 3 ms. Remains 47 /61 variables (removed 14) and now considering 106/120 (removed 14) transitions.
[2022-05-17 12:56:08] [INFO ] Flow matrix only has 51 transitions (discarded 55 similar events)
// Phase 1: matrix 51 rows 47 cols
[2022-05-17 12:56:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:56:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-17 12:56:08] [INFO ] Flow matrix only has 51 transitions (discarded 55 similar events)
// Phase 1: matrix 51 rows 47 cols
[2022-05-17 12:56:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:56:08] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 47/143 places, 106/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 47/143 places, 106/191 transitions.
Stuttering acceptance computed with spot in 73 ms :[p1, p1]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s20 1) (GEQ s25 1)), p1:(GEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Computed a total of 47 stabilizing places and 106 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 106
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 p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 7 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-10 finished in 741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(p0 U p1)||(F(!p1)&&!p0)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 130 transition count 178
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 130 transition count 178
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 121 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 121 transition count 169
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 119 transition count 169
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 107 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 107 transition count 157
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 102 transition count 157
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 83 place count 94 transition count 149
Iterating global reduction 2 with 8 rules applied. Total rules applied 91 place count 94 transition count 149
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 87 transition count 142
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 87 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 112 place count 80 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 119 place count 80 transition count 135
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 128 place count 71 transition count 126
Iterating global reduction 2 with 9 rules applied. Total rules applied 137 place count 71 transition count 126
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 150 place count 58 transition count 113
Iterating global reduction 2 with 13 rules applied. Total rules applied 163 place count 58 transition count 113
Applied a total of 163 rules in 11 ms. Remains 58 /143 variables (removed 85) and now considering 113/191 (removed 78) transitions.
[2022-05-17 12:56:08] [INFO ] Flow matrix only has 60 transitions (discarded 53 similar events)
// Phase 1: matrix 60 rows 58 cols
[2022-05-17 12:56:08] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 12:56:08] [INFO ] Implicit Places using invariants in 65 ms returned [16, 35, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/143 places, 113/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 49 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 49 transition count 107
Applied a total of 12 rules in 2 ms. Remains 49 /55 variables (removed 6) and now considering 107/113 (removed 6) transitions.
[2022-05-17 12:56:08] [INFO ] Flow matrix only has 52 transitions (discarded 55 similar events)
// Phase 1: matrix 52 rows 49 cols
[2022-05-17 12:56:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 12:56:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-17 12:56:08] [INFO ] Flow matrix only has 52 transitions (discarded 55 similar events)
// Phase 1: matrix 52 rows 49 cols
[2022-05-17 12:56:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 12:56:08] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/143 places, 107/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 49/143 places, 107/191 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, p1, p1, p1, p1, p1]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s28 1) (GEQ s40 1)), p0:(AND (GEQ s17 1) (GEQ s23 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32804 reset in 118 ms.
Product exploration explored 100000 steps with 32809 reset in 129 ms.
Computed a total of 49 stabilizing places and 107 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 107
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)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-11 finished in 842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))&&(F(p2) U p1)&&F(p3)))'
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 191/191 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 132 transition count 180
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 132 transition count 180
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 124 transition count 172
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 124 transition count 172
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 115 transition count 163
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 115 transition count 163
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 110 transition count 163
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 103 transition count 156
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 103 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 98 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 98 transition count 151
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 93 transition count 146
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 93 transition count 146
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 88 transition count 141
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 88 transition count 141
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 118 place count 75 transition count 128
Iterating global reduction 1 with 13 rules applied. Total rules applied 131 place count 75 transition count 128
Applied a total of 131 rules in 15 ms. Remains 75 /143 variables (removed 68) and now considering 128/191 (removed 63) transitions.
[2022-05-17 12:56:09] [INFO ] Flow matrix only has 82 transitions (discarded 46 similar events)
// Phase 1: matrix 82 rows 75 cols
[2022-05-17 12:56:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 12:56:09] [INFO ] Implicit Places using invariants in 52 ms returned [16, 24, 29, 40, 55, 64]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 53 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/143 places, 128/191 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 57 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 57 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 55 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 55 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 53 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 53 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 51 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 51 transition count 110
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 49 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 49 transition count 108
Applied a total of 40 rules in 4 ms. Remains 49 /69 variables (removed 20) and now considering 108/128 (removed 20) transitions.
[2022-05-17 12:56:09] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 49 cols
[2022-05-17 12:56:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:56:09] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-17 12:56:09] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 49 cols
[2022-05-17 12:56:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:56:09] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/143 places, 108/191 transitions.
Finished structural reductions, in 2 iterations. Remains : 49/143 places, 108/191 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, p1, (NOT p2), (NOT p1), (NOT p3), true]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s35 1) (GEQ s39 1)), p2:(LT s37 1), p3:(AND (GEQ s1 1) (GEQ s24 1)), p0:(GEQ s21 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-14 finished in 405 ms.
All properties solved by simple procedures.
Total runtime 10130 ms.

BK_STOP 1652792170400

--------------------
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-S08C3"
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-S08C3, 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-165271820900460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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