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.r083-tall-162048875200277.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875200277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 61K May 5 16:51 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 DiscoveryGPU-PT-08b-00
FORMULA_NAME DiscoveryGPU-PT-08b-01
FORMULA_NAME DiscoveryGPU-PT-08b-02
FORMULA_NAME DiscoveryGPU-PT-08b-03
FORMULA_NAME DiscoveryGPU-PT-08b-04
FORMULA_NAME DiscoveryGPU-PT-08b-05
FORMULA_NAME DiscoveryGPU-PT-08b-06
FORMULA_NAME DiscoveryGPU-PT-08b-07
FORMULA_NAME DiscoveryGPU-PT-08b-08
FORMULA_NAME DiscoveryGPU-PT-08b-09
FORMULA_NAME DiscoveryGPU-PT-08b-10
FORMULA_NAME DiscoveryGPU-PT-08b-11
FORMULA_NAME DiscoveryGPU-PT-08b-12
FORMULA_NAME DiscoveryGPU-PT-08b-13
FORMULA_NAME DiscoveryGPU-PT-08b-14
FORMULA_NAME DiscoveryGPU-PT-08b-15

=== Now, execution of the tool begins

BK_START 1620574725203

Running Version 0
[2021-05-09 15:38:47] [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-05-09 15:38:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:38:47] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-09 15:38:47] [INFO ] Transformed 240 places.
[2021-05-09 15:38:47] [INFO ] Transformed 254 transitions.
[2021-05-09 15:38:47] [INFO ] Found NUPN structural information;
[2021-05-09 15:38:47] [INFO ] Parsed PT model containing 240 places and 254 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:38:47] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-08b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 240 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 224 transition count 254
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 49 place count 191 transition count 221
Iterating global reduction 1 with 33 rules applied. Total rules applied 82 place count 191 transition count 221
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 185 transition count 215
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 185 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 181 transition count 211
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 181 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 177 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 177 transition count 207
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 174 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 174 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 171 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 171 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 168 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 168 transition count 195
Applied a total of 128 rules in 72 ms. Remains 168 /240 variables (removed 72) and now considering 195/254 (removed 59) transitions.
// Phase 1: matrix 195 rows 168 cols
[2021-05-09 15:38:47] [INFO ] Computed 2 place invariants in 17 ms
[2021-05-09 15:38:47] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 195 rows 168 cols
[2021-05-09 15:38:47] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 15:38:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 168 cols
[2021-05-09 15:38:47] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:38:47] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 1 iterations. Remains : 168/240 places, 195/254 transitions.
[2021-05-09 15:38:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 15:38:47] [INFO ] Flatten gal took : 40 ms
FORMULA DiscoveryGPU-PT-08b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:38:47] [INFO ] Flatten gal took : 17 ms
[2021-05-09 15:38:48] [INFO ] Input system was already deterministic with 195 transitions.
Finished random walk after 50994 steps, including 190 resets, run visited all 27 properties in 199 ms. (steps per millisecond=256 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 167 transition count 166
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 139 transition count 166
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 56 place count 139 transition count 142
Deduced a syphon composed of 24 places in 8 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 115 transition count 142
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 110 transition count 137
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 110 transition count 137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 110 transition count 136
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 116 place count 109 transition count 136
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 106 transition count 133
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 106 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 104 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 104 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 102 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 102 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 100 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 100 transition count 125
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 216 place count 59 transition count 84
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 222 place count 53 transition count 73
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 53 transition count 73
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 47 transition count 65
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 47 transition count 65
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 41 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 41 transition count 54
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 258 place count 35 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 35 transition count 47
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 270 place count 29 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 29 transition count 36
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 23 transition count 29
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 23 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 290 place count 21 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 293 place count 20 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 20 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 295 place count 20 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 296 place count 19 transition count 23
Reduce places removed 2 places and 0 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 2 with 8 rules applied. Total rules applied 304 place count 17 transition count 17
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 310 place count 11 transition count 17
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 320 place count 6 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 321 place count 6 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 5 transition count 10
Applied a total of 322 rules in 75 ms. Remains 5 /168 variables (removed 163) and now considering 10/195 (removed 185) transitions.
[2021-05-09 15:38:48] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2021-05-09 15:38:48] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:38:48] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 15:38:48] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2021-05-09 15:38:48] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:38:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:38:48] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-09 15:38:48] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:38:48] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2021-05-09 15:38:48] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:38:48] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/168 places, 10/195 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s4 0), p0:(EQ s4 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 1 ms.
FORMULA DiscoveryGPU-PT-08b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-01 finished in 323 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 183
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 153 transition count 180
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 153 transition count 180
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 150 transition count 177
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 150 transition count 177
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 147 transition count 173
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 147 transition count 173
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 144 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 144 transition count 168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 141 transition count 165
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 141 transition count 165
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 139 transition count 163
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 139 transition count 163
Applied a total of 58 rules in 20 ms. Remains 139 /168 variables (removed 29) and now considering 163/195 (removed 32) transitions.
// Phase 1: matrix 163 rows 139 cols
[2021-05-09 15:38:48] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:38:48] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 163 rows 139 cols
[2021-05-09 15:38:48] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:38:48] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 139 cols
[2021-05-09 15:38:48] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 15:38:48] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 139/168 places, 163/195 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08b-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s116 1), p1:(EQ s18 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][false, false, false]]
Stuttering criterion allowed to conclude after 189 steps with 0 reset in 7 ms.
FORMULA DiscoveryGPU-PT-08b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-02 finished in 314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(X(p0))&&G((p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 152 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 152 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 148 transition count 174
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 148 transition count 174
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 144 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 144 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 141 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 141 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 136 transition count 159
Applied a total of 64 rules in 16 ms. Remains 136 /168 variables (removed 32) and now considering 159/195 (removed 36) transitions.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:38:48] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:38:48] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:38:48] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:38:49] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:38:49] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:38:49] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/168 places, 159/195 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR p2 p1), acceptance={0} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=(OR p2 p1), acceptance={0} source=2 dest: 5}, { cond=(OR p2 p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=7 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=8 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=8 dest: 4}]], initial=0, aps=[p2:(AND (EQ s41 1) (EQ s132 1)), p1:(EQ s2 1), p0:(OR (AND (EQ s41 1) (EQ s132 1)) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 280 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-08b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-03 finished in 496 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((F(p0) U p1))||((p1 U G(p0))&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 157 transition count 184
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 157 transition count 184
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 153 transition count 179
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 153 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 149 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 149 transition count 175
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 146 transition count 172
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 146 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 144 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 144 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 140 transition count 164
Applied a total of 56 rules in 14 ms. Remains 140 /168 variables (removed 28) and now considering 164/195 (removed 31) transitions.
// Phase 1: matrix 164 rows 140 cols
[2021-05-09 15:38:49] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:38:49] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 164 rows 140 cols
[2021-05-09 15:38:49] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 15:38:49] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 140 cols
[2021-05-09 15:38:49] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:38:49] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/168 places, 164/195 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08b-04 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s60 1), p1:(EQ s46 1), p2:(EQ s135 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 271 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-04 finished in 359 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 152 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 152 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 148 transition count 174
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 148 transition count 174
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 144 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 144 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 141 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 141 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 136 transition count 159
Applied a total of 64 rules in 13 ms. Remains 136 /168 variables (removed 32) and now considering 159/195 (removed 36) transitions.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:38:49] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:38:49] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:38:49] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:38:49] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:38:49] [INFO ] Computed 2 place invariants in 16 ms
[2021-05-09 15:38:49] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/168 places, 159/195 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s42 0)], 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 116 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-05 finished in 276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 152 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 152 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 148 transition count 174
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 148 transition count 174
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 144 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 144 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 141 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 141 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 136 transition count 159
Applied a total of 64 rules in 11 ms. Remains 136 /168 variables (removed 32) and now considering 159/195 (removed 36) transitions.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:38:50] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:38:50] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:38:50] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:38:50] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:38:50] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:38:50] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/168 places, 159/195 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s57 1) (AND (EQ s57 0) (EQ s131 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Product exploration explored 100000 steps with 25000 reset in 165 ms.
Graph (complete) has 273 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 136 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 136/136 places, 159/159 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 136 transition count 159
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 17 place count 136 transition count 169
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 43 place count 136 transition count 169
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 62 place count 136 transition count 177
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 134 transition count 175
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 134 transition count 175
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 134 transition count 211
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 127 transition count 197
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 127 transition count 197
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 118 place count 106 transition count 162
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 139 place count 106 transition count 162
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 160 place count 85 transition count 127
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 181 place count 85 transition count 127
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 188 place count 78 transition count 113
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 195 place count 78 transition count 113
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 209 place count 64 transition count 92
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 223 place count 64 transition count 92
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 250 place count 37 transition count 51
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 277 place count 37 transition count 51
Deduced a syphon composed of 22 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 281 place count 37 transition count 47
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 281 rules in 33 ms. Remains 37 /136 variables (removed 99) and now considering 47/159 (removed 112) transitions.
[2021-05-09 15:38:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:38:51] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
// Phase 1: matrix 46 rows 37 cols
[2021-05-09 15:38:51] [INFO ] Computed 2 place invariants in 9 ms
[2021-05-09 15:38:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/136 places, 47/159 transitions.
Product exploration explored 100000 steps with 25000 reset in 253 ms.
Product exploration explored 100000 steps with 25000 reset in 266 ms.
[2021-05-09 15:38:52] [INFO ] Flatten gal took : 13 ms
[2021-05-09 15:38:52] [INFO ] Flatten gal took : 8 ms
[2021-05-09 15:38:52] [INFO ] Time to serialize gal into /tmp/LTL16913868606852149694.gal : 4 ms
[2021-05-09 15:38:52] [INFO ] Time to serialize properties into /tmp/LTL13583057397293752669.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16913868606852149694.gal, -t, CGAL, -LTL, /tmp/LTL13583057397293752669.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16913868606852149694.gal -t CGAL -LTL /tmp/LTL13583057397293752669.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((p89!=1)||((p89==0)&&(p228==1)))"))))))
Formula 0 simplified : !XXXF"((p89!=1)||((p89==0)&&(p228==1)))"
Detected timeout of ITS tools.
[2021-05-09 15:39:07] [INFO ] Flatten gal took : 13 ms
[2021-05-09 15:39:07] [INFO ] Applying decomposition
[2021-05-09 15:39:07] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1473626351914149695.txt, -o, /tmp/graph1473626351914149695.bin, -w, /tmp/graph1473626351914149695.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1473626351914149695.bin, -l, -1, -v, -w, /tmp/graph1473626351914149695.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:39:07] [INFO ] Decomposing Gal with order
[2021-05-09 15:39:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:39:07] [INFO ] Removed a total of 61 redundant transitions.
[2021-05-09 15:39:07] [INFO ] Flatten gal took : 34 ms
[2021-05-09 15:39:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2021-05-09 15:39:07] [INFO ] Time to serialize gal into /tmp/LTL6056585593807037237.gal : 3 ms
[2021-05-09 15:39:07] [INFO ] Time to serialize properties into /tmp/LTL17294355739913476267.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6056585593807037237.gal, -t, CGAL, -LTL, /tmp/LTL17294355739913476267.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6056585593807037237.gal -t CGAL -LTL /tmp/LTL17294355739913476267.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i0.i0.u20.p89!=1)||((i0.i0.u20.p89==0)&&(u46.p228==1)))"))))))
Formula 0 simplified : !XXXF"((i0.i0.u20.p89!=1)||((i0.i0.u20.p89==0)&&(u46.p228==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12056226972464422246
[2021-05-09 15:39:22] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12056226972464422246
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12056226972464422246]
Compilation finished in 660 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12056226972464422246]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12056226972464422246]
LTSmin run took 160 ms.
FORMULA DiscoveryGPU-PT-08b-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-08b-06 finished in 33110 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 167 transition count 167
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 140 transition count 167
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 54 place count 140 transition count 143
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 102 place count 116 transition count 143
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 111 transition count 138
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 111 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 109 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 109 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 108 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 108 transition count 135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 107 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 106 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 106 transition count 132
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 208 place count 63 transition count 89
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 214 place count 57 transition count 78
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 57 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 226 place count 51 transition count 70
Iterating global reduction 2 with 6 rules applied. Total rules applied 232 place count 51 transition count 70
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 238 place count 45 transition count 59
Iterating global reduction 2 with 6 rules applied. Total rules applied 244 place count 45 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 250 place count 39 transition count 52
Iterating global reduction 2 with 6 rules applied. Total rules applied 256 place count 39 transition count 52
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 262 place count 33 transition count 41
Iterating global reduction 2 with 6 rules applied. Total rules applied 268 place count 33 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 274 place count 27 transition count 34
Iterating global reduction 2 with 6 rules applied. Total rules applied 280 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 282 place count 25 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 284 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 285 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 286 place count 24 transition count 30
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 288 place count 24 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 289 place count 23 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 292 place count 22 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 294 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 294 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 302 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 303 place count 15 transition count 20
Applied a total of 303 rules in 29 ms. Remains 15 /168 variables (removed 153) and now considering 20/195 (removed 175) transitions.
[2021-05-09 15:39:23] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 15:39:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:39:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-09 15:39:23] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 15:39:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:39:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:39:23] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-09 15:39:23] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 15:39:23] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 15:39:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:39:23] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/168 places, 20/195 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-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:(AND (EQ s8 1) (EQ s14 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 75 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-07 finished in 144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&((!p1&&G(!p2)) U ((G(!p2)&&p3)||G(p4)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 167 transition count 169
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 142 transition count 169
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 142 transition count 145
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 118 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 113 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 113 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 110 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 110 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 108 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 108 transition count 135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 107 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 106 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 106 transition count 132
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 202 place count 66 transition count 92
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 60 transition count 81
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 60 transition count 81
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 220 place count 54 transition count 73
Iterating global reduction 2 with 6 rules applied. Total rules applied 226 place count 54 transition count 73
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 232 place count 48 transition count 62
Iterating global reduction 2 with 6 rules applied. Total rules applied 238 place count 48 transition count 62
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 244 place count 42 transition count 55
Iterating global reduction 2 with 6 rules applied. Total rules applied 250 place count 42 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 254 place count 38 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 258 place count 38 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 262 place count 34 transition count 43
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 34 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 268 place count 32 transition count 40
Iterating global reduction 2 with 2 rules applied. Total rules applied 270 place count 32 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 271 place count 31 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 272 place count 31 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 273 place count 31 transition count 38
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 276 place count 31 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 277 place count 30 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 29 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 278 place count 29 transition count 36
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 280 place count 28 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 286 place count 25 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 24 transition count 32
Applied a total of 287 rules in 27 ms. Remains 24 /168 variables (removed 144) and now considering 32/195 (removed 163) transitions.
[2021-05-09 15:39:23] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 24 cols
[2021-05-09 15:39:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:39:23] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-09 15:39:23] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 24 cols
[2021-05-09 15:39:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:39:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:39:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-09 15:39:23] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:39:23] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 24 cols
[2021-05-09 15:39:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:39:23] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/168 places, 32/195 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), true, (NOT p1), p2, (NOT p4), (AND p2 (NOT p4)), (OR (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4)))]
Running random walk in product with property : DiscoveryGPU-PT-08b-08 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p4))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 p4)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p0 (NOT p2) (NOT p4)) (AND p1 p3 (NOT p2) (NOT p4))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3) p4) (AND p1 p2 p4) (AND p0 p2 p4)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 p3 (NOT p2) p4) (AND p0 p3 (NOT p2) p4)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={} source=4 dest: 1}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p4)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p4), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p4), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p4))), acceptance={} source=6 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND p3 (NOT p2) (NOT p4))), acceptance={} source=6 dest: 3}, { cond=(OR (AND p1 (NOT p3) p4) (AND p2 p4)), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p2) p4), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p4)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p4), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s20 1) (EQ s23 1)), p0:(OR (EQ s12 1) (EQ s17 0)), p3:(AND (NEQ s5 1) (OR (NEQ s20 1) (NEQ s23 1))), p4:(AND (NOT (EQ s17 1)) (NOT (AND (EQ s20 1) (EQ s23 1)))), p2:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-08 finished in 276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 167 transition count 167
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 140 transition count 167
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 54 place count 140 transition count 144
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 100 place count 117 transition count 144
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 112 transition count 139
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 112 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 110 place count 112 transition count 138
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 112 place count 111 transition count 138
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 108 transition count 135
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 108 transition count 135
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 106 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 106 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 104 transition count 129
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 104 transition count 129
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 102 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 102 transition count 127
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 214 place count 60 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 221 place count 53 transition count 72
Iterating global reduction 2 with 7 rules applied. Total rules applied 228 place count 53 transition count 72
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 235 place count 46 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 242 place count 46 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 249 place count 39 transition count 50
Iterating global reduction 2 with 7 rules applied. Total rules applied 256 place count 39 transition count 50
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 262 place count 33 transition count 43
Iterating global reduction 2 with 6 rules applied. Total rules applied 268 place count 33 transition count 43
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 274 place count 27 transition count 32
Iterating global reduction 2 with 6 rules applied. Total rules applied 280 place count 27 transition count 32
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 286 place count 21 transition count 25
Iterating global reduction 2 with 6 rules applied. Total rules applied 292 place count 21 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 294 place count 19 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 19 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 297 place count 18 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 18 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 299 place count 17 transition count 20
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 301 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 15 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 308 place count 12 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 310 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 10 transition count 15
Applied a total of 311 rules in 21 ms. Remains 10 /168 variables (removed 158) and now considering 15/195 (removed 180) transitions.
[2021-05-09 15:39:23] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 15:39:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:39:23] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-09 15:39:23] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 15:39:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:39:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:39:23] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-09 15:39:23] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:39:23] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 15:39:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:39:23] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/168 places, 15/195 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-09 finished in 90 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U ((p1||X(p2)) U G(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 183
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 153 transition count 179
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 153 transition count 179
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 150 transition count 176
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 150 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 147 transition count 172
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 147 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 145 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 145 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 143 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 143 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 142 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 142 transition count 166
Applied a total of 52 rules in 18 ms. Remains 142 /168 variables (removed 26) and now considering 166/195 (removed 29) transitions.
// Phase 1: matrix 166 rows 142 cols
[2021-05-09 15:39:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:39:23] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 166 rows 142 cols
[2021-05-09 15:39:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:39:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 142 cols
[2021-05-09 15:39:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:39:23] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 142/168 places, 166/195 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p3) (NOT p2)), true, (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-08b-10 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p3 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s21 1), p0:(AND (EQ s87 1) (EQ s141 1)), p1:(EQ s47 1), p2:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-10 finished in 348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 152 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 152 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 148 transition count 174
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 148 transition count 174
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 144 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 144 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 141 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 141 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 136 transition count 159
Applied a total of 64 rules in 14 ms. Remains 136 /168 variables (removed 32) and now considering 159/195 (removed 36) transitions.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:39:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:39:24] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:39:24] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 15:39:24] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:39:24] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:39:24] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/168 places, 159/195 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s44 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 73 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-11 finished in 249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 157 transition count 184
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 157 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 154 transition count 180
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 154 transition count 180
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 151 transition count 177
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 151 transition count 177
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 148 transition count 173
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 148 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 146 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 146 transition count 170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 144 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 144 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 143 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 143 transition count 167
Applied a total of 50 rules in 14 ms. Remains 143 /168 variables (removed 25) and now considering 167/195 (removed 28) transitions.
// Phase 1: matrix 167 rows 143 cols
[2021-05-09 15:39:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:39:24] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 167 rows 143 cols
[2021-05-09 15:39:24] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 15:39:24] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 143 cols
[2021-05-09 15:39:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:39:24] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 143/168 places, 167/195 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s76 1) (EQ s59 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 321 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-12 finished in 301 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 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 167 transition count 167
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 140 transition count 167
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 54 place count 140 transition count 143
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 102 place count 116 transition count 143
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 110 transition count 137
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 110 transition count 137
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 107 transition count 134
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 107 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 105 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 105 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 103 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 103 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 101 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 101 transition count 126
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 214 place count 60 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 221 place count 53 transition count 72
Iterating global reduction 2 with 7 rules applied. Total rules applied 228 place count 53 transition count 72
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 235 place count 46 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 242 place count 46 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 249 place count 39 transition count 50
Iterating global reduction 2 with 7 rules applied. Total rules applied 256 place count 39 transition count 50
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 263 place count 32 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 270 place count 32 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 276 place count 26 transition count 31
Iterating global reduction 2 with 6 rules applied. Total rules applied 282 place count 26 transition count 31
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 288 place count 20 transition count 24
Iterating global reduction 2 with 6 rules applied. Total rules applied 294 place count 20 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 296 place count 18 transition count 21
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 18 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 299 place count 17 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 300 place count 17 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 301 place count 17 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 302 place count 16 transition count 18
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 304 place count 15 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 305 place count 14 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 305 place count 14 transition count 15
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 309 place count 12 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 310 place count 11 transition count 14
Applied a total of 310 rules in 21 ms. Remains 11 /168 variables (removed 157) and now considering 14/195 (removed 181) transitions.
[2021-05-09 15:39:24] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2021-05-09 15:39:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:39:24] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 15:39:24] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2021-05-09 15:39:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:39:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:39:24] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-09 15:39:24] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:39:24] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2021-05-09 15:39:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:39:24] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/168 places, 14/195 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-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 (OR (EQ s8 0) (EQ s10 0)) (OR (NEQ s8 1) (NEQ s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1035 reset in 183 ms.
Stack based approach found an accepted trace after 210 steps with 2 reset with depth 5 and stack size 5 in 1 ms.
FORMULA DiscoveryGPU-PT-08b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-14 finished in 284 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(((p1&&X(X(X(F(p2)))))||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 168 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 168/168 places, 195/195 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 152 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 152 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 148 transition count 174
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 148 transition count 174
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 144 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 144 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 141 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 141 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 136 transition count 159
Applied a total of 64 rules in 14 ms. Remains 136 /168 variables (removed 32) and now considering 159/195 (removed 36) transitions.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:39:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:39:24] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:39:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:39:24] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 136 cols
[2021-05-09 15:39:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:39:24] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/168 places, 159/195 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s28 1), p2:(OR (NEQ s34 1) (NEQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 948 reset in 162 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA DiscoveryGPU-PT-08b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-15 finished in 419 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620574765969

--------------------
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="DiscoveryGPU-PT-08b"
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 DiscoveryGPU-PT-08b, 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 r083-tall-162048875200277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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