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.r150-smll-165276998400124.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 NoC3x3-PT-1B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998400124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.1K Apr 29 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 362K 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 NoC3x3-PT-1B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652967944928

Running Version 202205111006
[2022-05-19 13:45:46] [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-19 13:45:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:45:47] [INFO ] Load time of PNML (sax parser for PT used): 345 ms
[2022-05-19 13:45:47] [INFO ] Transformed 1416 places.
[2022-05-19 13:45:47] [INFO ] Transformed 1640 transitions.
[2022-05-19 13:45:47] [INFO ] Found NUPN structural information;
[2022-05-19 13:45:47] [INFO ] Parsed PT model containing 1416 places and 1640 transitions in 554 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA NoC3x3-PT-1B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Discarding 351 places :
Symmetric choice reduction at 0 with 351 rule applications. Total rules 351 place count 1065 transition count 1289
Iterating global reduction 0 with 351 rules applied. Total rules applied 702 place count 1065 transition count 1289
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 900 place count 867 transition count 1091
Iterating global reduction 0 with 198 rules applied. Total rules applied 1098 place count 867 transition count 1091
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 0 with 77 rules applied. Total rules applied 1175 place count 867 transition count 1014
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 1213 place count 829 transition count 976
Iterating global reduction 1 with 38 rules applied. Total rules applied 1251 place count 829 transition count 976
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 1270 place count 829 transition count 957
Applied a total of 1270 rules in 396 ms. Remains 829 /1416 variables (removed 587) and now considering 957/1640 (removed 683) transitions.
// Phase 1: matrix 957 rows 829 cols
[2022-05-19 13:45:48] [INFO ] Computed 40 place invariants in 54 ms
[2022-05-19 13:45:48] [INFO ] Implicit Places using invariants in 876 ms returned []
// Phase 1: matrix 957 rows 829 cols
[2022-05-19 13:45:48] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-19 13:45:50] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
// Phase 1: matrix 957 rows 829 cols
[2022-05-19 13:45:50] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-19 13:45:51] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 829/1416 places, 957/1640 transitions.
Finished structural reductions, in 1 iterations. Remains : 829/1416 places, 957/1640 transitions.
Support contains 33 out of 829 places after structural reductions.
[2022-05-19 13:45:51] [INFO ] Flatten gal took : 163 ms
[2022-05-19 13:45:51] [INFO ] Flatten gal took : 80 ms
[2022-05-19 13:45:52] [INFO ] Input system was already deterministic with 957 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 905 ms. (steps per millisecond=11 ) properties (out of 28) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 957 rows 829 cols
[2022-05-19 13:45:53] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-19 13:45:53] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2022-05-19 13:45:53] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 13:45:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 43 ms returned sat
[2022-05-19 13:45:55] [INFO ] After 992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 13:45:56] [INFO ] After 1723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 374 ms.
[2022-05-19 13:45:56] [INFO ] After 2600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 6 properties in 45 ms.
Support contains 3 out of 829 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 829/829 places, 957/957 transitions.
Graph (trivial) has 769 edges and 829 vertex of which 522 / 829 are part of one of the 19 SCC in 9 ms
Free SCC test removed 503 places
Drop transitions removed 590 transitions
Reduce isomorphic transitions removed 590 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 326 transition count 351
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 310 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 309 transition count 350
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 35 place count 309 transition count 333
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 69 place count 292 transition count 333
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 80 place count 281 transition count 313
Iterating global reduction 3 with 11 rules applied. Total rules applied 91 place count 281 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 281 transition count 312
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 280 transition count 312
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 278 transition count 308
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 278 transition count 308
Performed 64 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 225 place count 214 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 214 transition count 242
Performed 3 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 232 place count 211 transition count 276
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 236 place count 211 transition count 272
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 245 place count 211 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 247 place count 210 transition count 277
Free-agglomeration rule applied 97 times.
Iterating global reduction 5 with 97 rules applied. Total rules applied 344 place count 210 transition count 180
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 347 edges and 113 vertex of which 64 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.4 ms
Discarding 49 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Iterating post reduction 5 with 114 rules applied. Total rules applied 458 place count 64 transition count 141
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 33 rules applied. Total rules applied 491 place count 64 transition count 108
Applied a total of 491 rules in 234 ms. Remains 64 /829 variables (removed 765) and now considering 108/957 (removed 849) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/829 places, 108/957 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 69020 steps, run visited all 1 properties in 265 ms. (steps per millisecond=260 )
Probabilistic random walk after 69020 steps, saw 12415 distinct states, run finished after 265 ms. (steps per millisecond=260 ) properties seen :1
FORMULA NoC3x3-PT-1B-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 39 stabilizing places and 39 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Graph (trivial) has 769 edges and 829 vertex of which 538 / 829 are part of one of the 20 SCC in 2 ms
Free SCC test removed 518 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Reduce places removed 1 places and 1 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 0 with 6 rules applied. Total rules applied 7 place count 310 transition count 364
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 304 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 303 transition count 363
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 15 place count 303 transition count 346
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 49 place count 286 transition count 346
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 61 place count 274 transition count 323
Iterating global reduction 3 with 12 rules applied. Total rules applied 73 place count 274 transition count 323
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 73 place count 274 transition count 322
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 273 transition count 322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 271 transition count 318
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 271 transition count 318
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 197 place count 212 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 212 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 211 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 211 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 210 transition count 260
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 142 edges and 204 vertex of which 26 / 204 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 209 place count 191 transition count 260
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 235 place count 191 transition count 234
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 7 with 2 rules applied. Total rules applied 237 place count 190 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 240 place count 190 transition count 230
Applied a total of 240 rules in 113 ms. Remains 190 /829 variables (removed 639) and now considering 230/957 (removed 727) transitions.
[2022-05-19 13:45:57] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
// Phase 1: matrix 211 rows 190 cols
[2022-05-19 13:45:57] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 13:45:57] [INFO ] Implicit Places using invariants in 184 ms returned []
[2022-05-19 13:45:57] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
// Phase 1: matrix 211 rows 190 cols
[2022-05-19 13:45:57] [INFO ] Computed 34 place invariants in 7 ms
[2022-05-19 13:45:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:45:58] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2022-05-19 13:45:58] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-19 13:45:58] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
// Phase 1: matrix 211 rows 190 cols
[2022-05-19 13:45:58] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 13:45:58] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/829 places, 230/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/829 places, 230/957 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 180 steps with 3 reset in 7 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-00 finished in 1070 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(p2)))'
Support contains 4 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Graph (trivial) has 765 edges and 829 vertex of which 545 / 829 are part of one of the 20 SCC in 2 ms
Free SCC test removed 525 places
Ensure Unique test removed 595 transitions
Reduce isomorphic transitions removed 595 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 303 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 302 transition count 360
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 3 place count 302 transition count 344
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 35 place count 286 transition count 344
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 45 place count 276 transition count 323
Iterating global reduction 2 with 10 rules applied. Total rules applied 55 place count 276 transition count 323
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 173 place count 217 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 216 transition count 263
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 142 edges and 210 vertex of which 24 / 210 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 183 place count 198 transition count 261
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 211 place count 196 transition count 235
Applied a total of 211 rules in 60 ms. Remains 196 /829 variables (removed 633) and now considering 235/957 (removed 722) transitions.
[2022-05-19 13:45:58] [INFO ] Flow matrix only has 215 transitions (discarded 20 similar events)
// Phase 1: matrix 215 rows 196 cols
[2022-05-19 13:45:58] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 13:45:58] [INFO ] Implicit Places using invariants in 154 ms returned []
[2022-05-19 13:45:58] [INFO ] Flow matrix only has 215 transitions (discarded 20 similar events)
// Phase 1: matrix 215 rows 196 cols
[2022-05-19 13:45:58] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 13:45:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:45:59] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2022-05-19 13:45:59] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-19 13:45:59] [INFO ] Flow matrix only has 215 transitions (discarded 20 similar events)
// Phase 1: matrix 215 rows 196 cols
[2022-05-19 13:45:59] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 13:45:59] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/829 places, 235/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/829 places, 235/957 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(EQ s131 1), p0:(AND (EQ s4 1) (EQ s40 1)), p2:(EQ s103 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2018 steps with 38 reset in 30 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-02 finished in 905 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!((F(p0)||p1) U !p1))&&p0)))'
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 819 transition count 947
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 819 transition count 947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 819 transition count 944
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 815 transition count 940
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 815 transition count 940
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 815 transition count 937
Applied a total of 34 rules in 95 ms. Remains 815 /829 variables (removed 14) and now considering 937/957 (removed 20) transitions.
// Phase 1: matrix 937 rows 815 cols
[2022-05-19 13:45:59] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:45:59] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 937 rows 815 cols
[2022-05-19 13:45:59] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-19 13:46:00] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
// Phase 1: matrix 937 rows 815 cols
[2022-05-19 13:46:00] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-19 13:46:01] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 815/829 places, 937/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 815/829 places, 937/957 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-04 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s581 1), p1:(EQ s362 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-04 finished in 2587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(X((G(p0) U p1))))))'
Support contains 4 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 819 transition count 947
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 819 transition count 947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 819 transition count 944
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 815 transition count 940
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 815 transition count 940
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 815 transition count 937
Applied a total of 34 rules in 93 ms. Remains 815 /829 variables (removed 14) and now considering 937/957 (removed 20) transitions.
// Phase 1: matrix 937 rows 815 cols
[2022-05-19 13:46:02] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-19 13:46:02] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 937 rows 815 cols
[2022-05-19 13:46:02] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-19 13:46:03] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
// Phase 1: matrix 937 rows 815 cols
[2022-05-19 13:46:03] [INFO ] Computed 40 place invariants in 6 ms
[2022-05-19 13:46:04] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 815/829 places, 937/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 815/829 places, 937/957 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s363 1) (EQ s42 1) (EQ s73 1)), p0:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-05 finished in 2647 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)) U X(X(X(G(p2))))))'
Support contains 3 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 821 transition count 949
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 821 transition count 949
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 821 transition count 947
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 818 transition count 944
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 818 transition count 944
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 818 transition count 942
Applied a total of 26 rules in 99 ms. Remains 818 /829 variables (removed 11) and now considering 942/957 (removed 15) transitions.
// Phase 1: matrix 942 rows 818 cols
[2022-05-19 13:46:04] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:05] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 942 rows 818 cols
[2022-05-19 13:46:05] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:05] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
// Phase 1: matrix 942 rows 818 cols
[2022-05-19 13:46:05] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-19 13:46:06] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 818/829 places, 942/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 818/829 places, 942/957 transitions.
Stuttering acceptance computed with spot in 392 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND p0 p1), acceptance={} source=7 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 4}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(EQ s546 1), p2:(NEQ s319 1), p0:(EQ s360 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 66494 steps with 67 reset in 284 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-06 finished in 2941 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&X(p1))))'
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 820 transition count 948
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 820 transition count 948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 820 transition count 945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 817 transition count 942
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 817 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 817 transition count 940
Applied a total of 29 rules in 95 ms. Remains 817 /829 variables (removed 12) and now considering 940/957 (removed 17) transitions.
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:07] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-19 13:46:08] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:08] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:09] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:09] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-19 13:46:10] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 817/829 places, 940/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 817/829 places, 940/957 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s691 1), p1:(EQ s366 0)], 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 1023 steps with 0 reset in 8 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-07 finished in 2699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G(p1)))))))'
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 820 transition count 948
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 820 transition count 948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 820 transition count 945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 817 transition count 942
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 817 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 817 transition count 940
Applied a total of 29 rules in 90 ms. Remains 817 /829 variables (removed 12) and now considering 940/957 (removed 17) transitions.
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:10] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:10] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:10] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:11] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:11] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:12] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 817/829 places, 940/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 817/829 places, 940/957 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s482 1), p1:(NEQ s387 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 100 reset in 299 ms.
Product exploration explored 100000 steps with 102 reset in 556 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:14] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:14] [INFO ] [Real]Absence check using 40 positive place invariants in 23 ms returned sat
[2022-05-19 13:46:14] [INFO ] After 447ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 13:46:14] [INFO ] After 520ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-19 13:46:14] [INFO ] After 757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 270 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=90 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 940/940 transitions.
Applied a total of 0 rules in 26 ms. Remains 817 /817 variables (removed 0) and now considering 940/940 (removed 0) transitions.
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:15] [INFO ] Computed 40 place invariants in 6 ms
[2022-05-19 13:46:16] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:16] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-19 13:46:16] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
// Phase 1: matrix 940 rows 817 cols
[2022-05-19 13:46:16] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-19 13:46:17] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 817/817 places, 940/940 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6958 steps, including 7 resets, run visited all 2 properties in 51 ms. (steps per millisecond=136 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 103 reset in 346 ms.
Product exploration explored 100000 steps with 101 reset in 269 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 817 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 817/817 places, 940/940 transitions.
Graph (trivial) has 754 edges and 817 vertex of which 529 / 817 are part of one of the 20 SCC in 1 ms
Free SCC test removed 509 places
Ensure Unique test removed 572 transitions
Reduce isomorphic transitions removed 572 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 308 transition count 368
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 5 place count 308 transition count 389
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 23 place count 308 transition count 389
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 35 place count 296 transition count 364
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 47 place count 296 transition count 364
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 285 transition count 340
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 285 transition count 340
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 129 place count 285 transition count 343
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 285 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 132 place count 285 transition count 346
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 283 transition count 342
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 283 transition count 342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 283 transition count 360
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 142 place count 283 transition count 355
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 281 transition count 347
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 281 transition count 347
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 146 rules in 149 ms. Remains 281 /817 variables (removed 536) and now considering 347/940 (removed 593) transitions.
[2022-05-19 13:46:20] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-19 13:46:20] [INFO ] Flow matrix only has 328 transitions (discarded 19 similar events)
// Phase 1: matrix 328 rows 281 cols
[2022-05-19 13:46:20] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-19 13:46:20] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/817 places, 347/940 transitions.
Finished structural reductions, in 1 iterations. Remains : 281/817 places, 347/940 transitions.
Stuttering criterion allowed to conclude after 144 steps with 2 reset in 2 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-09 finished in 10638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(F(p1)||X(p2)))))'
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 821 transition count 949
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 821 transition count 949
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 821 transition count 946
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 817 transition count 942
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 817 transition count 942
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 817 transition count 939
Applied a total of 30 rules in 156 ms. Remains 817 /829 variables (removed 12) and now considering 939/957 (removed 18) transitions.
// Phase 1: matrix 939 rows 817 cols
[2022-05-19 13:46:21] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:21] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 939 rows 817 cols
[2022-05-19 13:46:21] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:22] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
// Phase 1: matrix 939 rows 817 cols
[2022-05-19 13:46:22] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-19 13:46:23] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 817/829 places, 939/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 817/829 places, 939/957 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s678 0), p0:(EQ s678 1), p2:(EQ s684 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-10 finished in 2694 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(!(F(!p0)&&p1)) U p1)))'
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Graph (trivial) has 765 edges and 829 vertex of which 518 / 829 are part of one of the 19 SCC in 1 ms
Free SCC test removed 499 places
Ensure Unique test removed 565 transitions
Reduce isomorphic transitions removed 565 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 329 transition count 374
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 312 transition count 372
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 310 transition count 371
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 40 place count 310 transition count 352
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 78 place count 291 transition count 352
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 90 place count 279 transition count 329
Iterating global reduction 3 with 12 rules applied. Total rules applied 102 place count 279 transition count 329
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 102 place count 279 transition count 328
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 278 transition count 328
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 276 transition count 324
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 276 transition count 324
Performed 62 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 232 place count 214 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 214 transition count 260
Performed 2 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 237 place count 212 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 239 place count 212 transition count 268
Applied a total of 239 rules in 86 ms. Remains 212 /829 variables (removed 617) and now considering 268/957 (removed 689) transitions.
[2022-05-19 13:46:23] [INFO ] Flow matrix only has 250 transitions (discarded 18 similar events)
// Phase 1: matrix 250 rows 212 cols
[2022-05-19 13:46:23] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-19 13:46:23] [INFO ] Implicit Places using invariants in 173 ms returned [10, 38, 75, 121, 162, 192]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 176 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 206/829 places, 268/957 transitions.
Graph (trivial) has 138 edges and 206 vertex of which 24 / 206 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 243
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 193 transition count 242
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 2 with 2 rules applied. Total rules applied 6 place count 192 transition count 243
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 12 place count 192 transition count 237
Applied a total of 12 rules in 26 ms. Remains 192 /206 variables (removed 14) and now considering 237/268 (removed 31) transitions.
[2022-05-19 13:46:23] [INFO ] Flow matrix only has 219 transitions (discarded 18 similar events)
// Phase 1: matrix 219 rows 192 cols
[2022-05-19 13:46:23] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 13:46:24] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-19 13:46:24] [INFO ] Flow matrix only has 219 transitions (discarded 18 similar events)
// Phase 1: matrix 219 rows 192 cols
[2022-05-19 13:46:24] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 13:46:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:46:24] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 192/829 places, 237/957 transitions.
Finished structural reductions, in 2 iterations. Remains : 192/829 places, 237/957 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(NEQ s45 1), p1:(EQ s86 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-11 finished in 931 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F((X(F(G(X(p0))))||p1))))))'
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Graph (trivial) has 770 edges and 829 vertex of which 538 / 829 are part of one of the 20 SCC in 1 ms
Free SCC test removed 518 places
Ensure Unique test removed 585 transitions
Reduce isomorphic transitions removed 585 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 310 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 305 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 304 transition count 365
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 13 place count 304 transition count 348
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 47 place count 287 transition count 348
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 59 place count 275 transition count 325
Iterating global reduction 3 with 12 rules applied. Total rules applied 71 place count 275 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 275 transition count 324
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 274 transition count 324
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 272 transition count 320
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 272 transition count 320
Performed 60 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 197 place count 212 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 212 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 200 place count 211 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 211 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 210 transition count 264
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 141 edges and 204 vertex of which 26 / 204 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 209 place count 191 transition count 264
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 235 place count 191 transition count 238
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 7 with 2 rules applied. Total rules applied 237 place count 190 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 241 place count 190 transition count 233
Applied a total of 241 rules in 94 ms. Remains 190 /829 variables (removed 639) and now considering 233/957 (removed 724) transitions.
[2022-05-19 13:46:24] [INFO ] Flow matrix only has 214 transitions (discarded 19 similar events)
// Phase 1: matrix 214 rows 190 cols
[2022-05-19 13:46:24] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 13:46:24] [INFO ] Implicit Places using invariants in 181 ms returned []
[2022-05-19 13:46:24] [INFO ] Flow matrix only has 214 transitions (discarded 19 similar events)
// Phase 1: matrix 214 rows 190 cols
[2022-05-19 13:46:24] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 13:46:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 13:46:25] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2022-05-19 13:46:25] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-19 13:46:25] [INFO ] Flow matrix only has 214 transitions (discarded 19 similar events)
// Phase 1: matrix 214 rows 190 cols
[2022-05-19 13:46:25] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 13:46:25] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/829 places, 233/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/829 places, 233/957 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-12 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:(EQ s114 1), p1:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-12 finished in 952 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((p0 U p1)))))'
Support contains 5 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Graph (trivial) has 769 edges and 829 vertex of which 534 / 829 are part of one of the 20 SCC in 1 ms
Free SCC test removed 514 places
Ensure Unique test removed 583 transitions
Reduce isomorphic transitions removed 583 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 314 transition count 364
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 305 transition count 364
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 19 place count 305 transition count 347
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 53 place count 288 transition count 347
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 65 place count 276 transition count 324
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 276 transition count 324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 77 place count 276 transition count 323
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 275 transition count 323
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 273 transition count 319
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 273 transition count 319
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 201 place count 214 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 214 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 213 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 212 transition count 260
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 141 edges and 208 vertex of which 20 / 208 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 211 place count 198 transition count 260
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 231 place count 198 transition count 240
Applied a total of 231 rules in 104 ms. Remains 198 /829 variables (removed 631) and now considering 240/957 (removed 717) transitions.
[2022-05-19 13:46:25] [INFO ] Flow matrix only has 221 transitions (discarded 19 similar events)
// Phase 1: matrix 221 rows 198 cols
[2022-05-19 13:46:25] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-19 13:46:26] [INFO ] Implicit Places using invariants in 405 ms returned [10, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 407 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/829 places, 240/957 transitions.
Graph (trivial) has 126 edges and 196 vertex of which 6 / 196 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 192 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 192 transition count 231
Applied a total of 5 rules in 13 ms. Remains 192 /196 variables (removed 4) and now considering 231/240 (removed 9) transitions.
[2022-05-19 13:46:26] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
// Phase 1: matrix 212 rows 192 cols
[2022-05-19 13:46:26] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 13:46:26] [INFO ] Implicit Places using invariants in 198 ms returned []
[2022-05-19 13:46:26] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
// Phase 1: matrix 212 rows 192 cols
[2022-05-19 13:46:26] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 13:46:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:46:26] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 192/829 places, 231/957 transitions.
Finished structural reductions, in 2 iterations. Remains : 192/829 places, 231/957 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s11 1) (AND (EQ s69 1) (EQ s93 1))), p0:(AND (EQ s64 1) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-13 finished in 1146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0)||X(p1)))) U G(X(p2))))'
Support contains 3 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 820 transition count 948
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 820 transition count 948
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 820 transition count 946
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 816 transition count 942
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 816 transition count 942
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 816 transition count 939
Applied a total of 31 rules in 93 ms. Remains 816 /829 variables (removed 13) and now considering 939/957 (removed 18) transitions.
// Phase 1: matrix 939 rows 816 cols
[2022-05-19 13:46:26] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:27] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 939 rows 816 cols
[2022-05-19 13:46:27] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-19 13:46:28] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
// Phase 1: matrix 939 rows 816 cols
[2022-05-19 13:46:28] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:29] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 816/829 places, 939/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 816/829 places, 939/957 transitions.
Stuttering acceptance computed with spot in 410 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p2 p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=8 dest: 10}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=8 dest: 11}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={} source=10 dest: 6}, { cond=p2, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=11 dest: 9}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=11 dest: 10}, { cond=(AND p2 p0 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(EQ s226 1), p0:(EQ s579 1), p1:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-14 finished in 2940 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 957/957 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 819 transition count 947
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 819 transition count 947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 819 transition count 944
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 815 transition count 940
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 815 transition count 940
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 815 transition count 937
Applied a total of 34 rules in 116 ms. Remains 815 /829 variables (removed 14) and now considering 937/957 (removed 20) transitions.
// Phase 1: matrix 937 rows 815 cols
[2022-05-19 13:46:29] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-19 13:46:30] [INFO ] Implicit Places using invariants in 495 ms returned []
// Phase 1: matrix 937 rows 815 cols
[2022-05-19 13:46:30] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-19 13:46:31] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
// Phase 1: matrix 937 rows 815 cols
[2022-05-19 13:46:31] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-19 13:46:32] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 815/829 places, 937/957 transitions.
Finished structural reductions, in 1 iterations. Remains : 815/829 places, 937/957 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s359 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 1130 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-15 finished in 2697 ms.
All properties solved by simple procedures.
Total runtime 45562 ms.

BK_STOP 1652967992429

--------------------
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="NoC3x3-PT-1B"
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 NoC3x3-PT-1B, 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 r150-smll-165276998400124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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