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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 10K Apr 29 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 29 12:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 12:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 905K 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-S16C2-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652793152441

Running Version 202205111006
[2022-05-17 13:12:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 13:12:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 13:12:33] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2022-05-17 13:12:33] [INFO ] Transformed 1542 places.
[2022-05-17 13:12:33] [INFO ] Transformed 1449 transitions.
[2022-05-17 13:12:33] [INFO ] Parsed PT model containing 1542 places and 1449 transitions in 303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 293 place count 1249 transition count 1449
Discarding 263 places :
Symmetric choice reduction at 1 with 263 rule applications. Total rules 556 place count 986 transition count 1186
Iterating global reduction 1 with 263 rules applied. Total rules applied 819 place count 986 transition count 1186
Discarding 224 places :
Symmetric choice reduction at 1 with 224 rule applications. Total rules 1043 place count 762 transition count 962
Iterating global reduction 1 with 224 rules applied. Total rules applied 1267 place count 762 transition count 962
Discarding 220 places :
Symmetric choice reduction at 1 with 220 rule applications. Total rules 1487 place count 542 transition count 742
Iterating global reduction 1 with 220 rules applied. Total rules applied 1707 place count 542 transition count 742
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 1 with 19 rules applied. Total rules applied 1726 place count 523 transition count 742
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1743 place count 506 transition count 725
Iterating global reduction 2 with 17 rules applied. Total rules applied 1760 place count 506 transition count 725
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1777 place count 489 transition count 708
Iterating global reduction 2 with 17 rules applied. Total rules applied 1794 place count 489 transition count 708
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1811 place count 472 transition count 691
Iterating global reduction 2 with 17 rules applied. Total rules applied 1828 place count 472 transition count 691
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1845 place count 455 transition count 674
Iterating global reduction 2 with 17 rules applied. Total rules applied 1862 place count 455 transition count 674
Discarding 117 places :
Symmetric choice reduction at 2 with 117 rule applications. Total rules 1979 place count 338 transition count 557
Iterating global reduction 2 with 117 rules applied. Total rules applied 2096 place count 338 transition count 557
Applied a total of 2096 rules in 353 ms. Remains 338 /1542 variables (removed 1204) and now considering 557/1449 (removed 892) transitions.
[2022-05-17 13:12:34] [INFO ] Flow matrix only has 440 transitions (discarded 117 similar events)
// Phase 1: matrix 440 rows 338 cols
[2022-05-17 13:12:34] [INFO ] Computed 35 place invariants in 29 ms
[2022-05-17 13:12:34] [INFO ] Implicit Places using invariants in 411 ms returned [27, 67, 85, 90, 109, 161, 163, 219, 236, 254, 262, 266, 280, 284, 297, 302, 315]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 443 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/1542 places, 557/1449 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 87 place count 234 transition count 470
Iterating global reduction 0 with 87 rules applied. Total rules applied 174 place count 234 transition count 470
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 177 place count 231 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 180 place count 231 transition count 467
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 183 place count 228 transition count 464
Iterating global reduction 0 with 3 rules applied. Total rules applied 186 place count 228 transition count 464
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 189 place count 225 transition count 461
Iterating global reduction 0 with 3 rules applied. Total rules applied 192 place count 225 transition count 461
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 199 place count 218 transition count 454
Iterating global reduction 0 with 7 rules applied. Total rules applied 206 place count 218 transition count 454
Applied a total of 206 rules in 26 ms. Remains 218 /321 variables (removed 103) and now considering 454/557 (removed 103) transitions.
[2022-05-17 13:12:34] [INFO ] Flow matrix only has 308 transitions (discarded 146 similar events)
// Phase 1: matrix 308 rows 218 cols
[2022-05-17 13:12:34] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-17 13:12:35] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-05-17 13:12:35] [INFO ] Flow matrix only has 308 transitions (discarded 146 similar events)
// Phase 1: matrix 308 rows 218 cols
[2022-05-17 13:12:35] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-17 13:12:35] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 218/1542 places, 454/1449 transitions.
Finished structural reductions, in 2 iterations. Remains : 218/1542 places, 454/1449 transitions.
Support contains 48 out of 218 places after structural reductions.
[2022-05-17 13:12:35] [INFO ] Flatten gal took : 272 ms
[2022-05-17 13:12:35] [INFO ] Flatten gal took : 31 ms
[2022-05-17 13:12:35] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 47 out of 218 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 536 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 33) seen :31
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-17 13:12:36] [INFO ] Flow matrix only has 308 transitions (discarded 146 similar events)
// Phase 1: matrix 308 rows 218 cols
[2022-05-17 13:12:36] [INFO ] Computed 18 place invariants in 7 ms
[2022-05-17 13:12:36] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-17 13:12:36] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 13:12:36] [INFO ] After 94ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 13:12:36] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 218/218 places, 454/454 transitions.
Graph (complete) has 545 edges and 218 vertex of which 62 are kept as prefixes of interest. Removing 156 places using SCC suffix rule.3 ms
Discarding 156 places :
Also discarding 102 output transitions
Drop transitions removed 102 transitions
Drop transitions removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 79 rules applied. Total rules applied 80 place count 60 transition count 275
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 26 rules applied. Total rules applied 106 place count 54 transition count 255
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 112 place count 48 transition count 255
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 112 place count 48 transition count 253
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 46 transition count 253
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 42 transition count 249
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 42 transition count 246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 39 transition count 246
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 144 place count 39 transition count 232
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 158 place count 25 transition count 232
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 165 place count 25 transition count 232
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 24 transition count 232
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 24 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 168 place count 23 transition count 231
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 182 place count 23 transition count 217
Applied a total of 182 rules in 55 ms. Remains 23 /218 variables (removed 195) and now considering 217/454 (removed 237) transitions.
[2022-05-17 13:12:36] [INFO ] Flow matrix only has 35 transitions (discarded 182 similar events)
// Phase 1: matrix 35 rows 23 cols
[2022-05-17 13:12:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 13:12:36] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/218 places, 217/454 transitions.
Finished random walk after 3773 steps, including 877 resets, run visited all 1 properties in 20 ms. (steps per millisecond=188 )
Computed a total of 218 stabilizing places and 454 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 218 transition count 454
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((!(p0 U p1)&&(G(!p0)||X(!(p2 U p3))))))))'
Support contains 8 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 197 transition count 433
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 197 transition count 433
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 179 transition count 415
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 179 transition count 415
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 82 place count 175 transition count 415
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 99 place count 158 transition count 398
Iterating global reduction 1 with 17 rules applied. Total rules applied 116 place count 158 transition count 398
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 124 place count 150 transition count 398
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 142 place count 132 transition count 380
Iterating global reduction 2 with 18 rules applied. Total rules applied 160 place count 132 transition count 380
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 172 place count 120 transition count 368
Iterating global reduction 2 with 12 rules applied. Total rules applied 184 place count 120 transition count 368
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 196 place count 108 transition count 356
Iterating global reduction 2 with 12 rules applied. Total rules applied 208 place count 108 transition count 356
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 226 place count 90 transition count 338
Iterating global reduction 2 with 18 rules applied. Total rules applied 244 place count 90 transition count 338
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 268 place count 66 transition count 314
Iterating global reduction 2 with 24 rules applied. Total rules applied 292 place count 66 transition count 314
Applied a total of 292 rules in 20 ms. Remains 66 /218 variables (removed 152) and now considering 314/454 (removed 140) transitions.
[2022-05-17 13:12:36] [INFO ] Flow matrix only has 67 transitions (discarded 247 similar events)
// Phase 1: matrix 67 rows 66 cols
[2022-05-17 13:12:36] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 13:12:37] [INFO ] Implicit Places using invariants in 55 ms returned [19, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/218 places, 314/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 310
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 310
Applied a total of 8 rules in 6 ms. Remains 60 /64 variables (removed 4) and now considering 310/314 (removed 4) transitions.
[2022-05-17 13:12:37] [INFO ] Flow matrix only has 62 transitions (discarded 248 similar events)
// Phase 1: matrix 62 rows 60 cols
[2022-05-17 13:12:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2022-05-17 13:12:37] [INFO ] Flow matrix only has 62 transitions (discarded 248 similar events)
// Phase 1: matrix 62 rows 60 cols
[2022-05-17 13:12:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:37] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 60/218 places, 310/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/218 places, 310/454 transitions.
Stuttering acceptance computed with spot in 363 ms :[true, (OR p1 (AND p0 p3)), (OR p1 (AND p0 p3)), (OR p1 (AND p0 p3)), (OR p0 p1), (OR p1 p3)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-00 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 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p0 p3) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(OR p0 p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(OR p1 p3), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (GEQ s21 1) (GEQ s38 1)), p0:(AND (GEQ s35 1) (GEQ s44 1)), p3:(AND (GEQ s27 1) (GEQ s51 1)), p2:(AND (GEQ s34 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 1 reset in 3 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-00 finished in 622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(G(F((G(p2)||p1))))))'
Support contains 6 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Graph (complete) has 850 edges and 218 vertex of which 217 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 217 transition count 426
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 190 transition count 426
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 55 place count 190 transition count 413
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 81 place count 177 transition count 413
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 164 transition count 400
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 164 transition count 400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 159 transition count 395
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 159 transition count 395
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 156 transition count 395
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 120 place count 156 transition count 392
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 126 place count 153 transition count 392
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 150 transition count 389
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 150 transition count 389
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 147 transition count 386
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 147 transition count 386
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 146 place count 139 transition count 378
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 139 transition count 378
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 210 place count 111 transition count 350
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 219 place count 102 transition count 341
Iterating global reduction 3 with 9 rules applied. Total rules applied 228 place count 102 transition count 341
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 229 place count 101 transition count 340
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 101 transition count 340
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 100 transition count 340
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 99 transition count 339
Applied a total of 233 rules in 74 ms. Remains 99 /218 variables (removed 119) and now considering 339/454 (removed 115) transitions.
[2022-05-17 13:12:37] [INFO ] Flow matrix only has 160 transitions (discarded 179 similar events)
// Phase 1: matrix 160 rows 99 cols
[2022-05-17 13:12:37] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 13:12:37] [INFO ] Implicit Places using invariants in 98 ms returned [10, 15, 30, 34, 39, 41, 56, 58, 62, 66, 69]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 101 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/218 places, 339/454 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 88 transition count 338
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 338
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 21 place count 68 transition count 319
Iterating global reduction 0 with 19 rules applied. Total rules applied 40 place count 68 transition count 319
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 63 transition count 314
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 63 transition count 314
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 58 transition count 309
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 58 transition count 309
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 74 place count 51 transition count 302
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 49 transition count 300
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 49 transition count 300
Applied a total of 78 rules in 19 ms. Remains 49 /88 variables (removed 39) and now considering 300/339 (removed 39) transitions.
[2022-05-17 13:12:37] [INFO ] Flow matrix only has 62 transitions (discarded 238 similar events)
// Phase 1: matrix 62 rows 49 cols
[2022-05-17 13:12:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-17 13:12:37] [INFO ] Flow matrix only has 62 transitions (discarded 238 similar events)
// Phase 1: matrix 62 rows 49 cols
[2022-05-17 13:12:37] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-17 13:12:37] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/218 places, 300/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 49/218 places, 300/454 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s44 1)), p2:(AND (GEQ s21 1) (GEQ s24 1)), p1:(OR (LT s8 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12500 reset in 326 ms.
Product exploration explored 100000 steps with 12514 reset in 243 ms.
Computed a total of 49 stabilizing places and 300 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 300
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) p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 8 factoid took 282 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-01 finished in 1424 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(p0))))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 195 transition count 431
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 195 transition count 431
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 64 place count 177 transition count 413
Iterating global reduction 0 with 18 rules applied. Total rules applied 82 place count 177 transition count 413
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 173 transition count 413
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 103 place count 156 transition count 396
Iterating global reduction 1 with 17 rules applied. Total rules applied 120 place count 156 transition count 396
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 128 place count 148 transition count 396
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 146 place count 130 transition count 378
Iterating global reduction 2 with 18 rules applied. Total rules applied 164 place count 130 transition count 378
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 176 place count 118 transition count 366
Iterating global reduction 2 with 12 rules applied. Total rules applied 188 place count 118 transition count 366
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 199 place count 107 transition count 355
Iterating global reduction 2 with 11 rules applied. Total rules applied 210 place count 107 transition count 355
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 227 place count 90 transition count 338
Iterating global reduction 2 with 17 rules applied. Total rules applied 244 place count 90 transition count 338
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 266 place count 68 transition count 316
Iterating global reduction 2 with 22 rules applied. Total rules applied 288 place count 68 transition count 316
Applied a total of 288 rules in 19 ms. Remains 68 /218 variables (removed 150) and now considering 316/454 (removed 138) transitions.
[2022-05-17 13:12:38] [INFO ] Flow matrix only has 75 transitions (discarded 241 similar events)
// Phase 1: matrix 75 rows 68 cols
[2022-05-17 13:12:38] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-17 13:12:39] [INFO ] Implicit Places using invariants in 62 ms returned [19, 35, 41, 45]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 64 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/218 places, 316/454 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 55 transition count 307
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 55 transition count 307
Applied a total of 18 rules in 2 ms. Remains 55 /64 variables (removed 9) and now considering 307/316 (removed 9) transitions.
[2022-05-17 13:12:39] [INFO ] Flow matrix only has 63 transitions (discarded 244 similar events)
// Phase 1: matrix 63 rows 55 cols
[2022-05-17 13:12:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 13:12:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2022-05-17 13:12:39] [INFO ] Flow matrix only has 63 transitions (discarded 244 similar events)
// Phase 1: matrix 63 rows 55 cols
[2022-05-17 13:12:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 13:12:39] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/218 places, 307/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 55/218 places, 307/454 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s24 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 45 steps with 2 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-02 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||p1))))'
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 196 transition count 432
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 196 transition count 432
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 179 transition count 415
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 179 transition count 415
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 82 place count 175 transition count 415
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 98 place count 159 transition count 399
Iterating global reduction 1 with 16 rules applied. Total rules applied 114 place count 159 transition count 399
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 121 place count 152 transition count 399
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 138 place count 135 transition count 382
Iterating global reduction 2 with 17 rules applied. Total rules applied 155 place count 135 transition count 382
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 166 place count 124 transition count 371
Iterating global reduction 2 with 11 rules applied. Total rules applied 177 place count 124 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 188 place count 113 transition count 360
Iterating global reduction 2 with 11 rules applied. Total rules applied 199 place count 113 transition count 360
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 216 place count 96 transition count 343
Iterating global reduction 2 with 17 rules applied. Total rules applied 233 place count 96 transition count 343
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 253 place count 76 transition count 323
Iterating global reduction 2 with 20 rules applied. Total rules applied 273 place count 76 transition count 323
Applied a total of 273 rules in 23 ms. Remains 76 /218 variables (removed 142) and now considering 323/454 (removed 131) transitions.
[2022-05-17 13:12:39] [INFO ] Flow matrix only has 81 transitions (discarded 242 similar events)
// Phase 1: matrix 81 rows 76 cols
[2022-05-17 13:12:39] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 13:12:39] [INFO ] Implicit Places using invariants in 57 ms returned [19, 31, 48, 52]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/218 places, 323/454 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 62 transition count 313
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 62 transition count 313
Applied a total of 20 rules in 3 ms. Remains 62 /72 variables (removed 10) and now considering 313/323 (removed 10) transitions.
[2022-05-17 13:12:39] [INFO ] Flow matrix only has 68 transitions (discarded 245 similar events)
// Phase 1: matrix 68 rows 62 cols
[2022-05-17 13:12:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:39] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-17 13:12:39] [INFO ] Flow matrix only has 68 transitions (discarded 245 similar events)
// Phase 1: matrix 68 rows 62 cols
[2022-05-17 13:12:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:39] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 62/218 places, 313/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 62/218 places, 313/454 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s32 1), p1:(AND (GEQ s16 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 560 steps with 30 reset in 4 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-04 finished in 366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 196 transition count 432
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 196 transition count 432
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 179 transition count 415
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 179 transition count 415
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 82 place count 175 transition count 415
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 98 place count 159 transition count 399
Iterating global reduction 1 with 16 rules applied. Total rules applied 114 place count 159 transition count 399
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 121 place count 152 transition count 399
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 137 place count 136 transition count 383
Iterating global reduction 2 with 16 rules applied. Total rules applied 153 place count 136 transition count 383
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 125 transition count 372
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 125 transition count 372
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 186 place count 114 transition count 361
Iterating global reduction 2 with 11 rules applied. Total rules applied 197 place count 114 transition count 361
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 214 place count 97 transition count 344
Iterating global reduction 2 with 17 rules applied. Total rules applied 231 place count 97 transition count 344
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 252 place count 76 transition count 323
Iterating global reduction 2 with 21 rules applied. Total rules applied 273 place count 76 transition count 323
Applied a total of 273 rules in 19 ms. Remains 76 /218 variables (removed 142) and now considering 323/454 (removed 131) transitions.
[2022-05-17 13:12:39] [INFO ] Flow matrix only has 82 transitions (discarded 241 similar events)
// Phase 1: matrix 82 rows 76 cols
[2022-05-17 13:12:39] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 13:12:39] [INFO ] Implicit Places using invariants in 55 ms returned [19, 31, 37, 52]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/218 places, 323/454 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 62 transition count 313
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 62 transition count 313
Applied a total of 20 rules in 2 ms. Remains 62 /72 variables (removed 10) and now considering 313/323 (removed 10) transitions.
[2022-05-17 13:12:39] [INFO ] Flow matrix only has 69 transitions (discarded 244 similar events)
// Phase 1: matrix 69 rows 62 cols
[2022-05-17 13:12:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:39] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-17 13:12:39] [INFO ] Flow matrix only has 69 transitions (discarded 244 similar events)
// Phase 1: matrix 69 rows 62 cols
[2022-05-17 13:12:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:39] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 62/218 places, 313/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 62/218 places, 313/454 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s36 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]]
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Computed a total of 62 stabilizing places and 313 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 313
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 :(X p0)
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-05 finished in 766 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(X(p0)||F(X(p0))||G(p0)))))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 196 transition count 432
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 196 transition count 432
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 62 place count 178 transition count 414
Iterating global reduction 0 with 18 rules applied. Total rules applied 80 place count 178 transition count 414
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 174 transition count 414
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 101 place count 157 transition count 397
Iterating global reduction 1 with 17 rules applied. Total rules applied 118 place count 157 transition count 397
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 126 place count 149 transition count 397
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 144 place count 131 transition count 379
Iterating global reduction 2 with 18 rules applied. Total rules applied 162 place count 131 transition count 379
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 174 place count 119 transition count 367
Iterating global reduction 2 with 12 rules applied. Total rules applied 186 place count 119 transition count 367
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 198 place count 107 transition count 355
Iterating global reduction 2 with 12 rules applied. Total rules applied 210 place count 107 transition count 355
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 228 place count 89 transition count 337
Iterating global reduction 2 with 18 rules applied. Total rules applied 246 place count 89 transition count 337
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 270 place count 65 transition count 313
Iterating global reduction 2 with 24 rules applied. Total rules applied 294 place count 65 transition count 313
Applied a total of 294 rules in 18 ms. Remains 65 /218 variables (removed 153) and now considering 313/454 (removed 141) transitions.
[2022-05-17 13:12:40] [INFO ] Flow matrix only has 65 transitions (discarded 248 similar events)
// Phase 1: matrix 65 rows 65 cols
[2022-05-17 13:12:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 13:12:40] [INFO ] Implicit Places using invariants in 50 ms returned [31, 37, 41]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/218 places, 313/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 307
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 307
Applied a total of 12 rules in 3 ms. Remains 56 /62 variables (removed 6) and now considering 307/313 (removed 6) transitions.
[2022-05-17 13:12:40] [INFO ] Flow matrix only has 57 transitions (discarded 250 similar events)
// Phase 1: matrix 57 rows 56 cols
[2022-05-17 13:12:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-17 13:12:40] [INFO ] Flow matrix only has 57 transitions (discarded 250 similar events)
// Phase 1: matrix 57 rows 56 cols
[2022-05-17 13:12:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:40] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/218 places, 307/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 56/218 places, 307/454 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-06 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 s16 1) (GEQ s39 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 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-06 finished in 268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X((X(p2)&&p1)) U !p2))))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 198 transition count 434
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 198 transition count 434
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 55 place count 183 transition count 419
Iterating global reduction 0 with 15 rules applied. Total rules applied 70 place count 183 transition count 419
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 181 transition count 419
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 84 place count 169 transition count 407
Iterating global reduction 1 with 12 rules applied. Total rules applied 96 place count 169 transition count 407
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 103 place count 162 transition count 407
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 117 place count 148 transition count 393
Iterating global reduction 2 with 14 rules applied. Total rules applied 131 place count 148 transition count 393
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 140 place count 139 transition count 384
Iterating global reduction 2 with 9 rules applied. Total rules applied 149 place count 139 transition count 384
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 158 place count 130 transition count 375
Iterating global reduction 2 with 9 rules applied. Total rules applied 167 place count 130 transition count 375
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 178 place count 119 transition count 364
Iterating global reduction 2 with 11 rules applied. Total rules applied 189 place count 119 transition count 364
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 210 place count 98 transition count 343
Iterating global reduction 2 with 21 rules applied. Total rules applied 231 place count 98 transition count 343
Applied a total of 231 rules in 19 ms. Remains 98 /218 variables (removed 120) and now considering 343/454 (removed 111) transitions.
[2022-05-17 13:12:40] [INFO ] Flow matrix only has 118 transitions (discarded 225 similar events)
// Phase 1: matrix 118 rows 98 cols
[2022-05-17 13:12:40] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-17 13:12:40] [INFO ] Implicit Places using invariants in 70 ms returned [30, 42, 48, 52]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/218 places, 343/454 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 80 transition count 329
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 80 transition count 329
Applied a total of 28 rules in 2 ms. Remains 80 /94 variables (removed 14) and now considering 329/343 (removed 14) transitions.
[2022-05-17 13:12:40] [INFO ] Flow matrix only has 101 transitions (discarded 228 similar events)
// Phase 1: matrix 101 rows 80 cols
[2022-05-17 13:12:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:12:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-17 13:12:40] [INFO ] Flow matrix only has 101 transitions (discarded 228 similar events)
// Phase 1: matrix 101 rows 80 cols
[2022-05-17 13:12:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 13:12:40] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 80/218 places, 329/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 80/218 places, 329/454 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), p2, p2, true, true]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s58 1) (GEQ s60 1)), p0:(AND (GEQ s48 1) (GEQ s50 1) (GEQ s20 1)), p1:(AND (GEQ s58 1) (GEQ s60 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 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Computed a total of 80 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 329
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)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p2 (NOT p0))))
Knowledge based reduction with 10 factoid took 149 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-07 finished in 987 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((G(p0) U X(p1))))||G(!p0))))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 196 transition count 432
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 196 transition count 432
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 62 place count 178 transition count 414
Iterating global reduction 0 with 18 rules applied. Total rules applied 80 place count 178 transition count 414
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 174 transition count 414
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 101 place count 157 transition count 397
Iterating global reduction 1 with 17 rules applied. Total rules applied 118 place count 157 transition count 397
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 126 place count 149 transition count 397
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 144 place count 131 transition count 379
Iterating global reduction 2 with 18 rules applied. Total rules applied 162 place count 131 transition count 379
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 174 place count 119 transition count 367
Iterating global reduction 2 with 12 rules applied. Total rules applied 186 place count 119 transition count 367
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 198 place count 107 transition count 355
Iterating global reduction 2 with 12 rules applied. Total rules applied 210 place count 107 transition count 355
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 228 place count 89 transition count 337
Iterating global reduction 2 with 18 rules applied. Total rules applied 246 place count 89 transition count 337
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 270 place count 65 transition count 313
Iterating global reduction 2 with 24 rules applied. Total rules applied 294 place count 65 transition count 313
Applied a total of 294 rules in 19 ms. Remains 65 /218 variables (removed 153) and now considering 313/454 (removed 141) transitions.
[2022-05-17 13:12:41] [INFO ] Flow matrix only has 65 transitions (discarded 248 similar events)
// Phase 1: matrix 65 rows 65 cols
[2022-05-17 13:12:41] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 13:12:41] [INFO ] Implicit Places using invariants in 66 ms returned [19, 31, 41]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/218 places, 313/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 307
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 307
Applied a total of 12 rules in 1 ms. Remains 56 /62 variables (removed 6) and now considering 307/313 (removed 6) transitions.
[2022-05-17 13:12:41] [INFO ] Flow matrix only has 56 transitions (discarded 251 similar events)
// Phase 1: matrix 56 rows 56 cols
[2022-05-17 13:12:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-17 13:12:41] [INFO ] Flow matrix only has 56 transitions (discarded 251 similar events)
// Phase 1: matrix 56 rows 56 cols
[2022-05-17 13:12:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:41] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/218 places, 307/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 56/218 places, 307/454 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s30 1) (GEQ s47 1)), p0:(AND (GEQ s28 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-08 finished in 454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((F(X(X(p1)))&&p0))) U p2))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Graph (complete) has 850 edges and 218 vertex of which 217 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 217 transition count 428
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 192 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 191 transition count 427
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 53 place count 191 transition count 415
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 77 place count 179 transition count 415
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 89 place count 167 transition count 403
Iterating global reduction 3 with 12 rules applied. Total rules applied 101 place count 167 transition count 403
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 163 transition count 399
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 163 transition count 399
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 112 place count 160 transition count 399
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 112 place count 160 transition count 396
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 118 place count 157 transition count 396
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 121 place count 154 transition count 393
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 154 transition count 393
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 127 place count 151 transition count 390
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 151 transition count 390
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 135 place count 146 transition count 385
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 146 transition count 385
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 202 place count 115 transition count 354
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 213 place count 104 transition count 343
Iterating global reduction 4 with 11 rules applied. Total rules applied 224 place count 104 transition count 343
Applied a total of 224 rules in 49 ms. Remains 104 /218 variables (removed 114) and now considering 343/454 (removed 111) transitions.
[2022-05-17 13:12:42] [INFO ] Flow matrix only has 165 transitions (discarded 178 similar events)
// Phase 1: matrix 165 rows 104 cols
[2022-05-17 13:12:42] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-17 13:12:42] [INFO ] Implicit Places using invariants in 76 ms returned [18, 23, 33, 37, 42, 44, 49, 56, 58, 68, 71]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 78 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/218 places, 343/454 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 74 transition count 324
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 74 transition count 324
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 69 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 69 transition count 319
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 64 transition count 314
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 64 transition count 314
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 74 place count 56 transition count 306
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 54 transition count 304
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 54 transition count 304
Applied a total of 78 rules in 11 ms. Remains 54 /93 variables (removed 39) and now considering 304/343 (removed 39) transitions.
[2022-05-17 13:12:42] [INFO ] Flow matrix only has 67 transitions (discarded 237 similar events)
// Phase 1: matrix 67 rows 54 cols
[2022-05-17 13:12:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:42] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-17 13:12:42] [INFO ] Flow matrix only has 67 transitions (discarded 237 similar events)
// Phase 1: matrix 67 rows 54 cols
[2022-05-17 13:12:42] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-17 13:12:42] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/218 places, 304/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/218 places, 304/454 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s29 1), p1:(GEQ s46 1), p0:(AND (GEQ s8 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-10 finished in 396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Graph (complete) has 850 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 217 transition count 426
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 190 transition count 426
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 55 place count 190 transition count 413
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 81 place count 177 transition count 413
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 164 transition count 400
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 164 transition count 400
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 160 transition count 396
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 160 transition count 396
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 158 transition count 396
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 117 place count 158 transition count 394
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 121 place count 156 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 154 transition count 392
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 154 transition count 392
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 152 transition count 390
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 152 transition count 390
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 135 place count 146 transition count 384
Iterating global reduction 3 with 6 rules applied. Total rules applied 141 place count 146 transition count 384
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 205 place count 114 transition count 352
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 213 place count 106 transition count 344
Iterating global reduction 3 with 8 rules applied. Total rules applied 221 place count 106 transition count 344
Applied a total of 221 rules in 34 ms. Remains 106 /218 variables (removed 112) and now considering 344/454 (removed 110) transitions.
[2022-05-17 13:12:42] [INFO ] Flow matrix only has 174 transitions (discarded 170 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-05-17 13:12:42] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-17 13:12:42] [INFO ] Implicit Places using invariants in 88 ms returned [10, 15, 26, 36, 40, 45, 47, 52, 59, 61, 65, 69, 72]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 90 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/218 places, 344/454 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 72 transition count 323
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 72 transition count 323
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 65 transition count 316
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 65 transition count 316
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 58 transition count 309
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 58 transition count 309
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 84 place count 51 transition count 302
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 49 transition count 300
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 49 transition count 300
Applied a total of 88 rules in 9 ms. Remains 49 /93 variables (removed 44) and now considering 300/344 (removed 44) transitions.
[2022-05-17 13:12:42] [INFO ] Flow matrix only has 55 transitions (discarded 245 similar events)
// Phase 1: matrix 55 rows 49 cols
[2022-05-17 13:12:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-17 13:12:42] [INFO ] Flow matrix only has 55 transitions (discarded 245 similar events)
// Phase 1: matrix 55 rows 49 cols
[2022-05-17 13:12:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/218 places, 300/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 49/218 places, 300/454 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s40 1), p1:(AND (GEQ s10 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10821 reset in 138 ms.
Product exploration explored 100000 steps with 10832 reset in 141 ms.
Computed a total of 49 stabilizing places and 300 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 300
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-11 finished in 776 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!F(p0) U X(p1)))||p2)))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 196 transition count 432
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 196 transition count 432
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 179 transition count 415
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 179 transition count 415
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 82 place count 175 transition count 415
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 98 place count 159 transition count 399
Iterating global reduction 1 with 16 rules applied. Total rules applied 114 place count 159 transition count 399
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 121 place count 152 transition count 399
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 137 place count 136 transition count 383
Iterating global reduction 2 with 16 rules applied. Total rules applied 153 place count 136 transition count 383
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 125 transition count 372
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 125 transition count 372
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 186 place count 114 transition count 361
Iterating global reduction 2 with 11 rules applied. Total rules applied 197 place count 114 transition count 361
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 214 place count 97 transition count 344
Iterating global reduction 2 with 17 rules applied. Total rules applied 231 place count 97 transition count 344
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 250 place count 78 transition count 325
Iterating global reduction 2 with 19 rules applied. Total rules applied 269 place count 78 transition count 325
Applied a total of 269 rules in 17 ms. Remains 78 /218 variables (removed 140) and now considering 325/454 (removed 129) transitions.
[2022-05-17 13:12:43] [INFO ] Flow matrix only has 85 transitions (discarded 240 similar events)
// Phase 1: matrix 85 rows 78 cols
[2022-05-17 13:12:43] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-17 13:12:43] [INFO ] Implicit Places using invariants in 53 ms returned [19, 50, 54]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/218 places, 325/454 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 317
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 317
Applied a total of 16 rules in 1 ms. Remains 67 /75 variables (removed 8) and now considering 317/325 (removed 8) transitions.
[2022-05-17 13:12:43] [INFO ] Flow matrix only has 75 transitions (discarded 242 similar events)
// Phase 1: matrix 75 rows 67 cols
[2022-05-17 13:12:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-17 13:12:43] [INFO ] Flow matrix only has 75 transitions (discarded 242 similar events)
// Phase 1: matrix 75 rows 67 cols
[2022-05-17 13:12:43] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/218 places, 317/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 67/218 places, 317/454 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s42 1) (GEQ s49 1)), p0:(AND (GEQ s36 1) (GEQ s38 1) (GEQ s42 1) (GEQ s49 1)), p1:(LT s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25766 reset in 175 ms.
Product exploration explored 100000 steps with 25714 reset in 188 ms.
Computed a total of 67 stabilizing places and 317 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 317
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) p1), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 10 factoid took 540 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 504 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 13:12:44] [INFO ] Flow matrix only has 75 transitions (discarded 242 similar events)
// Phase 1: matrix 75 rows 67 cols
[2022-05-17 13:12:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 13:12:45] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G p1)), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F p2), (F p0), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 1026 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 7 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, p0]
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 317/317 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2022-05-17 13:12:46] [INFO ] Flow matrix only has 75 transitions (discarded 242 similar events)
// Phase 1: matrix 75 rows 67 cols
[2022-05-17 13:12:46] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 13:12:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-17 13:12:46] [INFO ] Flow matrix only has 75 transitions (discarded 242 similar events)
// Phase 1: matrix 75 rows 67 cols
[2022-05-17 13:12:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:46] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-05-17 13:12:46] [INFO ] Flow matrix only has 75 transitions (discarded 242 similar events)
// Phase 1: matrix 75 rows 67 cols
[2022-05-17 13:12:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:46] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 317/317 transitions.
Computed a total of 67 stabilizing places and 317 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 317
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) p1 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 7 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 507 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Finished Best-First random walk after 57 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 365 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 7 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, p0]
Product exploration explored 100000 steps with 20709 reset in 185 ms.
Product exploration explored 100000 steps with 20691 reset in 179 ms.
Applying partial POR strategy [false, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, p0]
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 317/317 transitions.
Graph (complete) has 458 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 66 transition count 316
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 66 transition count 317
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 66 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 64 transition count 315
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 64 transition count 315
Performed 6 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 6 rules applied. Total rules applied 20 place count 64 transition count 315
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 60 transition count 311
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 60 transition count 311
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 28 rules in 17 ms. Remains 60 /67 variables (removed 7) and now considering 311/317 (removed 6) transitions.
[2022-05-17 13:12:49] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-17 13:12:49] [INFO ] Flow matrix only has 67 transitions (discarded 244 similar events)
// Phase 1: matrix 67 rows 60 cols
[2022-05-17 13:12:49] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:49] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/67 places, 311/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/67 places, 311/317 transitions.
Product exploration explored 100000 steps with 20691 reset in 210 ms.
Product exploration explored 100000 steps with 20794 reset in 211 ms.
Built C files in :
/tmp/ltsmin14984121244709638805
[2022-05-17 13:12:49] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14984121244709638805
Running compilation step : cd /tmp/ltsmin14984121244709638805;'/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 519 ms.
Running link step : cd /tmp/ltsmin14984121244709638805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14984121244709638805;'/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/stateBased17384594801529810690.hoa' '--buchi-type=spotba'
LTSmin run took 644 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-12 finished in 7695 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&G(p1))))))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Graph (complete) has 850 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 217 transition count 426
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 190 transition count 426
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 55 place count 190 transition count 414
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 79 place count 178 transition count 414
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 92 place count 165 transition count 401
Iterating global reduction 2 with 13 rules applied. Total rules applied 105 place count 165 transition count 401
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 110 place count 160 transition count 396
Iterating global reduction 2 with 5 rules applied. Total rules applied 115 place count 160 transition count 396
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 157 transition count 396
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 118 place count 157 transition count 393
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 124 place count 154 transition count 393
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 151 transition count 390
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 151 transition count 390
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 148 transition count 387
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 148 transition count 387
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 141 place count 143 transition count 382
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 143 transition count 382
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 208 place count 112 transition count 351
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 219 place count 101 transition count 340
Iterating global reduction 3 with 11 rules applied. Total rules applied 230 place count 101 transition count 340
Applied a total of 230 rules in 38 ms. Remains 101 /218 variables (removed 117) and now considering 340/454 (removed 114) transitions.
[2022-05-17 13:12:51] [INFO ] Flow matrix only has 162 transitions (discarded 178 similar events)
// Phase 1: matrix 162 rows 101 cols
[2022-05-17 13:12:51] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 13:12:51] [INFO ] Implicit Places using invariants in 83 ms returned [10, 15, 20, 30, 34, 39, 41, 46, 53, 55, 59, 63]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 85 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/218 places, 340/454 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 69 transition count 320
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 69 transition count 320
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 63 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 63 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 57 transition count 308
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 57 transition count 308
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 78 place count 50 transition count 301
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 48 transition count 299
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 48 transition count 299
Applied a total of 82 rules in 12 ms. Remains 48 /89 variables (removed 41) and now considering 299/340 (removed 41) transitions.
[2022-05-17 13:12:51] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
// Phase 1: matrix 54 rows 48 cols
[2022-05-17 13:12:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:51] [INFO ] Implicit Places using invariants in 47 ms returned []
[2022-05-17 13:12:51] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
// Phase 1: matrix 54 rows 48 cols
[2022-05-17 13:12:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:51] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/218 places, 299/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/218 places, 299/454 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(LT s41 1), p0:(LT s26 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11345 reset in 192 ms.
Product exploration explored 100000 steps with 11318 reset in 184 ms.
Computed a total of 48 stabilizing places and 299 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 299
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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 13 factoid took 934 ms. Reduced automaton from 2 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-13 finished in 1697 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!G(F(X(p0))) U !(F(p1)||p2))))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Graph (complete) has 850 edges and 218 vertex of which 217 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 217 transition count 426
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 190 transition count 426
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 55 place count 190 transition count 413
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 81 place count 177 transition count 413
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 164 transition count 400
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 164 transition count 400
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 160 transition count 396
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 160 transition count 396
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 157 transition count 396
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 118 place count 157 transition count 393
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 124 place count 154 transition count 393
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 151 transition count 390
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 151 transition count 390
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 148 transition count 387
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 148 transition count 387
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 144 place count 140 transition count 379
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 140 transition count 379
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 212 place count 110 transition count 349
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 220 place count 102 transition count 341
Iterating global reduction 3 with 8 rules applied. Total rules applied 228 place count 102 transition count 341
Applied a total of 228 rules in 39 ms. Remains 102 /218 variables (removed 116) and now considering 341/454 (removed 113) transitions.
[2022-05-17 13:12:52] [INFO ] Flow matrix only has 162 transitions (discarded 179 similar events)
// Phase 1: matrix 162 rows 102 cols
[2022-05-17 13:12:52] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 13:12:52] [INFO ] Implicit Places using invariants in 79 ms returned [10, 15, 20, 36, 41, 43, 58, 60, 64, 68, 71]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 80 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/218 places, 341/454 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 72 transition count 322
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 72 transition count 322
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 67 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 67 transition count 317
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 62 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 62 transition count 312
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 74 place count 54 transition count 304
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 52 transition count 302
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 52 transition count 302
Applied a total of 78 rules in 10 ms. Remains 52 /91 variables (removed 39) and now considering 302/341 (removed 39) transitions.
[2022-05-17 13:12:52] [INFO ] Flow matrix only has 64 transitions (discarded 238 similar events)
// Phase 1: matrix 64 rows 52 cols
[2022-05-17 13:12:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:52] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-17 13:12:52] [INFO ] Flow matrix only has 64 transitions (discarded 238 similar events)
// Phase 1: matrix 64 rows 52 cols
[2022-05-17 13:12:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:52] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/218 places, 302/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 52/218 places, 302/454 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR p2 p1), p0, (OR p2 p1), p1, p1, false]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=p1, acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s16 1), p0:(AND (GEQ s29 1) (GEQ s38 1)), p1:(AND (GEQ s24 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 10878 reset in 172 ms.
Product exploration explored 100000 steps with 10842 reset in 187 ms.
Computed a total of 52 stabilizing places and 302 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 302
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)), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR p2 p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 18 factoid took 1069 ms. Reduced automaton from 6 states, 22 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[p1, (OR p1 p2), p1]
Finished random walk after 206 steps, including 22 resets, run visited all 3 properties in 9 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR p2 p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (OR p2 p1)), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 18 factoid took 1047 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[p1, (OR p1 p2), p1]
Stuttering acceptance computed with spot in 108 ms :[p1, (OR p1 p2), p1]
Support contains 3 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 302/302 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2022-05-17 13:12:56] [INFO ] Flow matrix only has 64 transitions (discarded 238 similar events)
// Phase 1: matrix 64 rows 52 cols
[2022-05-17 13:12:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:56] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-05-17 13:12:56] [INFO ] Flow matrix only has 64 transitions (discarded 238 similar events)
// Phase 1: matrix 64 rows 52 cols
[2022-05-17 13:12:56] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 13:12:56] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2022-05-17 13:12:56] [INFO ] Flow matrix only has 64 transitions (discarded 238 similar events)
// Phase 1: matrix 64 rows 52 cols
[2022-05-17 13:12:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:56] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 302/302 transitions.
Computed a total of 52 stabilizing places and 302 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 302
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)), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 225 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[p1, (OR p1 p2), p1]
Finished random walk after 95 steps, including 10 resets, run visited all 3 properties in 5 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (OR p2 p1)), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[p1, (OR p1 p2), p1]
Stuttering acceptance computed with spot in 111 ms :[p1, (OR p1 p2), p1]
Stuttering acceptance computed with spot in 109 ms :[p1, (OR p1 p2), p1]
Product exploration explored 100000 steps with 10856 reset in 152 ms.
Product exploration explored 100000 steps with 10851 reset in 156 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 117 ms :[p1, (OR p1 p2), p1]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 302/302 transitions.
Applied a total of 0 rules in 6 ms. Remains 52 /52 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2022-05-17 13:12:57] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 13:12:57] [INFO ] Flow matrix only has 64 transitions (discarded 238 similar events)
// Phase 1: matrix 64 rows 52 cols
[2022-05-17 13:12:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:57] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 302/302 transitions.
Product exploration explored 100000 steps with 10900 reset in 286 ms.
Product exploration explored 100000 steps with 10888 reset in 290 ms.
Built C files in :
/tmp/ltsmin8501224644350785396
[2022-05-17 13:12:58] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8501224644350785396
Running compilation step : cd /tmp/ltsmin8501224644350785396;'/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 390 ms.
Running link step : cd /tmp/ltsmin8501224644350785396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8501224644350785396;'/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/stateBased9532329643682466935.hoa' '--buchi-type=spotba'
LTSmin run took 522 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-14 finished in 6792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X((X(G(p1))||p0)))&&F(p2)))))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 197 transition count 433
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 197 transition count 433
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 180 transition count 416
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 180 transition count 416
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 80 place count 176 transition count 416
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 96 place count 160 transition count 400
Iterating global reduction 1 with 16 rules applied. Total rules applied 112 place count 160 transition count 400
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 119 place count 153 transition count 400
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 136 place count 136 transition count 383
Iterating global reduction 2 with 17 rules applied. Total rules applied 153 place count 136 transition count 383
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 125 transition count 372
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 125 transition count 372
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 186 place count 114 transition count 361
Iterating global reduction 2 with 11 rules applied. Total rules applied 197 place count 114 transition count 361
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 214 place count 97 transition count 344
Iterating global reduction 2 with 17 rules applied. Total rules applied 231 place count 97 transition count 344
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 252 place count 76 transition count 323
Iterating global reduction 2 with 21 rules applied. Total rules applied 273 place count 76 transition count 323
Applied a total of 273 rules in 14 ms. Remains 76 /218 variables (removed 142) and now considering 323/454 (removed 131) transitions.
[2022-05-17 13:12:59] [INFO ] Flow matrix only has 83 transitions (discarded 240 similar events)
// Phase 1: matrix 83 rows 76 cols
[2022-05-17 13:12:59] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 13:12:59] [INFO ] Implicit Places using invariants in 57 ms returned [20, 42, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 74 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/218 places, 323/454 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 66 transition count 316
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 66 transition count 316
Applied a total of 14 rules in 2 ms. Remains 66 /73 variables (removed 7) and now considering 316/323 (removed 7) transitions.
[2022-05-17 13:12:59] [INFO ] Flow matrix only has 74 transitions (discarded 242 similar events)
// Phase 1: matrix 74 rows 66 cols
[2022-05-17 13:12:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:59] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-17 13:12:59] [INFO ] Flow matrix only has 74 transitions (discarded 242 similar events)
// Phase 1: matrix 74 rows 66 cols
[2022-05-17 13:12:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:59] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/218 places, 316/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 66/218 places, 316/454 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s42 1)), p0:(OR (LT s39 1) (LT s40 1)), p1:(LT s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 2 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-15 finished in 342 ms.
All properties solved by simple procedures.
Total runtime 26191 ms.

BK_STOP 1652793180237

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

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