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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 11K Apr 29 12:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 12:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 12:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 12:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 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 3.4M 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-S32C3-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652798919229

Running Version 202205111006
[2022-05-17 14:48:40] [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 14:48:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 14:48:40] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2022-05-17 14:48:40] [INFO ] Transformed 5622 places.
[2022-05-17 14:48:40] [INFO ] Transformed 5449 transitions.
[2022-05-17 14:48:40] [INFO ] Parsed PT model containing 5622 places and 5449 transitions in 481 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 5622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1093 places and 0 transitions.
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 4529 transition count 5449
Discarding 1049 places :
Symmetric choice reduction at 1 with 1049 rule applications. Total rules 2142 place count 3480 transition count 4400
Iterating global reduction 1 with 1049 rules applied. Total rules applied 3191 place count 3480 transition count 4400
Discarding 981 places :
Symmetric choice reduction at 1 with 981 rule applications. Total rules 4172 place count 2499 transition count 3419
Iterating global reduction 1 with 981 rules applied. Total rules applied 5153 place count 2499 transition count 3419
Discarding 976 places :
Symmetric choice reduction at 1 with 976 rule applications. Total rules 6129 place count 1523 transition count 2443
Iterating global reduction 1 with 976 rules applied. Total rules applied 7105 place count 1523 transition count 2443
Discarding 53 places :
Implicit places reduction removed 53 places
Iterating post reduction 1 with 53 rules applied. Total rules applied 7158 place count 1470 transition count 2443
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 7209 place count 1419 transition count 2392
Iterating global reduction 2 with 51 rules applied. Total rules applied 7260 place count 1419 transition count 2392
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 7311 place count 1368 transition count 2341
Iterating global reduction 2 with 51 rules applied. Total rules applied 7362 place count 1368 transition count 2341
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 7413 place count 1317 transition count 2290
Iterating global reduction 2 with 51 rules applied. Total rules applied 7464 place count 1317 transition count 2290
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 7515 place count 1266 transition count 2239
Iterating global reduction 2 with 51 rules applied. Total rules applied 7566 place count 1266 transition count 2239
Discarding 776 places :
Symmetric choice reduction at 2 with 776 rule applications. Total rules 8342 place count 490 transition count 1463
Iterating global reduction 2 with 776 rules applied. Total rules applied 9118 place count 490 transition count 1463
Applied a total of 9118 rules in 2603 ms. Remains 490 /5622 variables (removed 5132) and now considering 1463/5449 (removed 3986) transitions.
[2022-05-17 14:48:43] [INFO ] Flow matrix only has 688 transitions (discarded 775 similar events)
// Phase 1: matrix 688 rows 490 cols
[2022-05-17 14:48:43] [INFO ] Computed 49 place invariants in 31 ms
[2022-05-17 14:48:44] [INFO ] Implicit Places using invariants in 512 ms returned [43, 48, 72, 93, 122, 126, 131, 135, 139, 145, 149, 207, 212, 216, 220, 222, 251, 271, 297, 303, 307, 312, 332, 368, 399, 425, 451, 461, 465, 469]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 542 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 460/5622 places, 1463/5449 transitions.
Discarding 182 places :
Symmetric choice reduction at 0 with 182 rule applications. Total rules 182 place count 278 transition count 1281
Iterating global reduction 0 with 182 rules applied. Total rules applied 364 place count 278 transition count 1281
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 368 place count 274 transition count 1277
Iterating global reduction 0 with 4 rules applied. Total rules applied 372 place count 274 transition count 1277
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 376 place count 270 transition count 1273
Iterating global reduction 0 with 4 rules applied. Total rules applied 380 place count 270 transition count 1273
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 384 place count 266 transition count 1269
Iterating global reduction 0 with 4 rules applied. Total rules applied 388 place count 266 transition count 1269
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 409 place count 245 transition count 1248
Iterating global reduction 0 with 21 rules applied. Total rules applied 430 place count 245 transition count 1248
Applied a total of 430 rules in 48 ms. Remains 245 /460 variables (removed 215) and now considering 1248/1463 (removed 215) transitions.
[2022-05-17 14:48:44] [INFO ] Flow matrix only has 391 transitions (discarded 857 similar events)
// Phase 1: matrix 391 rows 245 cols
[2022-05-17 14:48:44] [INFO ] Computed 19 place invariants in 9 ms
[2022-05-17 14:48:44] [INFO ] Implicit Places using invariants in 156 ms returned []
[2022-05-17 14:48:44] [INFO ] Flow matrix only has 391 transitions (discarded 857 similar events)
// Phase 1: matrix 391 rows 245 cols
[2022-05-17 14:48:44] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-17 14:48:44] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 245/5622 places, 1248/5449 transitions.
Finished structural reductions, in 2 iterations. Remains : 245/5622 places, 1248/5449 transitions.
Support contains 43 out of 245 places after structural reductions.
[2022-05-17 14:48:45] [INFO ] Flatten gal took : 100 ms
[2022-05-17 14:48:45] [INFO ] Flatten gal took : 72 ms
[2022-05-17 14:48:45] [INFO ] Input system was already deterministic with 1248 transitions.
Finished random walk after 5238 steps, including 193 resets, run visited all 28 properties in 292 ms. (steps per millisecond=17 )
Computed a total of 245 stabilizing places and 1248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 1248
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 224 transition count 1227
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 224 transition count 1227
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 210 transition count 1213
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 210 transition count 1213
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 207 transition count 1213
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 84 place count 196 transition count 1202
Iterating global reduction 1 with 11 rules applied. Total rules applied 95 place count 196 transition count 1202
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 101 place count 190 transition count 1202
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 177 transition count 1189
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 177 transition count 1189
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 136 place count 168 transition count 1180
Iterating global reduction 2 with 9 rules applied. Total rules applied 145 place count 168 transition count 1180
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 154 place count 159 transition count 1171
Iterating global reduction 2 with 9 rules applied. Total rules applied 163 place count 159 transition count 1171
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 182 place count 140 transition count 1152
Iterating global reduction 2 with 19 rules applied. Total rules applied 201 place count 140 transition count 1152
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 232 place count 109 transition count 1121
Iterating global reduction 2 with 31 rules applied. Total rules applied 263 place count 109 transition count 1121
Applied a total of 263 rules in 93 ms. Remains 109 /245 variables (removed 136) and now considering 1121/1248 (removed 127) transitions.
[2022-05-17 14:48:46] [INFO ] Flow matrix only has 109 transitions (discarded 1012 similar events)
// Phase 1: matrix 109 rows 109 cols
[2022-05-17 14:48:46] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-17 14:48:46] [INFO ] Implicit Places using invariants in 123 ms returned [23, 44, 48, 60, 74, 84, 94]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 125 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/245 places, 1121/1248 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 1107
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 1107
Applied a total of 28 rules in 24 ms. Remains 88 /102 variables (removed 14) and now considering 1107/1121 (removed 14) transitions.
[2022-05-17 14:48:46] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
// Phase 1: matrix 89 rows 88 cols
[2022-05-17 14:48:46] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 14:48:46] [INFO ] Implicit Places using invariants in 101 ms returned []
[2022-05-17 14:48:46] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
// Phase 1: matrix 89 rows 88 cols
[2022-05-17 14:48:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:48:46] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/245 places, 1107/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 88/245 places, 1107/1248 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s33 1) (GEQ s61 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]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 4 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-00 finished in 760 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(G(X(p1)) U (G(p2)&&X(G(X(p2))))))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Graph (complete) has 1990 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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 244 transition count 1227
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 224 transition count 1227
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 224 transition count 1217
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 214 transition count 1217
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 200 transition count 1203
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 200 transition count 1203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 198 transition count 1201
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 198 transition count 1201
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 196 transition count 1201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 95 place count 196 transition count 1199
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 99 place count 194 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 192 transition count 1197
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 192 transition count 1197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 190 transition count 1195
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 190 transition count 1195
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 113 place count 184 transition count 1189
Iterating global reduction 3 with 6 rules applied. Total rules applied 119 place count 184 transition count 1189
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 169 place count 159 transition count 1164
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 177 place count 151 transition count 1156
Iterating global reduction 3 with 8 rules applied. Total rules applied 185 place count 151 transition count 1156
Applied a total of 185 rules in 163 ms. Remains 151 /245 variables (removed 94) and now considering 1156/1248 (removed 92) transitions.
[2022-05-17 14:48:47] [INFO ] Flow matrix only has 254 transitions (discarded 902 similar events)
// Phase 1: matrix 254 rows 151 cols
[2022-05-17 14:48:47] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 14:48:47] [INFO ] Implicit Places using invariants in 150 ms returned [15, 47, 67, 73, 89, 92, 98, 104, 110, 115, 123, 132]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 153 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/245 places, 1156/1248 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 106 transition count 1123
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 106 transition count 1123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 103 transition count 1120
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 103 transition count 1120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 99 transition count 1116
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 99 transition count 1116
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 91 transition count 1108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 89 transition count 1106
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 89 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 88 transition count 1105
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 88 transition count 1105
Applied a total of 102 rules in 49 ms. Remains 88 /139 variables (removed 51) and now considering 1105/1156 (removed 51) transitions.
[2022-05-17 14:48:47] [INFO ] Flow matrix only has 117 transitions (discarded 988 similar events)
// Phase 1: matrix 117 rows 88 cols
[2022-05-17 14:48:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:48:47] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-05-17 14:48:47] [INFO ] Flow matrix only has 117 transitions (discarded 988 similar events)
// Phase 1: matrix 117 rows 88 cols
[2022-05-17 14:48:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:48:47] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/245 places, 1105/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 88/245 places, 1105/1248 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s13 1), p2:(GEQ s37 1), p1:(AND (GEQ s30 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-01 finished in 1066 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((X(F(p0))&&F((F(p2)&&p1))))||p0)))'
Support contains 1 out of 245 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Graph (complete) has 1990 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 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 244 transition count 1227
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 224 transition count 1227
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 224 transition count 1217
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 214 transition count 1217
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 200 transition count 1203
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 200 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 199 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 199 transition count 1202
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 198 transition count 1202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 92 place count 198 transition count 1201
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 197 transition count 1201
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 196 transition count 1200
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 196 transition count 1200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 195 transition count 1199
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 195 transition count 1199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 191 transition count 1195
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 191 transition count 1195
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 160 place count 164 transition count 1168
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 166 place count 158 transition count 1162
Iterating global reduction 3 with 6 rules applied. Total rules applied 172 place count 158 transition count 1162
Applied a total of 172 rules in 81 ms. Remains 158 /245 variables (removed 87) and now considering 1162/1248 (removed 86) transitions.
[2022-05-17 14:48:48] [INFO ] Flow matrix only has 275 transitions (discarded 887 similar events)
// Phase 1: matrix 275 rows 158 cols
[2022-05-17 14:48:48] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-17 14:48:48] [INFO ] Implicit Places using invariants in 135 ms returned [15, 20, 41, 45, 47, 72, 78, 93, 104, 110, 116, 121, 129, 138]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 139 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/245 places, 1162/1248 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 103 transition count 1121
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 103 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 99 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 99 transition count 1117
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 95 transition count 1113
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 95 transition count 1113
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 116 place count 86 transition count 1104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 84 transition count 1102
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 84 transition count 1102
Applied a total of 120 rules in 33 ms. Remains 84 /144 variables (removed 60) and now considering 1102/1162 (removed 60) transitions.
[2022-05-17 14:48:48] [INFO ] Flow matrix only has 112 transitions (discarded 990 similar events)
// Phase 1: matrix 112 rows 84 cols
[2022-05-17 14:48:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:48:48] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-17 14:48:48] [INFO ] Flow matrix only has 112 transitions (discarded 990 similar events)
// Phase 1: matrix 112 rows 84 cols
[2022-05-17 14:48:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:48:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/245 places, 1102/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/245 places, 1102/1248 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-02 finished in 552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((F(p0)&&G(p1)) U p2)))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Graph (complete) has 1990 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 244 transition count 1228
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 225 transition count 1228
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 225 transition count 1219
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 216 transition count 1219
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 69 place count 204 transition count 1207
Iterating global reduction 2 with 12 rules applied. Total rules applied 81 place count 204 transition count 1207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 202 transition count 1205
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 202 transition count 1205
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 200 transition count 1205
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 200 transition count 1203
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 198 transition count 1203
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 196 transition count 1201
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 196 transition count 1201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 194 transition count 1199
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 194 transition count 1199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 191 transition count 1196
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 191 transition count 1196
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 157 place count 165 transition count 1170
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 170 place count 152 transition count 1157
Iterating global reduction 3 with 13 rules applied. Total rules applied 183 place count 152 transition count 1157
Applied a total of 183 rules in 72 ms. Remains 152 /245 variables (removed 93) and now considering 1157/1248 (removed 91) transitions.
[2022-05-17 14:48:48] [INFO ] Flow matrix only has 257 transitions (discarded 900 similar events)
// Phase 1: matrix 257 rows 152 cols
[2022-05-17 14:48:48] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 14:48:49] [INFO ] Implicit Places using invariants in 136 ms returned [17, 24, 45, 49, 51, 67, 73, 90, 93, 99, 105, 111, 116, 124, 133]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 138 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/245 places, 1157/1248 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 97 transition count 1117
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 97 transition count 1117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 92 transition count 1112
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 92 transition count 1112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 87 transition count 1107
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 87 transition count 1107
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 112 place count 81 transition count 1101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 79 transition count 1099
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 79 transition count 1099
Applied a total of 116 rules in 33 ms. Remains 79 /137 variables (removed 58) and now considering 1099/1157 (removed 58) transitions.
[2022-05-17 14:48:49] [INFO ] Flow matrix only has 80 transitions (discarded 1019 similar events)
// Phase 1: matrix 80 rows 79 cols
[2022-05-17 14:48:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 14:48:49] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-05-17 14:48:49] [INFO ] Flow matrix only has 80 transitions (discarded 1019 similar events)
// Phase 1: matrix 80 rows 79 cols
[2022-05-17 14:48:49] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 14:48:49] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/245 places, 1099/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 79/245 places, 1099/1248 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s51 1), p1:(GEQ s11 1), p0:(GEQ s7 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-03 finished in 640 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((p0 U !(X(X(p1))&&F(p2)))))))'
Support contains 6 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 225 transition count 1228
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 225 transition count 1228
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 213 transition count 1216
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 213 transition count 1216
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 212 transition count 1216
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 204 transition count 1208
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 204 transition count 1208
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 198 transition count 1208
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 187 transition count 1197
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 187 transition count 1197
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 116 place count 180 transition count 1190
Iterating global reduction 2 with 7 rules applied. Total rules applied 123 place count 180 transition count 1190
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 130 place count 173 transition count 1183
Iterating global reduction 2 with 7 rules applied. Total rules applied 137 place count 173 transition count 1183
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 148 place count 162 transition count 1172
Iterating global reduction 2 with 11 rules applied. Total rules applied 159 place count 162 transition count 1172
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 190 place count 131 transition count 1141
Iterating global reduction 2 with 31 rules applied. Total rules applied 221 place count 131 transition count 1141
Applied a total of 221 rules in 29 ms. Remains 131 /245 variables (removed 114) and now considering 1141/1248 (removed 107) transitions.
[2022-05-17 14:48:49] [INFO ] Flow matrix only has 160 transitions (discarded 981 similar events)
// Phase 1: matrix 160 rows 131 cols
[2022-05-17 14:48:49] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-17 14:48:49] [INFO ] Implicit Places using invariants in 111 ms returned [23, 54, 58, 70, 84, 88, 94, 114]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 113 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/245 places, 1141/1248 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 102 transition count 1120
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 102 transition count 1120
Applied a total of 42 rules in 12 ms. Remains 102 /123 variables (removed 21) and now considering 1120/1141 (removed 21) transitions.
[2022-05-17 14:48:49] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:48:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:48:49] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-17 14:48:49] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:48:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:48:49] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/245 places, 1120/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 102/245 places, 1120/1248 transitions.
Stuttering acceptance computed with spot in 506 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2), p1, true, (AND p2 p1), (AND p1 p2), (AND p1 p2), p1, p2]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=p2, acceptance={} source=4 dest: 6}, { cond=(NOT p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 9}, { cond=p0, acceptance={} source=5 dest: 10}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 11}], [{ cond=p1, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 12}], [{ cond=(AND p2 p1), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=10 dest: 10}, { cond=(AND p2 p0 p1), acceptance={0} source=10 dest: 10}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=10 dest: 11}], [{ cond=p1, acceptance={} source=11 dest: 6}], [{ cond=p2, acceptance={} source=12 dest: 7}, { cond=(NOT p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(AND (GEQ s43 1) (GEQ s72 1)), p0:(AND (GEQ s79 1) (GEQ s81 1)), p1:(AND (GEQ s37 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16628 reset in 428 ms.
Product exploration explored 100000 steps with 16647 reset in 426 ms.
Computed a total of 102 stabilizing places and 1120 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 1120
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 p2) (NOT p0) (NOT p1)), true, (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 423 ms. Reduced automaton from 13 states, 25 edges and 3 AP to 13 states, 25 edges and 3 AP.
Stuttering acceptance computed with spot in 465 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2), p1, true, (AND p2 p1), (AND p1 p2), (AND p1 p2), p1, p2]
Incomplete random walk after 10000 steps, including 340 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-17 14:48:52] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:48:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:48:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-17 14:48:52] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-17 14:48:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 14:48:52] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-05-17 14:48:52] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 14:48:52] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 102/102 places, 1120/1120 transitions.
Graph (complete) has 269 edges and 102 vertex of which 71 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 497 transitions
Reduce isomorphic transitions removed 497 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 499 rules applied. Total rules applied 500 place count 71 transition count 608
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 239 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 253 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 272 rules applied. Total rules applied 772 place count 53 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 773 place count 52 transition count 354
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 773 place count 52 transition count 351
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 779 place count 49 transition count 351
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 783 place count 47 transition count 349
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 800 place count 47 transition count 332
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 801 place count 47 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 46 transition count 331
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 818 place count 46 transition count 315
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 834 place count 30 transition count 315
Applied a total of 834 rules in 57 ms. Remains 30 /102 variables (removed 72) and now considering 315/1120 (removed 805) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/102 places, 315/1120 transitions.
Incomplete random walk after 10000 steps, including 1133 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7425 steps, run visited all 1 properties in 36 ms. (steps per millisecond=206 )
Probabilistic random walk after 7425 steps, saw 2038 distinct states, run finished after 36 ms. (steps per millisecond=206 ) properties seen :1
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), true, (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND p2 p1))), (G (NOT (AND p2 p1 (NOT p0)))), (G (NOT (AND p2 p1 p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F p1), (F p2), (F (AND (NOT p2) p1)), (F (AND p2 (NOT p0))), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 837 ms. Reduced automaton from 13 states, 25 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND p1 p2), p1, true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND p1 p2), p1, true, (AND p1 p2), p2]
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 1120/1120 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
[2022-05-17 14:48:54] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:48:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:48:54] [INFO ] Implicit Places using invariants in 117 ms returned []
[2022-05-17 14:48:54] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:48:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:48:54] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2022-05-17 14:48:54] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:48:54] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 14:48:55] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 1120/1120 transitions.
Computed a total of 102 stabilizing places and 1120 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 1120
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 p2) (NOT p1)), true, (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 5 factoid took 299 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND p1 p2), p1, true, (AND p1 p2), p2]
Finished random walk after 236 steps, including 7 resets, run visited all 4 properties in 5 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true, (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F p1), (F (AND (NOT p0) p2)), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 5 factoid took 376 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND p1 p2), p1, true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND p1 p2), p1, true, (AND p1 p2), p2]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND p1 p2), p1, true, (AND p1 p2), p2]
Product exploration explored 100000 steps with 16631 reset in 421 ms.
Product exploration explored 100000 steps with 16679 reset in 375 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND p1 p2), p1, true, (AND p1 p2), p2]
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 1120/1120 transitions.
Graph (complete) has 1364 edges and 102 vertex of which 101 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
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 101 transition count 1119
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 8 place count 101 transition count 1119
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 101 transition count 1119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 98 transition count 1116
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 98 transition count 1116
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 98 transition count 1116
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 95 transition count 1113
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 95 transition count 1113
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 29 rules in 45 ms. Remains 95 /102 variables (removed 7) and now considering 1113/1120 (removed 7) transitions.
[2022-05-17 14:48:58] [INFO ] Redundant transitions in 68 ms returned []
[2022-05-17 14:48:58] [INFO ] Flow matrix only has 123 transitions (discarded 990 similar events)
// Phase 1: matrix 123 rows 95 cols
[2022-05-17 14:48:58] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 14:48:59] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/102 places, 1113/1120 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/102 places, 1113/1120 transitions.
Product exploration explored 100000 steps with 16641 reset in 464 ms.
Product exploration explored 100000 steps with 16671 reset in 460 ms.
Built C files in :
/tmp/ltsmin17169220571449480676
[2022-05-17 14:49:00] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17169220571449480676
Running compilation step : cd /tmp/ltsmin17169220571449480676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1714 ms.
Running link step : cd /tmp/ltsmin17169220571449480676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17169220571449480676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16992380125597300016.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 1120/1120 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
[2022-05-17 14:49:15] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:49:15] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 14:49:15] [INFO ] Implicit Places using invariants in 110 ms returned []
[2022-05-17 14:49:15] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:49:15] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 14:49:15] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2022-05-17 14:49:15] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:49:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:49:15] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 1120/1120 transitions.
Built C files in :
/tmp/ltsmin7979602788377410056
[2022-05-17 14:49:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7979602788377410056
Running compilation step : cd /tmp/ltsmin7979602788377410056;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1618 ms.
Running link step : cd /tmp/ltsmin7979602788377410056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7979602788377410056;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5922394427969053554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 14:49:30] [INFO ] Flatten gal took : 69 ms
[2022-05-17 14:49:31] [INFO ] Flatten gal took : 35 ms
[2022-05-17 14:49:31] [INFO ] Time to serialize gal into /tmp/LTL5164866246357066180.gal : 7 ms
[2022-05-17 14:49:31] [INFO ] Time to serialize properties into /tmp/LTL7288446345383310952.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5164866246357066180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7288446345383310952.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5164866...266
Read 1 LTL properties
Checking formula 0 : !((G(X(X(("((Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(LeafSetOfLxIsSentToNode27>=1))")U(!((X(X("((Node10HasAskedItsLeafSetToL...281
Formula 0 simplified : !GXX("((Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(LeafSetOfLxIsSentToNode27>=1))" U !(XX"((Node10HasAskedItsLeafSetToLxToRep...264
Detected timeout of ITS tools.
[2022-05-17 14:49:46] [INFO ] Flatten gal took : 35 ms
[2022-05-17 14:49:46] [INFO ] Applying decomposition
[2022-05-17 14:49:46] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6815799287420656100.txt' '-o' '/tmp/graph6815799287420656100.bin' '-w' '/tmp/graph6815799287420656100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6815799287420656100.bin' '-l' '-1' '-v' '-w' '/tmp/graph6815799287420656100.weights' '-q' '0' '-e' '0.001'
[2022-05-17 14:49:46] [INFO ] Decomposing Gal with order
[2022-05-17 14:49:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 14:49:46] [INFO ] Removed a total of 1087 redundant transitions.
[2022-05-17 14:49:46] [INFO ] Flatten gal took : 166 ms
[2022-05-17 14:49:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 11 ms.
[2022-05-17 14:49:46] [INFO ] Time to serialize gal into /tmp/LTL8853447089639056596.gal : 4 ms
[2022-05-17 14:49:46] [INFO ] Time to serialize properties into /tmp/LTL12186856745463235028.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8853447089639056596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12186856745463235028.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8853447...246
Read 1 LTL properties
Checking formula 0 : !((G(X(X(("((i2.u9.Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(i2.u12.LeafSetOfLxIsSentToNode27>=1))")U(!((X(X("((i2.u6.Node10Ha...312
Formula 0 simplified : !GXX("((i2.u9.Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(i2.u12.LeafSetOfLxIsSentToNode27>=1))" U !(XX"((i2.u6.Node10HasAsked...295
Reverse transition relation is NOT exact ! Due to transitions t23, t368, t384, t393, t405, t406, t574, t623, t624, t639, t651, t798, t1005, t1019, t1025, t...4544
Computing Next relation with stutter on 24068 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2346957840523856292
[2022-05-17 14:50:01] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2346957840523856292
Running compilation step : cd /tmp/ltsmin2346957840523856292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1615 ms.
Running link step : cd /tmp/ltsmin2346957840523856292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2346957840523856292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(((LTLAPp0==true) U !(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-04 finished in 87280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G((X(p1) U G(p2)))&&!p2)))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Graph (complete) has 1990 edges and 245 vertex of which 244 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 244 transition count 1227
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 224 transition count 1227
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 224 transition count 1217
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 214 transition count 1217
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 200 transition count 1203
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 200 transition count 1203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 198 transition count 1201
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 198 transition count 1201
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 197 transition count 1201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 94 place count 197 transition count 1200
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 196 transition count 1200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 195 transition count 1199
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 195 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 194 transition count 1198
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 194 transition count 1198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 192 transition count 1196
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 192 transition count 1196
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 158 place count 165 transition count 1169
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 167 place count 156 transition count 1160
Iterating global reduction 3 with 9 rules applied. Total rules applied 176 place count 156 transition count 1160
Applied a total of 176 rules in 74 ms. Remains 156 /245 variables (removed 89) and now considering 1160/1248 (removed 88) transitions.
[2022-05-17 14:50:16] [INFO ] Flow matrix only has 273 transitions (discarded 887 similar events)
// Phase 1: matrix 273 rows 156 cols
[2022-05-17 14:50:16] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-17 14:50:16] [INFO ] Implicit Places using invariants in 156 ms returned [20, 40, 48, 52, 54, 70, 93, 96, 102, 108, 114, 119, 127, 136]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 158 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/245 places, 1160/1248 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 107 transition count 1125
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 107 transition count 1125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 102 transition count 1120
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 102 transition count 1120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 94 transition count 1112
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 94 transition count 1112
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 112 place count 86 transition count 1104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 84 transition count 1102
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 84 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 83 transition count 1101
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 83 transition count 1101
Applied a total of 118 rules in 34 ms. Remains 83 /142 variables (removed 59) and now considering 1101/1160 (removed 59) transitions.
[2022-05-17 14:50:17] [INFO ] Flow matrix only has 97 transitions (discarded 1004 similar events)
// Phase 1: matrix 97 rows 83 cols
[2022-05-17 14:50:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:50:17] [INFO ] Implicit Places using invariants in 117 ms returned []
[2022-05-17 14:50:17] [INFO ] Flow matrix only has 97 transitions (discarded 1004 similar events)
// Phase 1: matrix 97 rows 83 cols
[2022-05-17 14:50:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:50:17] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/245 places, 1101/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 83/245 places, 1101/1248 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s47 1), p0:(GEQ s28 1), p1:(AND (GEQ s2 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-06 finished in 813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(p1) U p2)))'
Support contains 7 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 225 transition count 1228
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 225 transition count 1228
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 212 transition count 1215
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 212 transition count 1215
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 209 transition count 1215
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 79 place count 199 transition count 1205
Iterating global reduction 1 with 10 rules applied. Total rules applied 89 place count 199 transition count 1205
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 194 transition count 1205
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 105 place count 183 transition count 1194
Iterating global reduction 2 with 11 rules applied. Total rules applied 116 place count 183 transition count 1194
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 124 place count 175 transition count 1186
Iterating global reduction 2 with 8 rules applied. Total rules applied 132 place count 175 transition count 1186
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 140 place count 167 transition count 1178
Iterating global reduction 2 with 8 rules applied. Total rules applied 148 place count 167 transition count 1178
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 165 place count 150 transition count 1161
Iterating global reduction 2 with 17 rules applied. Total rules applied 182 place count 150 transition count 1161
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 207 place count 125 transition count 1136
Iterating global reduction 2 with 25 rules applied. Total rules applied 232 place count 125 transition count 1136
Applied a total of 232 rules in 32 ms. Remains 125 /245 variables (removed 120) and now considering 1136/1248 (removed 112) transitions.
[2022-05-17 14:50:17] [INFO ] Flow matrix only has 141 transitions (discarded 995 similar events)
// Phase 1: matrix 141 rows 125 cols
[2022-05-17 14:50:17] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 14:50:17] [INFO ] Implicit Places using invariants in 121 ms returned [45, 61, 75, 79, 85, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 123 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/245 places, 1136/1248 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 102 transition count 1119
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 102 transition count 1119
Applied a total of 34 rules in 6 ms. Remains 102 /119 variables (removed 17) and now considering 1119/1136 (removed 17) transitions.
[2022-05-17 14:50:17] [INFO ] Flow matrix only has 119 transitions (discarded 1000 similar events)
// Phase 1: matrix 119 rows 102 cols
[2022-05-17 14:50:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:50:17] [INFO ] Implicit Places using invariants in 106 ms returned []
[2022-05-17 14:50:17] [INFO ] Flow matrix only has 119 transitions (discarded 1000 similar events)
// Phase 1: matrix 119 rows 102 cols
[2022-05-17 14:50:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:50:17] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/245 places, 1119/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 102/245 places, 1119/1248 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s82 1), p0:(AND (OR (LT s15 1) (LT s91 1)) (GEQ s32 1) (GEQ s41 1)), p2:(OR (AND (GEQ s15 1) (GEQ s91 1)) (AND (GEQ s17 1) (GEQ s37 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-08 finished in 666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Graph (complete) has 1990 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 244 transition count 1226
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 223 transition count 1226
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 43 place count 223 transition count 1216
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 63 place count 213 transition count 1216
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 78 place count 198 transition count 1201
Iterating global reduction 2 with 15 rules applied. Total rules applied 93 place count 198 transition count 1201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 196 transition count 1199
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 196 transition count 1199
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 194 transition count 1199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 99 place count 194 transition count 1197
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 103 place count 192 transition count 1197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 190 transition count 1195
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 190 transition count 1195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 188 transition count 1193
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 188 transition count 1193
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 117 place count 182 transition count 1187
Iterating global reduction 3 with 6 rules applied. Total rules applied 123 place count 182 transition count 1187
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 173 place count 157 transition count 1162
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 182 place count 148 transition count 1153
Iterating global reduction 3 with 9 rules applied. Total rules applied 191 place count 148 transition count 1153
Applied a total of 191 rules in 74 ms. Remains 148 /245 variables (removed 97) and now considering 1153/1248 (removed 95) transitions.
[2022-05-17 14:50:18] [INFO ] Flow matrix only has 250 transitions (discarded 903 similar events)
// Phase 1: matrix 250 rows 148 cols
[2022-05-17 14:50:18] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 14:50:18] [INFO ] Implicit Places using invariants in 135 ms returned [15, 20, 41, 45, 47, 63, 69, 84, 87, 93, 107, 112, 120, 129]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 136 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/245 places, 1153/1248 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 95 transition count 1114
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 95 transition count 1114
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 91 transition count 1110
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 91 transition count 1110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 87 transition count 1106
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 87 transition count 1106
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 108 place count 80 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 78 transition count 1097
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 78 transition count 1097
Applied a total of 112 rules in 32 ms. Remains 78 /134 variables (removed 56) and now considering 1097/1153 (removed 56) transitions.
[2022-05-17 14:50:18] [INFO ] Flow matrix only has 91 transitions (discarded 1006 similar events)
// Phase 1: matrix 91 rows 78 cols
[2022-05-17 14:50:18] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 14:50:18] [INFO ] Implicit Places using invariants in 95 ms returned []
[2022-05-17 14:50:18] [INFO ] Flow matrix only has 91 transitions (discarded 1006 similar events)
// Phase 1: matrix 91 rows 78 cols
[2022-05-17 14:50:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:50:18] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/245 places, 1097/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 78/245 places, 1097/1248 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-09 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:(LT s55 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 8610 reset in 400 ms.
Product exploration explored 100000 steps with 8576 reset in 334 ms.
Computed a total of 78 stabilizing places and 1097 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 1097
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-09 finished in 1537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||G((G(p1)||p2)))))'
Support contains 5 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 225 transition count 1228
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 225 transition count 1228
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 212 transition count 1215
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 212 transition count 1215
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 209 transition count 1215
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 80 place count 198 transition count 1204
Iterating global reduction 1 with 11 rules applied. Total rules applied 91 place count 198 transition count 1204
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 97 place count 192 transition count 1204
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 179 transition count 1191
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 179 transition count 1191
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 132 place count 170 transition count 1182
Iterating global reduction 2 with 9 rules applied. Total rules applied 141 place count 170 transition count 1182
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 150 place count 161 transition count 1173
Iterating global reduction 2 with 9 rules applied. Total rules applied 159 place count 161 transition count 1173
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 178 place count 142 transition count 1154
Iterating global reduction 2 with 19 rules applied. Total rules applied 197 place count 142 transition count 1154
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 228 place count 111 transition count 1123
Iterating global reduction 2 with 31 rules applied. Total rules applied 259 place count 111 transition count 1123
Applied a total of 259 rules in 34 ms. Remains 111 /245 variables (removed 134) and now considering 1123/1248 (removed 125) transitions.
[2022-05-17 14:50:19] [INFO ] Flow matrix only has 112 transitions (discarded 1011 similar events)
// Phase 1: matrix 112 rows 111 cols
[2022-05-17 14:50:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 14:50:19] [INFO ] Implicit Places using invariants in 155 ms returned [23, 43, 47, 59, 79, 85, 95]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 156 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/245 places, 1123/1248 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 90 transition count 1109
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 90 transition count 1109
Applied a total of 28 rules in 6 ms. Remains 90 /104 variables (removed 14) and now considering 1109/1123 (removed 14) transitions.
[2022-05-17 14:50:19] [INFO ] Flow matrix only has 92 transitions (discarded 1017 similar events)
// Phase 1: matrix 92 rows 90 cols
[2022-05-17 14:50:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:50:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2022-05-17 14:50:20] [INFO ] Flow matrix only has 92 transitions (discarded 1017 similar events)
// Phase 1: matrix 92 rows 90 cols
[2022-05-17 14:50:20] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-17 14:50:20] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 90/245 places, 1109/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 90/245 places, 1109/1248 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s60 1) (GEQ s77 1)), p1:(GEQ s48 1), p0:(OR (LT s35 1) (LT s66 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 31158 reset in 310 ms.
Product exploration explored 100000 steps with 30979 reset in 331 ms.
Computed a total of 90 stabilizing places and 1109 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 1109
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 p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 10 factoid took 329 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-10 finished in 1726 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U p1)))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 224 transition count 1227
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 224 transition count 1227
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 210 transition count 1213
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 210 transition count 1213
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 207 transition count 1213
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 84 place count 196 transition count 1202
Iterating global reduction 1 with 11 rules applied. Total rules applied 95 place count 196 transition count 1202
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 101 place count 190 transition count 1202
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 177 transition count 1189
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 177 transition count 1189
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 136 place count 168 transition count 1180
Iterating global reduction 2 with 9 rules applied. Total rules applied 145 place count 168 transition count 1180
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 154 place count 159 transition count 1171
Iterating global reduction 2 with 9 rules applied. Total rules applied 163 place count 159 transition count 1171
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 182 place count 140 transition count 1152
Iterating global reduction 2 with 19 rules applied. Total rules applied 201 place count 140 transition count 1152
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 232 place count 109 transition count 1121
Iterating global reduction 2 with 31 rules applied. Total rules applied 263 place count 109 transition count 1121
Applied a total of 263 rules in 45 ms. Remains 109 /245 variables (removed 136) and now considering 1121/1248 (removed 127) transitions.
[2022-05-17 14:50:21] [INFO ] Flow matrix only has 109 transitions (discarded 1012 similar events)
// Phase 1: matrix 109 rows 109 cols
[2022-05-17 14:50:21] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 14:50:21] [INFO ] Implicit Places using invariants in 192 ms returned [24, 44, 48, 60, 74, 78, 84]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 193 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/245 places, 1121/1248 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 1107
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 1107
Applied a total of 28 rules in 5 ms. Remains 88 /102 variables (removed 14) and now considering 1107/1121 (removed 14) transitions.
[2022-05-17 14:50:21] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
// Phase 1: matrix 89 rows 88 cols
[2022-05-17 14:50:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:50:21] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-17 14:50:21] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
// Phase 1: matrix 89 rows 88 cols
[2022-05-17 14:50:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:50:22] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/245 places, 1107/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 88/245 places, 1107/1248 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p1, p1]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s8 1) (GEQ s73 1)), p0:(AND (GEQ s32 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 119 steps with 55 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-12 finished in 672 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U p1)))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 225 transition count 1228
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 225 transition count 1228
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 211 transition count 1214
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 211 transition count 1214
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 208 transition count 1214
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 82 place count 197 transition count 1203
Iterating global reduction 1 with 11 rules applied. Total rules applied 93 place count 197 transition count 1203
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 99 place count 191 transition count 1203
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 112 place count 178 transition count 1190
Iterating global reduction 2 with 13 rules applied. Total rules applied 125 place count 178 transition count 1190
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 134 place count 169 transition count 1181
Iterating global reduction 2 with 9 rules applied. Total rules applied 143 place count 169 transition count 1181
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 152 place count 160 transition count 1172
Iterating global reduction 2 with 9 rules applied. Total rules applied 161 place count 160 transition count 1172
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 180 place count 141 transition count 1153
Iterating global reduction 2 with 19 rules applied. Total rules applied 199 place count 141 transition count 1153
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 230 place count 110 transition count 1122
Iterating global reduction 2 with 31 rules applied. Total rules applied 261 place count 110 transition count 1122
Applied a total of 261 rules in 31 ms. Remains 110 /245 variables (removed 135) and now considering 1122/1248 (removed 126) transitions.
[2022-05-17 14:50:22] [INFO ] Flow matrix only has 111 transitions (discarded 1011 similar events)
// Phase 1: matrix 111 rows 110 cols
[2022-05-17 14:50:22] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 14:50:22] [INFO ] Implicit Places using invariants in 126 ms returned [23, 45, 61, 75, 79, 95]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 127 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/245 places, 1122/1248 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 92 transition count 1110
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 92 transition count 1110
Applied a total of 24 rules in 13 ms. Remains 92 /104 variables (removed 12) and now considering 1110/1122 (removed 12) transitions.
[2022-05-17 14:50:22] [INFO ] Flow matrix only has 94 transitions (discarded 1016 similar events)
// Phase 1: matrix 94 rows 92 cols
[2022-05-17 14:50:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 14:50:22] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-05-17 14:50:22] [INFO ] Flow matrix only has 94 transitions (discarded 1016 similar events)
// Phase 1: matrix 94 rows 92 cols
[2022-05-17 14:50:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:50:22] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/245 places, 1110/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 92/245 places, 1110/1248 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, p1, p1]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s31 1) (GEQ s69 1)), p0:(AND (GEQ s24 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Computed a total of 92 stabilizing places and 1110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 92 transition count 1110
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 (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-14 finished in 1355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 1248/1248 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 224 transition count 1227
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 224 transition count 1227
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 210 transition count 1213
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 210 transition count 1213
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 207 transition count 1213
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 84 place count 196 transition count 1202
Iterating global reduction 1 with 11 rules applied. Total rules applied 95 place count 196 transition count 1202
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 101 place count 190 transition count 1202
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 177 transition count 1189
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 177 transition count 1189
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 136 place count 168 transition count 1180
Iterating global reduction 2 with 9 rules applied. Total rules applied 145 place count 168 transition count 1180
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 154 place count 159 transition count 1171
Iterating global reduction 2 with 9 rules applied. Total rules applied 163 place count 159 transition count 1171
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 182 place count 140 transition count 1152
Iterating global reduction 2 with 19 rules applied. Total rules applied 201 place count 140 transition count 1152
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 232 place count 109 transition count 1121
Iterating global reduction 2 with 31 rules applied. Total rules applied 263 place count 109 transition count 1121
Applied a total of 263 rules in 35 ms. Remains 109 /245 variables (removed 136) and now considering 1121/1248 (removed 127) transitions.
[2022-05-17 14:50:23] [INFO ] Flow matrix only has 109 transitions (discarded 1012 similar events)
// Phase 1: matrix 109 rows 109 cols
[2022-05-17 14:50:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 14:50:23] [INFO ] Implicit Places using invariants in 107 ms returned [23, 44, 48, 74, 78, 84, 94]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 108 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/245 places, 1121/1248 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 1107
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 1107
Applied a total of 28 rules in 7 ms. Remains 88 /102 variables (removed 14) and now considering 1107/1121 (removed 14) transitions.
[2022-05-17 14:50:23] [INFO ] Flow matrix only has 88 transitions (discarded 1019 similar events)
// Phase 1: matrix 88 rows 88 cols
[2022-05-17 14:50:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:50:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2022-05-17 14:50:23] [INFO ] Flow matrix only has 88 transitions (discarded 1019 similar events)
// Phase 1: matrix 88 rows 88 cols
[2022-05-17 14:50:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:50:23] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/245 places, 1107/1248 transitions.
Finished structural reductions, in 2 iterations. Remains : 88/245 places, 1107/1248 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s47 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 17 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-15 finished in 472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((p0 U !(X(X(p1))&&F(p2)))))))'
[2022-05-17 14:50:24] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3648673941581270936
[2022-05-17 14:50:24] [INFO ] Computing symmetric may disable matrix : 1248 transitions.
[2022-05-17 14:50:24] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 14:50:24] [INFO ] Applying decomposition
[2022-05-17 14:50:24] [INFO ] Computing symmetric may enable matrix : 1248 transitions.
[2022-05-17 14:50:24] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 14:50:24] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6629290551222149294.txt' '-o' '/tmp/graph6629290551222149294.bin' '-w' '/tmp/graph6629290551222149294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6629290551222149294.bin' '-l' '-1' '-v' '-w' '/tmp/graph6629290551222149294.weights' '-q' '0' '-e' '0.001'
[2022-05-17 14:50:24] [INFO ] Decomposing Gal with order
[2022-05-17 14:50:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 14:50:24] [INFO ] Removed a total of 1476 redundant transitions.
[2022-05-17 14:50:24] [INFO ] Flatten gal took : 88 ms
[2022-05-17 14:50:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 13 ms.
[2022-05-17 14:50:24] [INFO ] Time to serialize gal into /tmp/LTLFireability2662398969349932876.gal : 22 ms
[2022-05-17 14:50:24] [INFO ] Time to serialize properties into /tmp/LTLFireability1689551299491809193.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2662398969349932876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1689551299491809193.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
[2022-05-17 14:50:24] [INFO ] Computing Do-Not-Accords matrix : 1248 transitions.
[2022-05-17 14:50:24] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 14:50:24] [INFO ] Built C files in 396ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3648673941581270936
Running compilation step : cd /tmp/ltsmin3648673941581270936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((G(X(X(("((i3.i0.u40.Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(i3.i0.u41.LeafSetOfLxIsSentToNode27>=1))")U(!((X(X("((i6.u17....328
Formula 0 simplified : !GXX("((i3.i0.u40.Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(i3.i0.u41.LeafSetOfLxIsSentToNode27>=1))" U !(XX"((i6.u17.Node10...311
Compilation finished in 3774 ms.
Running link step : cd /tmp/ltsmin3648673941581270936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin3648673941581270936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(((LTLAPp0==true) U !(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 15:10:59] [INFO ] Flatten gal took : 100 ms
[2022-05-17 15:10:59] [INFO ] Time to serialize gal into /tmp/LTLFireability11643480243622934009.gal : 5 ms
[2022-05-17 15:10:59] [INFO ] Time to serialize properties into /tmp/LTLFireability10274032419375889326.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11643480243622934009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10274032419375889326.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !((G(X(X(("((Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(LeafSetOfLxIsSentToNode27>=1))")U(!((X(X("((Node10HasAskedItsLeafSetToL...281
Formula 0 simplified : !GXX("((Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(LeafSetOfLxIsSentToNode27>=1))" U !(XX"((Node10HasAskedItsLeafSetToLxToRep...264
Detected timeout of ITS tools.
[2022-05-17 15:31:34] [INFO ] Flatten gal took : 74 ms
[2022-05-17 15:31:34] [INFO ] Input system was already deterministic with 1248 transitions.
[2022-05-17 15:31:34] [INFO ] Transformed 245 places.
[2022-05-17 15:31:34] [INFO ] Transformed 1248 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 15:31:34] [INFO ] Time to serialize gal into /tmp/LTLFireability3707057558160458842.gal : 25 ms
[2022-05-17 15:31:34] [INFO ] Time to serialize properties into /tmp/LTLFireability18323470468397581022.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3707057558160458842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18323470468397581022.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(X(("((Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(LeafSetOfLxIsSentToNode27>=1))")U(!((X(X("((Node10HasAskedItsLeafSetToL...281
Formula 0 simplified : !GXX("((Node27HasAskedItsLeafSetToLxToReplaceNode11>=1)&&(LeafSetOfLxIsSentToNode27>=1))" U !(XX"((Node10HasAskedItsLeafSetToLxToRep...264
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.079: LTL layer: formula: [](X(X(((LTLAPp0==true) U !(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))))
pins2lts-mc-linux64( 4/ 8), 0.079: "[](X(X(((LTLAPp0==true) U !(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.079: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.091: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.114: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.150: There are 1252 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.150: State length is 246, there are 1277 groups
pins2lts-mc-linux64( 0/ 8), 0.150: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.150: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.150: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.150: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.203: [Blue] ~23 levels ~960 states ~6096 transitions
pins2lts-mc-linux64( 2/ 8), 0.235: [Blue] ~26 levels ~1920 states ~8680 transitions
pins2lts-mc-linux64( 2/ 8), 0.288: [Blue] ~26 levels ~3840 states ~13160 transitions
pins2lts-mc-linux64( 2/ 8), 0.395: [Blue] ~26 levels ~7680 states ~23192 transitions
pins2lts-mc-linux64( 2/ 8), 0.616: [Blue] ~26 levels ~15360 states ~74992 transitions
pins2lts-mc-linux64( 5/ 8), 1.050: [Blue] ~27 levels ~30720 states ~89160 transitions
pins2lts-mc-linux64( 5/ 8), 1.958: [Blue] ~27 levels ~61440 states ~205512 transitions
pins2lts-mc-linux64( 5/ 8), 3.632: [Blue] ~27 levels ~122880 states ~459840 transitions
pins2lts-mc-linux64( 5/ 8), 6.783: [Blue] ~27 levels ~245760 states ~923656 transitions
pins2lts-mc-linux64( 5/ 8), 12.718: [Blue] ~28 levels ~491520 states ~1810056 transitions
pins2lts-mc-linux64( 5/ 8), 24.303: [Blue] ~28 levels ~983040 states ~3579840 transitions
pins2lts-mc-linux64( 5/ 8), 46.291: [Blue] ~28 levels ~1966080 states ~8015736 transitions
pins2lts-mc-linux64( 4/ 8), 91.071: [Blue] ~28 levels ~3932160 states ~16482536 transitions
pins2lts-mc-linux64( 7/ 8), 193.333: [Blue] ~28 levels ~7864320 states ~40576648 transitions
pins2lts-mc-linux64( 7/ 8), 424.998: [Blue] ~28 levels ~15728640 states ~80028760 transitions
pins2lts-mc-linux64( 7/ 8), 819.341: [Blue] ~28 levels ~31457280 states ~166841392 transitions
pins2lts-mc-linux64( 2/ 8), 1537.962: [Blue] ~28 levels ~62914560 states ~315022664 transitions
pins2lts-mc-linux64( 4/ 8), 2986.536: [Blue] ~28 levels ~125829120 states ~712048880 transitions
pins2lts-mc-linux64( 2/ 8), 3215.844: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3215.902:
pins2lts-mc-linux64( 0/ 8), 3215.902: Explored 134223127 states 812647170 transitions, fanout: 6.054
pins2lts-mc-linux64( 0/ 8), 3215.903: Total exploration time 3215.720 sec (3215.680 sec minimum, 3215.709 sec on average)
pins2lts-mc-linux64( 0/ 8), 3215.903: States per second: 41740, Transitions per second: 252711
pins2lts-mc-linux64( 0/ 8), 3215.903:
pins2lts-mc-linux64( 0/ 8), 3215.903: State space has 134217412 states, 275531 are accepting
pins2lts-mc-linux64( 0/ 8), 3215.903: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 3215.903: blue states: 134223127 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 3215.903: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 3215.903: all-red states: 89612870 (66.77%), bogus 2882 (0.00%)
pins2lts-mc-linux64( 0/ 8), 3215.903:
pins2lts-mc-linux64( 0/ 8), 3215.903: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 3215.903:
pins2lts-mc-linux64( 0/ 8), 3215.903: Queue width: 8B, total height: 224, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 3215.903: Tree memory: 1096.5MB, 8.6 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 3215.903: Tree fill ratio (roots/leafs): 99.0%/28.0%
pins2lts-mc-linux64( 0/ 8), 3215.903: Stored 1532 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3215.903: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3215.903: Est. total memory use: 1096.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3648673941581270936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(((LTLAPp0==true) U !(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3648673941581270936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(((LTLAPp0==true) U !(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)

BK_TIME_CONFINEMENT_REACHED

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

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