Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 97K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-13b-00
FORMULA_NAME DiscoveryGPU-PT-13b-01
FORMULA_NAME DiscoveryGPU-PT-13b-02
FORMULA_NAME DiscoveryGPU-PT-13b-03
FORMULA_NAME DiscoveryGPU-PT-13b-04
FORMULA_NAME DiscoveryGPU-PT-13b-05
FORMULA_NAME DiscoveryGPU-PT-13b-06
FORMULA_NAME DiscoveryGPU-PT-13b-07
FORMULA_NAME DiscoveryGPU-PT-13b-08
FORMULA_NAME DiscoveryGPU-PT-13b-09
FORMULA_NAME DiscoveryGPU-PT-13b-10
FORMULA_NAME DiscoveryGPU-PT-13b-11
FORMULA_NAME DiscoveryGPU-PT-13b-12
FORMULA_NAME DiscoveryGPU-PT-13b-13
FORMULA_NAME DiscoveryGPU-PT-13b-14
FORMULA_NAME DiscoveryGPU-PT-13b-15

=== Now, execution of the tool begins

BK_START 1620580087188

Running Version 0
[2021-05-09 17:08:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 17:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:08:08] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-09 17:08:08] [INFO ] Transformed 380 places.
[2021-05-09 17:08:08] [INFO ] Transformed 404 transitions.
[2021-05-09 17:08:08] [INFO ] Found NUPN structural information;
[2021-05-09 17:08:08] [INFO ] Parsed PT model containing 380 places and 404 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 17:08:08] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-13b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 357 transition count 404
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 80 place count 300 transition count 347
Iterating global reduction 1 with 57 rules applied. Total rules applied 137 place count 300 transition count 347
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 149 place count 288 transition count 335
Iterating global reduction 1 with 12 rules applied. Total rules applied 161 place count 288 transition count 335
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 171 place count 278 transition count 325
Iterating global reduction 1 with 10 rules applied. Total rules applied 181 place count 278 transition count 325
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 191 place count 268 transition count 315
Iterating global reduction 1 with 10 rules applied. Total rules applied 201 place count 268 transition count 315
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 210 place count 259 transition count 297
Iterating global reduction 1 with 9 rules applied. Total rules applied 219 place count 259 transition count 297
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 227 place count 251 transition count 289
Iterating global reduction 1 with 8 rules applied. Total rules applied 235 place count 251 transition count 289
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 242 place count 244 transition count 282
Iterating global reduction 1 with 7 rules applied. Total rules applied 249 place count 244 transition count 282
Applied a total of 249 rules in 110 ms. Remains 244 /380 variables (removed 136) and now considering 282/404 (removed 122) transitions.
// Phase 1: matrix 282 rows 244 cols
[2021-05-09 17:08:09] [INFO ] Computed 2 place invariants in 19 ms
[2021-05-09 17:08:09] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 282 rows 244 cols
[2021-05-09 17:08:09] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:08:09] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 244 cols
[2021-05-09 17:08:09] [INFO ] Computed 2 place invariants in 11 ms
[2021-05-09 17:08:09] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 244/380 places, 282/404 transitions.
[2021-05-09 17:08:09] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 17:08:09] [INFO ] Flatten gal took : 49 ms
FORMULA DiscoveryGPU-PT-13b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 17:08:09] [INFO ] Flatten gal took : 24 ms
[2021-05-09 17:08:09] [INFO ] Input system was already deterministic with 282 transitions.
Incomplete random walk after 100000 steps, including 237 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 9) seen :8
Running SMT prover for 1 properties.
// Phase 1: matrix 282 rows 244 cols
[2021-05-09 17:08:10] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:08:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 17:08:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 17:08:10] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-09 17:08:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 17:08:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 17:08:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 17:08:10] [INFO ] [Nat]Absence check using state equation in 65 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
[2021-05-09 17:08:10] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-13b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 282/282 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 282
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 229 transition count 268
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 229 transition count 268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 225 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 225 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 223 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 223 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 222 transition count 261
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 222 transition count 261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 221 transition count 259
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 221 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 220 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 220 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 219 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 219 transition count 257
Applied a total of 48 rules in 32 ms. Remains 219 /244 variables (removed 25) and now considering 257/282 (removed 25) transitions.
// Phase 1: matrix 257 rows 219 cols
[2021-05-09 17:08:10] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 17:08:10] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 257 rows 219 cols
[2021-05-09 17:08:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:10] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 257 rows 219 cols
[2021-05-09 17:08:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:10] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Finished structural reductions, in 1 iterations. Remains : 219/244 places, 257/282 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s38 0) (NEQ s167 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1089 steps with 2 reset in 29 ms.
FORMULA DiscoveryGPU-PT-13b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-00 finished in 638 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0 U p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 282/282 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 241 transition count 282
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 227 transition count 267
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 227 transition count 267
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 223 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 223 transition count 263
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 220 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 220 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 218 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 218 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 216 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 216 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 214 transition count 252
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 214 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 212 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 212 transition count 250
Applied a total of 61 rules in 21 ms. Remains 212 /244 variables (removed 32) and now considering 250/282 (removed 32) transitions.
// Phase 1: matrix 250 rows 212 cols
[2021-05-09 17:08:11] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:08:11] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 250 rows 212 cols
[2021-05-09 17:08:11] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:08:11] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 212 cols
[2021-05-09 17:08:11] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:08:11] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 212/244 places, 250/282 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s191 1) (EQ s206 1)), p0:(EQ s191 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-01 finished in 464 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 282/282 transitions.
Graph (complete) has 474 edges and 244 vertex of which 241 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 240 transition count 242
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 201 transition count 242
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 79 place count 201 transition count 204
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 155 place count 163 transition count 204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 158 transition count 198
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 158 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 165 place count 158 transition count 197
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 157 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 170 place count 154 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 154 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 175 place count 152 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 177 place count 152 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 179 place count 150 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 181 place count 150 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 183 place count 148 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 148 transition count 186
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 305 place count 88 transition count 126
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 317 place count 76 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 329 place count 76 transition count 102
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 341 place count 64 transition count 90
Iterating global reduction 2 with 12 rules applied. Total rules applied 353 place count 64 transition count 90
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 364 place count 53 transition count 68
Iterating global reduction 2 with 11 rules applied. Total rules applied 375 place count 53 transition count 68
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 385 place count 43 transition count 58
Iterating global reduction 2 with 10 rules applied. Total rules applied 395 place count 43 transition count 58
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 405 place count 33 transition count 38
Iterating global reduction 2 with 10 rules applied. Total rules applied 415 place count 33 transition count 38
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 425 place count 23 transition count 28
Iterating global reduction 2 with 10 rules applied. Total rules applied 435 place count 23 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 23 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 437 place count 23 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 438 place count 22 transition count 26
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 445 place count 20 transition count 21
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 450 place count 15 transition count 21
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 460 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 462 place count 9 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 463 place count 9 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 464 place count 8 transition count 14
Applied a total of 464 rules in 55 ms. Remains 8 /244 variables (removed 236) and now considering 14/282 (removed 268) transitions.
[2021-05-09 17:08:11] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 17:08:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:11] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 17:08:11] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 17:08:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:08:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-09 17:08:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:08:11] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 17:08:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 17:08:11] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/244 places, 14/282 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s2 0) (NEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-03 finished in 161 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 282/282 transitions.
Graph (complete) has 474 edges and 244 vertex of which 242 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 241 transition count 242
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 202 transition count 242
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 79 place count 202 transition count 204
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 155 place count 164 transition count 204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 159 transition count 198
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 159 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 165 place count 159 transition count 197
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 158 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 170 place count 155 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 155 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 175 place count 153 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 177 place count 153 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 179 place count 151 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 181 place count 151 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 183 place count 149 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 149 transition count 186
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 307 place count 88 transition count 125
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 319 place count 76 transition count 101
Iterating global reduction 2 with 12 rules applied. Total rules applied 331 place count 76 transition count 101
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 343 place count 64 transition count 89
Iterating global reduction 2 with 12 rules applied. Total rules applied 355 place count 64 transition count 89
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 366 place count 53 transition count 67
Iterating global reduction 2 with 11 rules applied. Total rules applied 377 place count 53 transition count 67
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 387 place count 43 transition count 57
Iterating global reduction 2 with 10 rules applied. Total rules applied 397 place count 43 transition count 57
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 407 place count 33 transition count 37
Iterating global reduction 2 with 10 rules applied. Total rules applied 417 place count 33 transition count 37
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 427 place count 23 transition count 27
Iterating global reduction 2 with 10 rules applied. Total rules applied 437 place count 23 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 438 place count 23 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 439 place count 22 transition count 25
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 446 place count 20 transition count 20
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 451 place count 15 transition count 20
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 461 place count 10 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 463 place count 9 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 464 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 465 place count 8 transition count 13
Applied a total of 465 rules in 49 ms. Remains 8 /244 variables (removed 236) and now considering 13/282 (removed 269) transitions.
[2021-05-09 17:08:11] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 17:08:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:11] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 17:08:11] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 17:08:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:08:11] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-09 17:08:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:08:11] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 17:08:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/244 places, 13/282 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s6 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-08 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 282/282 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 241 transition count 282
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 229 transition count 270
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 229 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 225 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 225 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 223 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 223 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 221 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 221 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 219 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 219 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 217 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 217 transition count 256
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 215 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 215 transition count 254
Applied a total of 55 rules in 21 ms. Remains 215 /244 variables (removed 29) and now considering 254/282 (removed 28) transitions.
// Phase 1: matrix 254 rows 215 cols
[2021-05-09 17:08:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:12] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 254 rows 215 cols
[2021-05-09 17:08:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:12] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 254 rows 215 cols
[2021-05-09 17:08:12] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:08:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 1 iterations. Remains : 215/244 places, 254/282 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s139 1), p0:(OR (EQ s106 0) (EQ s89 1) (EQ s151 0) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 401 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-13b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-12 finished in 399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 282/282 transitions.
Graph (complete) has 474 edges and 244 vertex of which 241 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 240 transition count 243
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 202 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 200 transition count 241
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 81 place count 200 transition count 203
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 157 place count 162 transition count 203
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 162 place count 157 transition count 197
Iterating global reduction 3 with 5 rules applied. Total rules applied 167 place count 157 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 167 place count 157 transition count 196
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 156 transition count 196
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 153 transition count 193
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 153 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 151 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 151 transition count 191
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 181 place count 149 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 149 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 147 transition count 185
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 147 transition count 185
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 305 place count 88 transition count 126
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 316 place count 77 transition count 104
Iterating global reduction 3 with 11 rules applied. Total rules applied 327 place count 77 transition count 104
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 338 place count 66 transition count 93
Iterating global reduction 3 with 11 rules applied. Total rules applied 349 place count 66 transition count 93
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 360 place count 55 transition count 71
Iterating global reduction 3 with 11 rules applied. Total rules applied 371 place count 55 transition count 71
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 382 place count 44 transition count 60
Iterating global reduction 3 with 11 rules applied. Total rules applied 393 place count 44 transition count 60
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 403 place count 34 transition count 40
Iterating global reduction 3 with 10 rules applied. Total rules applied 413 place count 34 transition count 40
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 423 place count 24 transition count 30
Iterating global reduction 3 with 10 rules applied. Total rules applied 433 place count 24 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 434 place count 24 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 435 place count 24 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 23 transition count 28
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 7 rules applied. Total rules applied 443 place count 21 transition count 23
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 448 place count 16 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 448 place count 16 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 450 place count 15 transition count 22
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 460 place count 10 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 462 place count 9 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 463 place count 9 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 464 place count 8 transition count 15
Applied a total of 464 rules in 62 ms. Remains 8 /244 variables (removed 236) and now considering 15/282 (removed 267) transitions.
[2021-05-09 17:08:12] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 8 cols
[2021-05-09 17:08:12] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:12] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 17:08:12] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 8 cols
[2021-05-09 17:08:12] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:08:12] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-09 17:08:12] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:08:12] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 8 cols
[2021-05-09 17:08:12] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:12] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/244 places, 15/282 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s2 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-13 finished in 141 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620580094030

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-13b"
export BK_EXAMINATION="LTLCardinality"
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-13b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875300356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13b.tgz
mv DiscoveryGPU-PT-13b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;