Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990200594.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 BART-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990200594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 8 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 534K Mar 20 13:27 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 BART-PT-002-00
FORMULA_NAME BART-PT-002-01
FORMULA_NAME BART-PT-002-02
FORMULA_NAME BART-PT-002-03
FORMULA_NAME BART-PT-002-04
FORMULA_NAME BART-PT-002-05
FORMULA_NAME BART-PT-002-06
FORMULA_NAME BART-PT-002-07
FORMULA_NAME BART-PT-002-08
FORMULA_NAME BART-PT-002-09
FORMULA_NAME BART-PT-002-10
FORMULA_NAME BART-PT-002-11
FORMULA_NAME BART-PT-002-12
FORMULA_NAME BART-PT-002-13
FORMULA_NAME BART-PT-002-14
FORMULA_NAME BART-PT-002-15

=== Now, execution of the tool begins

BK_START 1623177286409

Running Version 0
[2021-06-08 18:34:48] [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]
[2021-06-08 18:34:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:34:48] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2021-06-08 18:34:48] [INFO ] Transformed 474 places.
[2021-06-08 18:34:48] [INFO ] Transformed 404 transitions.
[2021-06-08 18:34:48] [INFO ] Found NUPN structural information;
[2021-06-08 18:34:48] [INFO ] Parsed PT model containing 474 places and 404 transitions in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:34:48] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 210 places and 0 transitions.
Support contains 37 out of 264 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 211 transition count 351
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 211 transition count 351
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 143 place count 174 transition count 314
Iterating global reduction 0 with 37 rules applied. Total rules applied 180 place count 174 transition count 314
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 183 place count 171 transition count 311
Iterating global reduction 0 with 3 rules applied. Total rules applied 186 place count 171 transition count 311
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 189 place count 168 transition count 308
Iterating global reduction 0 with 3 rules applied. Total rules applied 192 place count 168 transition count 308
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 195 place count 165 transition count 305
Iterating global reduction 0 with 3 rules applied. Total rules applied 198 place count 165 transition count 305
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 201 place count 162 transition count 302
Iterating global reduction 0 with 3 rules applied. Total rules applied 204 place count 162 transition count 302
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 206 place count 160 transition count 300
Iterating global reduction 0 with 2 rules applied. Total rules applied 208 place count 160 transition count 300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 210 place count 158 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 212 place count 158 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 214 place count 156 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 216 place count 156 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 217 place count 155 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 155 transition count 295
Applied a total of 218 rules in 78 ms. Remains 155 /264 variables (removed 109) and now considering 295/404 (removed 109) transitions.
// Phase 1: matrix 295 rows 155 cols
[2021-06-08 18:34:48] [INFO ] Computed 2 place invariants in 20 ms
[2021-06-08 18:34:48] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 295 rows 155 cols
[2021-06-08 18:34:48] [INFO ] Computed 2 place invariants in 18 ms
[2021-06-08 18:34:48] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 155 cols
[2021-06-08 18:34:48] [INFO ] Computed 2 place invariants in 8 ms
[2021-06-08 18:34:49] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/264 places, 295/404 transitions.
[2021-06-08 18:34:49] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-06-08 18:34:49] [INFO ] Flatten gal took : 58 ms
FORMULA BART-PT-002-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 18:34:49] [INFO ] Flatten gal took : 17 ms
[2021-06-08 18:34:49] [INFO ] Input system was already deterministic with 295 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=526 ) properties (out of 29) seen :28
Running SMT prover for 1 properties.
// Phase 1: matrix 295 rows 155 cols
[2021-06-08 18:34:49] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&(p1||X(X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 136 transition count 276
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 136 transition count 276
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 125 transition count 265
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 125 transition count 265
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 119 transition count 259
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 119 transition count 259
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 115 transition count 255
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 115 transition count 255
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 111 transition count 251
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 111 transition count 251
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 108 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 108 transition count 248
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 105 transition count 245
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 105 transition count 245
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 102 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 102 transition count 242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 99 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 99 transition count 239
Applied a total of 112 rules in 18 ms. Remains 99 /155 variables (removed 56) and now considering 239/295 (removed 56) transitions.
// Phase 1: matrix 239 rows 99 cols
[2021-06-08 18:34:49] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:49] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 239 rows 99 cols
[2021-06-08 18:34:49] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:49] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 239 rows 99 cols
[2021-06-08 18:34:49] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:49] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/155 places, 239/295 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : BART-PT-002-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s39 1), p0:(NEQ s35 1), p2:(EQ s39 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 77 steps with 0 reset in 5 ms.
FORMULA BART-PT-002-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-00 finished in 646 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F((p0||G(p1))))||(F((p0||G(p1)))&&X(X(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 136 transition count 276
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 136 transition count 276
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 125 transition count 265
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 125 transition count 265
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 119 transition count 259
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 119 transition count 259
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 115 transition count 255
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 115 transition count 255
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 111 transition count 251
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 111 transition count 251
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 108 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 108 transition count 248
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 105 transition count 245
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 105 transition count 245
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 102 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 102 transition count 242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 99 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 99 transition count 239
Applied a total of 112 rules in 16 ms. Remains 99 /155 variables (removed 56) and now considering 239/295 (removed 56) transitions.
// Phase 1: matrix 239 rows 99 cols
[2021-06-08 18:34:50] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:50] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 239 rows 99 cols
[2021-06-08 18:34:50] [INFO ] Computed 2 place invariants in 6 ms
[2021-06-08 18:34:50] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 239 rows 99 cols
[2021-06-08 18:34:50] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:50] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/155 places, 239/295 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-002-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(NEQ s46 0), p1:(NEQ s43 1), p2:(EQ s46 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 109 reset in 216 ms.
Stack based approach found an accepted trace after 1018 steps with 0 reset with depth 1019 and stack size 391 in 3 ms.
FORMULA BART-PT-002-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-01 finished in 637 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Graph (trivial) has 253 edges and 155 vertex of which 82 / 155 are part of one of the 1 SCC in 5 ms
Free SCC test removed 81 places
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 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 74 transition count 129
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 58 transition count 129
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 33 place count 58 transition count 127
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 56 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 53 transition count 124
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 53 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 53 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 50 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 49 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 49 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 48 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 48 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 47 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 47 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 46 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 46 transition count 116
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 76 place count 37 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 80 place count 37 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 35 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 88 place count 35 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 92 place count 33 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 96 place count 33 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 100 place count 31 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 104 place count 31 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 108 place count 29 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 112 place count 29 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 116 place count 27 transition count 77
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 120 place count 27 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 124 place count 25 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 128 place count 25 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 132 place count 23 transition count 65
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 136 place count 23 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 140 place count 21 transition count 59
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 144 place count 21 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 148 place count 19 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 152 place count 19 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 156 place count 17 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 160 place count 17 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 164 place count 15 transition count 41
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 168 place count 15 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 172 place count 13 transition count 35
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 176 place count 13 transition count 31
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 16 with 2 rules applied. Total rules applied 178 place count 12 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 180 place count 12 transition count 28
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 17 with 2 rules applied. Total rules applied 182 place count 11 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 184 place count 11 transition count 25
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 18 with 2 rules applied. Total rules applied 186 place count 10 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 188 place count 10 transition count 22
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 19 with 2 rules applied. Total rules applied 190 place count 9 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 192 place count 9 transition count 19
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 20 with 2 rules applied. Total rules applied 194 place count 8 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 196 place count 8 transition count 16
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 21 with 2 rules applied. Total rules applied 198 place count 7 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 200 place count 7 transition count 13
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 22 with 2 rules applied. Total rules applied 202 place count 6 transition count 12
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 204 place count 6 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 205 place count 6 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 206 place count 6 transition count 9
Applied a total of 206 rules in 42 ms. Remains 6 /155 variables (removed 149) and now considering 9/295 (removed 286) transitions.
// Phase 1: matrix 9 rows 6 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-06-08 18:34:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/155 places, 9/295 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BART-PT-002-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s2 0), p1:(NEQ s3 1), p2:(NEQ s0 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 BART-PT-002-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-03 finished in 165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X((p1 U (p2||G(p1))))&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 137 transition count 277
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 137 transition count 277
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 127 transition count 267
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 127 transition count 267
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 121 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 121 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 117 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 117 transition count 257
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 113 transition count 253
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 113 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 110 transition count 250
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 110 transition count 250
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 107 transition count 247
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 107 transition count 247
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 104 transition count 244
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 104 transition count 244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 101 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 101 transition count 241
Applied a total of 108 rules in 14 ms. Remains 101 /155 variables (removed 54) and now considering 241/295 (removed 54) transitions.
// Phase 1: matrix 241 rows 101 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 241 rows 101 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 101 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/155 places, 241/295 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : BART-PT-002-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s48 1) (EQ s8 0)), p2:(AND (NEQ s8 1) (OR (NEQ s60 1) (NEQ s26 1))), p1:(OR (NEQ s60 1) (NEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-05 finished in 256 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0 U !p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 275
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 275
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 124 transition count 264
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 124 transition count 264
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 118 transition count 258
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 118 transition count 258
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 114 transition count 254
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 114 transition count 254
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 111 transition count 251
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 111 transition count 251
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 108 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 108 transition count 248
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 105 transition count 245
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 105 transition count 245
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 102 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 102 transition count 242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 99 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 99 transition count 239
Applied a total of 112 rules in 14 ms. Remains 99 /155 variables (removed 56) and now considering 239/295 (removed 56) transitions.
// Phase 1: matrix 239 rows 99 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 239 rows 99 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 13 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 239 rows 99 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/155 places, 239/295 transitions.
Stuttering acceptance computed with spot in 130 ms :[p1, p1, p1, p1, true]
Running random walk in product with property : BART-PT-002-06 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s0 1), p0:(NEQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1141 steps with 51 reset in 6 ms.
FORMULA BART-PT-002-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-06 finished in 327 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Graph (trivial) has 258 edges and 155 vertex of which 83 / 155 are part of one of the 1 SCC in 1 ms
Free SCC test removed 82 places
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Reduce places removed 1 places and 0 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 72 transition count 127
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 56 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 33 place count 56 transition count 125
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 54 transition count 125
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 51 transition count 122
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 51 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 48 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 47 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 47 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 46 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 46 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 45 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 45 transition count 115
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 44 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 44 transition count 114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 76 place count 35 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 80 place count 35 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 33 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 88 place count 33 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 92 place count 31 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 96 place count 31 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 100 place count 29 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 104 place count 29 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 108 place count 27 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 112 place count 27 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 116 place count 25 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 120 place count 25 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 124 place count 23 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 128 place count 23 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 132 place count 21 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 136 place count 21 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 140 place count 19 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 144 place count 19 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 148 place count 17 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 152 place count 17 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 156 place count 15 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 160 place count 15 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 164 place count 13 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 168 place count 13 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 172 place count 11 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 176 place count 11 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 180 place count 9 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 184 place count 9 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 188 place count 7 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 192 place count 7 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 196 place count 5 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 200 place count 5 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 204 place count 3 transition count 9
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 209 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 211 place count 2 transition count 3
Applied a total of 211 rules in 25 ms. Remains 2 /155 variables (removed 153) and now considering 3/295 (removed 292) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:34:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:34:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-06-08 18:34:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:34:51] [INFO ] Computed 1 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/155 places, 3/295 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-07 automaton TGBA [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 s0 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 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-07 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F((p0&&F(p1))))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 137 transition count 277
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 137 transition count 277
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 127 transition count 267
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 127 transition count 267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 122 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 122 transition count 262
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 119 transition count 259
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 119 transition count 259
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 116 transition count 256
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 116 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 113 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 113 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 110 transition count 250
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 110 transition count 250
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 107 transition count 247
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 107 transition count 247
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 104 transition count 244
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 104 transition count 244
Applied a total of 102 rules in 14 ms. Remains 104 /155 variables (removed 51) and now considering 244/295 (removed 51) transitions.
// Phase 1: matrix 244 rows 104 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 244 rows 104 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 244 rows 104 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:52] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/155 places, 244/295 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-002-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s89 1), p0:(OR (EQ s56 1) (EQ s68 1)), p2:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 170 reset in 119 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 0 ms.
FORMULA BART-PT-002-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-08 finished in 470 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(X(p0))&&F(p1)) U G(!p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 275
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 275
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 124 transition count 264
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 124 transition count 264
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 118 transition count 258
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 118 transition count 258
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 114 transition count 254
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 114 transition count 254
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 110 transition count 250
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 110 transition count 250
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 107 transition count 247
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 107 transition count 247
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 104 transition count 244
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 104 transition count 244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 101 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 101 transition count 241
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 98 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 98 transition count 238
Applied a total of 114 rules in 11 ms. Remains 98 /155 variables (removed 57) and now considering 238/295 (removed 57) transitions.
// Phase 1: matrix 238 rows 98 cols
[2021-06-08 18:34:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:52] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 238 rows 98 cols
[2021-06-08 18:34:52] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:52] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 98 cols
[2021-06-08 18:34:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:52] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/155 places, 238/295 transitions.
Stuttering acceptance computed with spot in 230 ms :[p2, (NOT p0), (NOT p1), (AND (NOT p0) p2), (NOT p0), true, (AND p2 (NOT p0)), (AND p2 p0)]
Running random walk in product with property : BART-PT-002-10 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(NEQ s0 1), p1:(OR (NEQ s45 1) (NEQ s48 1)), p0:(NEQ s75 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-10 finished in 445 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 136 transition count 276
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 136 transition count 276
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 126 transition count 266
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 120 transition count 260
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 116 transition count 256
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 116 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 112 transition count 252
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 112 transition count 252
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 109 transition count 249
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 109 transition count 249
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 106 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 106 transition count 246
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 103 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 103 transition count 243
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 100 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 100 transition count 240
Applied a total of 110 rules in 13 ms. Remains 100 /155 variables (removed 55) and now considering 240/295 (removed 55) transitions.
// Phase 1: matrix 240 rows 100 cols
[2021-06-08 18:34:52] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:52] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 240 rows 100 cols
[2021-06-08 18:34:52] [INFO ] Computed 2 place invariants in 3 ms
[2021-06-08 18:34:52] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 240 rows 100 cols
[2021-06-08 18:34:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:52] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/155 places, 240/295 transitions.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BART-PT-002-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s87 1), p1:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 266 reset in 97 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 0 ms.
FORMULA BART-PT-002-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-12 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&(p1||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 138 transition count 278
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 138 transition count 278
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 128 transition count 268
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 128 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 122 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 122 transition count 262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 118 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 118 transition count 258
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 114 transition count 254
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 114 transition count 254
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 111 transition count 251
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 111 transition count 251
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 108 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 108 transition count 248
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 105 transition count 245
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 105 transition count 245
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 102 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 102 transition count 242
Applied a total of 106 rules in 9 ms. Remains 102 /155 variables (removed 53) and now considering 242/295 (removed 53) transitions.
// Phase 1: matrix 242 rows 102 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:53] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 242 rows 102 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 5 ms
[2021-06-08 18:34:53] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 102 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 3 ms
[2021-06-08 18:34:53] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/155 places, 242/295 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : BART-PT-002-13 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s80 1), p1:(EQ s52 1), p2:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-13 finished in 383 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Graph (trivial) has 291 edges and 155 vertex of which 151 / 155 are part of one of the 2 SCC in 1 ms
Free SCC test removed 149 places
Ensure Unique test removed 287 transitions
Reduce isomorphic transitions removed 287 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 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 7
Applied a total of 3 rules in 4 ms. Remains 5 /155 variables (removed 150) and now considering 7/295 (removed 288) transitions.
[2021-06-08 18:34:53] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:34:53] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-06-08 18:34:53] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:34:53] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-06-08 18:34:53] [INFO ] Redundant transitions in 0 ms returned []
[2021-06-08 18:34:53] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:34:53] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/155 places, 7/295 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-14 finished in 87 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U (F(p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 136 transition count 276
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 136 transition count 276
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 126 transition count 266
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 126 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 121 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 121 transition count 261
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 118 transition count 258
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 118 transition count 258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 115 transition count 255
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 115 transition count 255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 113 transition count 253
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 113 transition count 253
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 111 transition count 251
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 111 transition count 251
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 109 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 109 transition count 249
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 107 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 107 transition count 247
Applied a total of 96 rules in 15 ms. Remains 107 /155 variables (removed 48) and now considering 247/295 (removed 48) transitions.
// Phase 1: matrix 247 rows 107 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:53] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 247 rows 107 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:53] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 247 rows 107 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 3 ms
[2021-06-08 18:34:53] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 107/155 places, 247/295 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-002-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s1 1), p1:(EQ s30 1), p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 235 reset in 102 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA BART-PT-002-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-15 finished in 471 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177295522

--------------------
content from stderr:

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BART-PT-002"
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 BART-PT-002, 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 r007-tall-162037990200594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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