Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109800092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-11b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 8.7K Apr 30 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 30 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 82K May 10 09:33 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-11b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652632530068

Running Version 202205111006
[2022-05-15 16:35:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:35:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:35:31] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2022-05-15 16:35:31] [INFO ] Transformed 324 places.
[2022-05-15 16:35:31] [INFO ] Transformed 344 transitions.
[2022-05-15 16:35:31] [INFO ] Found NUPN structural information;
[2022-05-15 16:35:31] [INFO ] Parsed PT model containing 324 places and 344 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 302 transition count 344
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 68 place count 256 transition count 298
Iterating global reduction 1 with 46 rules applied. Total rules applied 114 place count 256 transition count 298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 122 place count 248 transition count 290
Iterating global reduction 1 with 8 rules applied. Total rules applied 130 place count 248 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 135 place count 243 transition count 285
Iterating global reduction 1 with 5 rules applied. Total rules applied 140 place count 243 transition count 285
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 144 place count 239 transition count 281
Iterating global reduction 1 with 4 rules applied. Total rules applied 148 place count 239 transition count 281
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 237 transition count 277
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 237 transition count 277
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 235 transition count 275
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 235 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 233 transition count 273
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 233 transition count 273
Applied a total of 160 rules in 84 ms. Remains 233 /324 variables (removed 91) and now considering 273/344 (removed 71) transitions.
// Phase 1: matrix 273 rows 233 cols
[2022-05-15 16:35:31] [INFO ] Computed 2 place invariants in 20 ms
[2022-05-15 16:35:31] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 273 rows 233 cols
[2022-05-15 16:35:31] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:35:32] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
// Phase 1: matrix 273 rows 233 cols
[2022-05-15 16:35:32] [INFO ] Computed 2 place invariants in 10 ms
[2022-05-15 16:35:32] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/324 places, 273/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 233/324 places, 273/344 transitions.
Support contains 42 out of 233 places after structural reductions.
[2022-05-15 16:35:32] [INFO ] Flatten gal took : 45 ms
[2022-05-15 16:35:32] [INFO ] Flatten gal took : 20 ms
[2022-05-15 16:35:32] [INFO ] Input system was already deterministic with 273 transitions.
Support contains 40 out of 233 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 37) seen :36
Finished Best-First random walk after 869 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=173 )
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 457 edges and 233 vertex of which 228 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0 U G(p1)))||G(p2)||p3)))'
Support contains 5 out of 233 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Graph (complete) has 457 edges and 233 vertex of which 229 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 228 transition count 232
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 192 transition count 232
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 73 place count 192 transition count 201
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 135 place count 161 transition count 201
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 141 place count 155 transition count 194
Iterating global reduction 2 with 6 rules applied. Total rules applied 147 place count 155 transition count 194
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 152 place count 150 transition count 189
Iterating global reduction 2 with 5 rules applied. Total rules applied 157 place count 150 transition count 189
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 146 transition count 182
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 146 transition count 182
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 143 transition count 179
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 143 transition count 179
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 281 place count 88 transition count 124
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 289 place count 80 transition count 109
Iterating global reduction 2 with 8 rules applied. Total rules applied 297 place count 80 transition count 109
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 305 place count 72 transition count 99
Iterating global reduction 2 with 8 rules applied. Total rules applied 313 place count 72 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 320 place count 65 transition count 86
Iterating global reduction 2 with 7 rules applied. Total rules applied 327 place count 65 transition count 86
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 333 place count 59 transition count 79
Iterating global reduction 2 with 6 rules applied. Total rules applied 339 place count 59 transition count 79
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 345 place count 53 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 351 place count 53 transition count 68
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 357 place count 47 transition count 61
Iterating global reduction 2 with 6 rules applied. Total rules applied 363 place count 47 transition count 61
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 365 place count 45 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 367 place count 45 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 368 place count 44 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 369 place count 44 transition count 57
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 371 place count 44 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 373 place count 42 transition count 55
Applied a total of 373 rules in 52 ms. Remains 42 /233 variables (removed 191) and now considering 55/273 (removed 218) transitions.
[2022-05-15 16:35:33] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 42 cols
[2022-05-15 16:35:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:35:33] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-15 16:35:33] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 42 cols
[2022-05-15 16:35:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:35:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 16:35:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-15 16:35:33] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:35:33] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 42 cols
[2022-05-15 16:35:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:35:33] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/233 places, 55/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/233 places, 55/273 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p2) (NOT p3) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3) p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(AND (EQ s16 1) (EQ s39 1)), p3:(AND (EQ s7 1) (EQ s41 1)), p1:(EQ s26 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2726 reset in 410 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-00 finished in 801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F((G(X(X(!p1)))&&X(p0)))))'
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 217 transition count 256
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 217 transition count 256
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 209 transition count 247
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 209 transition count 247
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 201 transition count 238
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 201 transition count 238
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 194 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 194 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 188 transition count 220
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 188 transition count 220
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 183 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 183 transition count 215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 181 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 181 transition count 213
Applied a total of 104 rules in 28 ms. Remains 181 /233 variables (removed 52) and now considering 213/273 (removed 60) transitions.
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:34] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:34] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:34] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/233 places, 213/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/233 places, 213/273 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s47 1), p1:(AND (EQ s157 1) (EQ s177 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 402 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-01 finished in 648 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(G((F(p0)||p1)))))))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Graph (complete) has 457 edges and 233 vertex of which 228 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 227 transition count 230
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 190 transition count 230
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 75 place count 190 transition count 196
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 143 place count 156 transition count 196
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 149 transition count 188
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 149 transition count 188
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 163 place count 143 transition count 182
Iterating global reduction 2 with 6 rules applied. Total rules applied 169 place count 143 transition count 182
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 138 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 138 transition count 173
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 134 transition count 169
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 134 transition count 169
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 295 place count 80 transition count 115
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 304 place count 71 transition count 98
Iterating global reduction 2 with 9 rules applied. Total rules applied 313 place count 71 transition count 98
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 322 place count 62 transition count 87
Iterating global reduction 2 with 9 rules applied. Total rules applied 331 place count 62 transition count 87
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 340 place count 53 transition count 70
Iterating global reduction 2 with 9 rules applied. Total rules applied 349 place count 53 transition count 70
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 358 place count 44 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 367 place count 44 transition count 60
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 376 place count 35 transition count 43
Iterating global reduction 2 with 9 rules applied. Total rules applied 385 place count 35 transition count 43
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 393 place count 27 transition count 34
Iterating global reduction 2 with 8 rules applied. Total rules applied 401 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 403 place count 25 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 405 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 24 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 24 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 24 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 411 place count 22 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 24 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 418 place count 17 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 422 place count 13 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 428 place count 10 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 430 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 432 place count 8 transition count 13
Applied a total of 432 rules in 39 ms. Remains 8 /233 variables (removed 225) and now considering 13/273 (removed 260) transitions.
[2022-05-15 16:35:34] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 16:35:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:35:34] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-15 16:35:34] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 16:35:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:35:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-15 16:35:34] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:35:34] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 16:35:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:35:34] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/233 places, 13/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/233 places, 13/273 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-02 finished in 189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||X(X(G(p1)))||G(p2)||p0)))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 217 transition count 256
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 217 transition count 256
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 210 transition count 248
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 210 transition count 248
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 203 transition count 240
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 203 transition count 240
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 197 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 197 transition count 232
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 192 transition count 225
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 192 transition count 225
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 188 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 188 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 186 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 186 transition count 219
Applied a total of 94 rules in 26 ms. Remains 186 /233 variables (removed 47) and now considering 219/273 (removed 54) transitions.
// Phase 1: matrix 219 rows 186 cols
[2022-05-15 16:35:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:34] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 219 rows 186 cols
[2022-05-15 16:35:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:35] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 186 cols
[2022-05-15 16:35:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:35] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/233 places, 219/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/233 places, 219/273 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s64 1) (EQ s182 1)), p2:(AND (EQ s102 1) (EQ s182 1)), p1:(AND (EQ s107 1) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-03 finished in 575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 217 transition count 257
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 217 transition count 257
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 210 transition count 249
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 210 transition count 249
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 203 transition count 241
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 203 transition count 241
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 196 transition count 231
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 196 transition count 231
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 190 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 190 transition count 223
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 185 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 185 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 183 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 183 transition count 216
Applied a total of 100 rules in 37 ms. Remains 183 /233 variables (removed 50) and now considering 216/273 (removed 57) transitions.
// Phase 1: matrix 216 rows 183 cols
[2022-05-15 16:35:35] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:35:35] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 216 rows 183 cols
[2022-05-15 16:35:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:35:35] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 183 cols
[2022-05-15 16:35:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:35] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/233 places, 216/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/233 places, 216/273 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s18 0), p1:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 169 ms.
Product exploration explored 100000 steps with 33333 reset in 166 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 371 edges and 183 vertex of which 182 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-04 finished in 1016 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0)&&F(p1))) U p2)))'
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 217 transition count 256
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 217 transition count 256
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 209 transition count 247
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 209 transition count 247
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 201 transition count 238
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 201 transition count 238
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 194 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 194 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 188 transition count 220
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 188 transition count 220
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 183 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 183 transition count 215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 181 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 181 transition count 213
Applied a total of 104 rules in 13 ms. Remains 181 /233 variables (removed 52) and now considering 213/273 (removed 60) transitions.
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:36] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:36] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:36] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/233 places, 213/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/233 places, 213/273 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p2), (OR (NOT p0) (NOT p1)), true, (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND p2 p0 p1), acceptance={0} source=5 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(EQ s124 1), p2:(AND (NEQ s152 1) (EQ s124 1)), p1:(EQ s101 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-05 finished in 496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((G(p0)&&p0) U (G((p1 U p0))&&F(p2))))))'
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 217 transition count 256
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 217 transition count 256
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 209 transition count 247
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 209 transition count 247
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 201 transition count 238
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 201 transition count 238
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 194 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 194 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 188 transition count 220
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 188 transition count 220
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 183 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 183 transition count 215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 181 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 181 transition count 213
Applied a total of 104 rules in 19 ms. Remains 181 /233 variables (removed 52) and now considering 213/273 (removed 60) transitions.
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:36] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:37] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:37] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/233 places, 213/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/233 places, 213/273 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s160 1), p1:(EQ s116 1), p2:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 515 steps with 1 reset in 4 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-06 finished in 544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 216 transition count 255
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 216 transition count 255
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 208 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 208 transition count 246
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 200 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 200 transition count 237
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 193 transition count 227
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 187 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 187 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 182 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 180 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 180 transition count 212
Applied a total of 106 rules in 24 ms. Remains 180 /233 variables (removed 53) and now considering 212/273 (removed 61) transitions.
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:37] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:37] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:37] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/233 places, 212/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/233 places, 212/273 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-07 finished in 384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 216 transition count 255
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 216 transition count 255
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 208 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 208 transition count 246
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 200 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 200 transition count 237
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 193 transition count 227
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 187 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 187 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 182 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 180 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 180 transition count 212
Applied a total of 106 rules in 19 ms. Remains 180 /233 variables (removed 53) and now considering 212/273 (removed 61) transitions.
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:37] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:38] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:38] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:35:38] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/233 places, 212/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/233 places, 212/273 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 821 reset in 152 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 81 in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-08 finished in 528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0 U p1))||p2)))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 218 transition count 257
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 218 transition count 257
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 212 transition count 250
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 212 transition count 250
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 206 transition count 243
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 206 transition count 243
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 201 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 201 transition count 236
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 197 transition count 231
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 197 transition count 231
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 194 transition count 228
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 194 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 193 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 193 transition count 227
Applied a total of 80 rules in 20 ms. Remains 193 /233 variables (removed 40) and now considering 227/273 (removed 46) transitions.
// Phase 1: matrix 227 rows 193 cols
[2022-05-15 16:35:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:38] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 227 rows 193 cols
[2022-05-15 16:35:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:38] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 193 cols
[2022-05-15 16:35:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:38] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/233 places, 227/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/233 places, 227/273 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s92 1) (EQ s189 1)) (AND (EQ s148 1) (EQ s189 1))), p2:(EQ s168 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 390 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1))))
Knowledge based reduction with 3 factoid took 571 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-09 finished in 1267 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(X(p0))||p1))&&X((p2 U G(p3))))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 217 transition count 256
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 217 transition count 256
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 209 transition count 247
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 209 transition count 247
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 201 transition count 238
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 201 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 195 transition count 230
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 195 transition count 230
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 190 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 190 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 186 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 186 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 184 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 184 transition count 217
Applied a total of 98 rules in 19 ms. Remains 184 /233 variables (removed 49) and now considering 217/273 (removed 56) transitions.
// Phase 1: matrix 217 rows 184 cols
[2022-05-15 16:35:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:39] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 217 rows 184 cols
[2022-05-15 16:35:39] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:35:39] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 184 cols
[2022-05-15 16:35:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:39] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/233 places, 217/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/233 places, 217/273 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (AND (NOT p0) (NOT p1))), true, (NOT p3), (NOT p3), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s66 1), p2:(AND (EQ s66 1) (EQ s49 1)), p1:(EQ s63 1), p0:(EQ s132 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-10 finished in 540 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(X(p1)||p2))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 216 transition count 255
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 216 transition count 255
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 208 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 208 transition count 246
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 200 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 200 transition count 237
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 193 transition count 227
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 187 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 187 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 182 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 180 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 180 transition count 212
Applied a total of 106 rules in 26 ms. Remains 180 /233 variables (removed 53) and now considering 212/273 (removed 61) transitions.
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:40] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:40] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:40] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:35:40] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/233 places, 212/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/233 places, 212/273 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s171 1) (EQ s176 1)), p2:(EQ s32 1), p1:(EQ s21 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5576 steps with 343 reset in 9 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-12 finished in 416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!X(p0)) U p1)||G((F((G(p2)||p2))||p1))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Graph (complete) has 457 edges and 233 vertex of which 228 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 227 transition count 232
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 192 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 191 transition count 231
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 73 place count 191 transition count 198
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 139 place count 158 transition count 198
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 146 place count 151 transition count 190
Iterating global reduction 3 with 7 rules applied. Total rules applied 153 place count 151 transition count 190
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 159 place count 145 transition count 184
Iterating global reduction 3 with 6 rules applied. Total rules applied 165 place count 145 transition count 184
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 140 transition count 175
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 140 transition count 175
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 136 transition count 171
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 136 transition count 171
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 291 place count 82 transition count 117
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 299 place count 74 transition count 102
Iterating global reduction 3 with 8 rules applied. Total rules applied 307 place count 74 transition count 102
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 315 place count 66 transition count 92
Iterating global reduction 3 with 8 rules applied. Total rules applied 323 place count 66 transition count 92
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 331 place count 58 transition count 77
Iterating global reduction 3 with 8 rules applied. Total rules applied 339 place count 58 transition count 77
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 346 place count 51 transition count 69
Iterating global reduction 3 with 7 rules applied. Total rules applied 353 place count 51 transition count 69
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 360 place count 44 transition count 56
Iterating global reduction 3 with 7 rules applied. Total rules applied 367 place count 44 transition count 56
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 374 place count 37 transition count 48
Iterating global reduction 3 with 7 rules applied. Total rules applied 381 place count 37 transition count 48
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 383 place count 35 transition count 45
Iterating global reduction 3 with 2 rules applied. Total rules applied 385 place count 35 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 386 place count 34 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 387 place count 34 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 388 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 390 place count 32 transition count 42
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 52 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 395 place count 30 transition count 38
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 398 place count 27 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 402 place count 25 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 406 place count 23 transition count 36
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 410 place count 19 transition count 32
Applied a total of 410 rules in 42 ms. Remains 19 /233 variables (removed 214) and now considering 32/273 (removed 241) transitions.
[2022-05-15 16:35:40] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 19 cols
[2022-05-15 16:35:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:35:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-15 16:35:40] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 19 cols
[2022-05-15 16:35:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:35:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-15 16:35:40] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:35:40] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 19 cols
[2022-05-15 16:35:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:35:40] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/233 places, 32/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/233 places, 32/273 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s18 1)), p2:(EQ s10 1), p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-13 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((!F(p0)||p1)) U G((X(p2) U G(p2)))))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 216 transition count 255
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 216 transition count 255
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 209 transition count 247
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 209 transition count 247
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 202 transition count 239
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 202 transition count 239
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 196 transition count 230
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 196 transition count 230
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 191 transition count 224
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 191 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 188 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 188 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 187 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 187 transition count 220
Applied a total of 92 rules in 20 ms. Remains 187 /233 variables (removed 46) and now considering 220/273 (removed 53) transitions.
// Phase 1: matrix 220 rows 187 cols
[2022-05-15 16:35:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:40] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 220 rows 187 cols
[2022-05-15 16:35:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:41] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 187 cols
[2022-05-15 16:35:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:41] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/233 places, 220/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/233 places, 220/273 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1) p0), true, (AND p2 p0), (NOT p2), (AND (NOT p2) p0 p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s49 1), p1:(AND (EQ s107 1) (EQ s183 1)), p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19987 reset in 121 ms.
Product exploration explored 100000 steps with 19975 reset in 131 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 378 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 7 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), true, (AND p2 p0), (NOT p2), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 220 rows 187 cols
[2022-05-15 16:35:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 16:35:42] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:35:42] [INFO ] After 82ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-15 16:35:42] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:35:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 16:35:43] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 16:35:43] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-15 16:35:43] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND p0 p2)), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND p0 p1 p2))]
Knowledge based reduction with 8 factoid took 559 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 7 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), true, (AND p2 p0), (NOT p2), (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), true, (AND p2 p0), (NOT p2), (AND (NOT p2) p0 p1)]
// Phase 1: matrix 220 rows 187 cols
[2022-05-15 16:35:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:35:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 16:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:35:44] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND p0 p2)), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND p0 p1 p2)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 8 factoid took 359 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-14 finished in 3924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p1)&&F(p2)&&p0))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 273/273 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 219 transition count 258
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 219 transition count 258
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 212 transition count 250
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 212 transition count 250
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 205 transition count 242
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 205 transition count 242
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 199 transition count 233
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 199 transition count 233
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 194 transition count 227
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 194 transition count 227
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 190 transition count 223
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 190 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 189 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 189 transition count 222
Applied a total of 88 rules in 20 ms. Remains 189 /233 variables (removed 44) and now considering 222/273 (removed 51) transitions.
// Phase 1: matrix 222 rows 189 cols
[2022-05-15 16:35:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:44] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 222 rows 189 cols
[2022-05-15 16:35:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:45] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 189 cols
[2022-05-15 16:35:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:45] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/233 places, 222/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/233 places, 222/273 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s144 1) (OR (EQ s179 1) (AND (EQ s69 1) (EQ s188 1)))), p1:(EQ s179 1), p2:(EQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-15 finished in 480 ms.
All properties solved by simple procedures.
Total runtime 14060 ms.

BK_STOP 1652632545391

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-11b"
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-11b, 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 r078-tall-165260109800092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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