fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048875200292
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for DiscoveryGPU-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
771.163 54275.00 54055.00 7394.40 FTFFFFFFFTTTFFFF normal

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-162048875200292.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-09b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875200292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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.5K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.6K Mar 22 17:59 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 68K 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-09b-00
FORMULA_NAME DiscoveryGPU-PT-09b-01
FORMULA_NAME DiscoveryGPU-PT-09b-02
FORMULA_NAME DiscoveryGPU-PT-09b-03
FORMULA_NAME DiscoveryGPU-PT-09b-04
FORMULA_NAME DiscoveryGPU-PT-09b-05
FORMULA_NAME DiscoveryGPU-PT-09b-06
FORMULA_NAME DiscoveryGPU-PT-09b-07
FORMULA_NAME DiscoveryGPU-PT-09b-08
FORMULA_NAME DiscoveryGPU-PT-09b-09
FORMULA_NAME DiscoveryGPU-PT-09b-10
FORMULA_NAME DiscoveryGPU-PT-09b-11
FORMULA_NAME DiscoveryGPU-PT-09b-12
FORMULA_NAME DiscoveryGPU-PT-09b-13
FORMULA_NAME DiscoveryGPU-PT-09b-14
FORMULA_NAME DiscoveryGPU-PT-09b-15

=== Now, execution of the tool begins

BK_START 1620575113167

Running Version 0
[2021-05-09 15:45:21] [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 15:45:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:45:21] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-09 15:45:21] [INFO ] Transformed 268 places.
[2021-05-09 15:45:21] [INFO ] Transformed 284 transitions.
[2021-05-09 15:45:21] [INFO ] Found NUPN structural information;
[2021-05-09 15:45:21] [INFO ] Parsed PT model containing 268 places and 284 transitions in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:45:21] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-09b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 284/284 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 252 transition count 284
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 49 place count 219 transition count 251
Iterating global reduction 1 with 33 rules applied. Total rules applied 82 place count 219 transition count 251
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 212 transition count 244
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 212 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 206 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 206 transition count 238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 202 transition count 234
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 202 transition count 234
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 198 transition count 226
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 198 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 197 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 197 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 196 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 196 transition count 224
Applied a total of 128 rules in 108 ms. Remains 196 /268 variables (removed 72) and now considering 224/284 (removed 60) transitions.
// Phase 1: matrix 224 rows 196 cols
[2021-05-09 15:45:21] [INFO ] Computed 2 place invariants in 16 ms
[2021-05-09 15:45:21] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 224 rows 196 cols
[2021-05-09 15:45:21] [INFO ] Computed 2 place invariants in 10 ms
[2021-05-09 15:45:21] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
// Phase 1: matrix 224 rows 196 cols
[2021-05-09 15:45:21] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:45:22] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 196/268 places, 224/284 transitions.
[2021-05-09 15:45:22] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 15:45:22] [INFO ] Flatten gal took : 42 ms
FORMULA DiscoveryGPU-PT-09b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:45:22] [INFO ] Flatten gal took : 20 ms
[2021-05-09 15:45:22] [INFO ] Input system was already deterministic with 224 transitions.
Incomplete random walk after 100000 steps, including 338 resets, run finished after 343 ms. (steps per millisecond=291 ) properties (out of 14) seen :13
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 196 cols
[2021-05-09 15:45:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 15:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:45:22] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-09 15:45:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:45:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 15:45:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:45:22] [INFO ] [Nat]Absence check using state equation in 32 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2021-05-09 15:45:22] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-09b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 224/224 transitions.
Graph (complete) has 370 edges and 196 vertex of which 194 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 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 193 transition count 185
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 155 transition count 185
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 77 place count 155 transition count 162
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 123 place count 132 transition count 162
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 133 place count 122 transition count 152
Iterating global reduction 2 with 10 rules applied. Total rules applied 143 place count 122 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 143 place count 122 transition count 150
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 120 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 117 transition count 146
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 117 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 115 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 115 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 114 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 114 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 113 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 113 transition count 141
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 253 place count 67 transition count 95
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 261 place count 59 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 269 place count 59 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 276 place count 52 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 283 place count 52 transition count 71
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 289 place count 46 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 295 place count 46 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 301 place count 40 transition count 53
Iterating global reduction 2 with 6 rules applied. Total rules applied 307 place count 40 transition count 53
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 312 place count 35 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 317 place count 35 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 322 place count 30 transition count 38
Iterating global reduction 2 with 5 rules applied. Total rules applied 327 place count 30 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 329 place count 28 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 331 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 332 place count 27 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 333 place count 27 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 334 place count 27 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 335 place count 27 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 336 place count 26 transition count 32
Reduce places removed 2 places and 0 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 6 rules applied. Total rules applied 342 place count 24 transition count 28
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 346 place count 20 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 346 place count 20 transition count 27
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 348 place count 19 transition count 27
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 360 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 364 place count 11 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 366 place count 11 transition count 20
Applied a total of 366 rules in 85 ms. Remains 11 /196 variables (removed 185) and now considering 20/224 (removed 204) transitions.
[2021-05-09 15:45:23] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 11 cols
[2021-05-09 15:45:23] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:45:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2021-05-09 15:45:23] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 11 cols
[2021-05-09 15:45:23] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:45:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:45:23] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-09 15:45:23] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 15:45:23] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 11 cols
[2021-05-09 15:45:23] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:45:23] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/196 places, 20/224 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09b-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(NEQ s9 1), p0:(AND (NEQ s6 0) (NEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-02 finished in 343 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 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 224/224 transitions.
Graph (complete) has 370 edges and 196 vertex of which 194 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 193 transition count 184
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 154 transition count 184
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 79 place count 154 transition count 161
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 125 place count 131 transition count 161
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 134 place count 122 transition count 152
Iterating global reduction 2 with 9 rules applied. Total rules applied 143 place count 122 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 143 place count 122 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 120 transition count 150
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 118 transition count 148
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 118 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 117 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 117 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 116 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 116 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 115 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 115 transition count 144
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 251 place count 68 transition count 97
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 258 place count 61 transition count 84
Iterating global reduction 2 with 7 rules applied. Total rules applied 265 place count 61 transition count 84
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 272 place count 54 transition count 75
Iterating global reduction 2 with 7 rules applied. Total rules applied 279 place count 54 transition count 75
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 286 place count 47 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 293 place count 47 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 300 place count 40 transition count 54
Iterating global reduction 2 with 7 rules applied. Total rules applied 307 place count 40 transition count 54
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 314 place count 33 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 321 place count 33 transition count 41
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 328 place count 26 transition count 33
Iterating global reduction 2 with 7 rules applied. Total rules applied 335 place count 26 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 337 place count 24 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 340 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 341 place count 23 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 23 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 343 place count 23 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 344 place count 22 transition count 27
Applied a total of 344 rules in 42 ms. Remains 22 /196 variables (removed 174) and now considering 27/224 (removed 197) transitions.
[2021-05-09 15:45:23] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
// Phase 1: matrix 24 rows 22 cols
[2021-05-09 15:45:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 15:45:23] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
// Phase 1: matrix 24 rows 22 cols
[2021-05-09 15:45:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:23] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-09 15:45:23] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-09 15:45:23] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:45:23] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
// Phase 1: matrix 24 rows 22 cols
[2021-05-09 15:45:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:23] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/196 places, 27/224 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-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:(OR (EQ s11 0) (EQ s20 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 145 steps with 2 reset in 3 ms.
FORMULA DiscoveryGPU-PT-09b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-03 finished in 186 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 224/224 transitions.
Graph (complete) has 370 edges and 196 vertex of which 194 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 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 193 transition count 186
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 156 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 155 transition count 185
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 77 place count 155 transition count 162
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 123 place count 132 transition count 162
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 133 place count 122 transition count 152
Iterating global reduction 3 with 10 rules applied. Total rules applied 143 place count 122 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 143 place count 122 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 120 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 118 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 118 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 117 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 117 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 116 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 116 transition count 145
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 245 place count 71 transition count 100
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 251 place count 65 transition count 89
Iterating global reduction 3 with 6 rules applied. Total rules applied 257 place count 65 transition count 89
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 262 place count 60 transition count 83
Iterating global reduction 3 with 5 rules applied. Total rules applied 267 place count 60 transition count 83
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 272 place count 55 transition count 74
Iterating global reduction 3 with 5 rules applied. Total rules applied 277 place count 55 transition count 74
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 282 place count 50 transition count 68
Iterating global reduction 3 with 5 rules applied. Total rules applied 287 place count 50 transition count 68
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 292 place count 45 transition count 59
Iterating global reduction 3 with 5 rules applied. Total rules applied 297 place count 45 transition count 59
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 302 place count 40 transition count 53
Iterating global reduction 3 with 5 rules applied. Total rules applied 307 place count 40 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 308 place count 39 transition count 52
Iterating global reduction 3 with 1 rules applied. Total rules applied 309 place count 39 transition count 52
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 3 with 2 rules applied. Total rules applied 311 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 37 transition count 50
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 37 transition count 50
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 314 place count 36 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 36 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 316 place count 35 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 35 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 318 place count 34 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 34 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 320 place count 33 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 321 place count 33 transition count 44
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 322 place count 32 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 32 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 324 place count 31 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 325 place count 31 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 31 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 30 transition count 39
Applied a total of 327 rules in 50 ms. Remains 30 /196 variables (removed 166) and now considering 39/224 (removed 185) transitions.
[2021-05-09 15:45:23] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 30 cols
[2021-05-09 15:45:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-09 15:45:23] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 30 cols
[2021-05-09 15:45:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2021-05-09 15:45:23] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2021-05-09 15:45:23] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:45:23] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 30 cols
[2021-05-09 15:45:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/196 places, 39/224 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s20 1)), p1:(AND (NEQ s14 0) (NEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-05 finished in 204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 224/224 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 224
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 174 transition count 204
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 174 transition count 204
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 166 transition count 194
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 166 transition count 194
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 162 transition count 190
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 162 transition count 190
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 158 transition count 186
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 158 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 156 transition count 182
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 156 transition count 182
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 154 transition count 180
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 152 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 152 transition count 178
Applied a total of 86 rules in 19 ms. Remains 152 /196 variables (removed 44) and now considering 178/224 (removed 46) transitions.
// Phase 1: matrix 178 rows 152 cols
[2021-05-09 15:45:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:23] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 178 rows 152 cols
[2021-05-09 15:45:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:23] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 152 cols
[2021-05-09 15:45:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:23] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/196 places, 178/224 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DiscoveryGPU-PT-09b-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s52 1)), p1:(AND (NEQ s38 0) (NEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-06 finished in 329 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 224/224 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 224
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 175 transition count 205
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 175 transition count 205
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 167 transition count 195
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 167 transition count 195
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 163 transition count 191
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 163 transition count 191
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 159 transition count 187
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 159 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 157 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 157 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 155 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 155 transition count 181
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 153 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 153 transition count 179
Applied a total of 84 rules in 12 ms. Remains 153 /196 variables (removed 43) and now considering 179/224 (removed 45) transitions.
// Phase 1: matrix 179 rows 153 cols
[2021-05-09 15:45:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:24] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 179 rows 153 cols
[2021-05-09 15:45:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:24] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 179 rows 153 cols
[2021-05-09 15:45:24] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 15:45:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/196 places, 179/224 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-11 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}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s75 0) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 255 ms.
Product exploration explored 100000 steps with 20000 reset in 160 ms.
Graph (complete) has 306 edges and 153 vertex of which 151 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 134 ms.
Product exploration explored 100000 steps with 20000 reset in 144 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 153/153 places, 179/179 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 153 transition count 179
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 18 place count 153 transition count 264
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 49 place count 153 transition count 264
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 62 place count 153 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 152 transition count 263
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 152 transition count 263
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 91 place count 152 transition count 357
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 98 place count 145 transition count 329
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 105 place count 145 transition count 329
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 126 place count 124 transition count 273
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 147 place count 124 transition count 273
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 168 place count 103 transition count 224
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 189 place count 103 transition count 224
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 196 place count 96 transition count 210
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 203 place count 96 transition count 210
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 217 place count 82 transition count 175
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 231 place count 82 transition count 175
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 259 place count 54 transition count 105
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 287 place count 54 transition count 105
Deduced a syphon composed of 32 places in 0 ms
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 303 place count 54 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 305 place count 52 transition count 85
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 307 place count 52 transition count 85
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 307 rules in 31 ms. Remains 52 /153 variables (removed 101) and now considering 85/179 (removed 94) transitions.
[2021-05-09 15:45:25] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 15:45:25] [INFO ] Flow matrix only has 79 transitions (discarded 6 similar events)
// Phase 1: matrix 79 rows 52 cols
[2021-05-09 15:45:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:25] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/153 places, 85/179 transitions.
Product exploration explored 100000 steps with 20000 reset in 345 ms.
Product exploration explored 100000 steps with 20000 reset in 284 ms.
[2021-05-09 15:45:26] [INFO ] Flatten gal took : 10 ms
[2021-05-09 15:45:26] [INFO ] Flatten gal took : 9 ms
[2021-05-09 15:45:26] [INFO ] Time to serialize gal into /tmp/LTL17763636756740340632.gal : 4 ms
[2021-05-09 15:45:26] [INFO ] Time to serialize properties into /tmp/LTL15905408220311549733.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17763636756740340632.gal, -t, CGAL, -LTL, /tmp/LTL15905408220311549733.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17763636756740340632.gal -t CGAL -LTL /tmp/LTL15905408220311549733.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("((p127==0)||(p135==1))")))))))
Formula 0 simplified : !XXXXF"((p127==0)||(p135==1))"
Detected timeout of ITS tools.
[2021-05-09 15:45:49] [INFO ] Flatten gal took : 9 ms
[2021-05-09 15:45:49] [INFO ] Applying decomposition
[2021-05-09 15:45:49] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16217723698720080669.txt, -o, /tmp/graph16217723698720080669.bin, -w, /tmp/graph16217723698720080669.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16217723698720080669.bin, -l, -1, -v, -w, /tmp/graph16217723698720080669.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:45:49] [INFO ] Decomposing Gal with order
[2021-05-09 15:45:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:45:49] [INFO ] Removed a total of 69 redundant transitions.
[2021-05-09 15:45:49] [INFO ] Flatten gal took : 37 ms
[2021-05-09 15:45:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 5 ms.
[2021-05-09 15:45:49] [INFO ] Time to serialize gal into /tmp/LTL11238761584933726523.gal : 4 ms
[2021-05-09 15:45:49] [INFO ] Time to serialize properties into /tmp/LTL8885786938503894112.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11238761584933726523.gal, -t, CGAL, -LTL, /tmp/LTL8885786938503894112.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11238761584933726523.gal -t CGAL -LTL /tmp/LTL8885786938503894112.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("((i10.u28.p127==0)||(i9.i1.u31.p135==1))")))))))
Formula 0 simplified : !XXXXF"((i10.u28.p127==0)||(i9.i1.u31.p135==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4075349088294305450
[2021-05-09 15:46:04] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4075349088294305450
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4075349088294305450]
Compilation finished in 824 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4075349088294305450]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(X(<>((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4075349088294305450]
LTSmin run took 628 ms.
FORMULA DiscoveryGPU-PT-09b-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-09b-11 finished in 42059 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 224/224 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 224
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 174 transition count 204
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 174 transition count 204
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 166 transition count 194
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 166 transition count 194
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 162 transition count 190
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 162 transition count 190
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 158 transition count 186
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 158 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 156 transition count 182
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 156 transition count 182
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 154 transition count 180
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 152 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 152 transition count 178
Applied a total of 86 rules in 18 ms. Remains 152 /196 variables (removed 44) and now considering 178/224 (removed 46) transitions.
// Phase 1: matrix 178 rows 152 cols
[2021-05-09 15:46:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:46:06] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 178 rows 152 cols
[2021-05-09 15:46:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:46:06] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 152 cols
[2021-05-09 15:46:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:46:06] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/196 places, 178/224 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s21 0) (NEQ s111 1) (NEQ s125 0) (NEQ s148 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][false, false]]
Stuttering criterion allowed to conclude after 308 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-12 finished in 284 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 224/224 transitions.
Graph (complete) has 370 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 194 transition count 186
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 157 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 155 transition count 184
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 79 place count 155 transition count 161
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 125 place count 132 transition count 161
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 133 place count 124 transition count 153
Iterating global reduction 3 with 8 rules applied. Total rules applied 141 place count 124 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 141 place count 124 transition count 152
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 143 place count 123 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 121 transition count 149
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 121 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 120 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 120 transition count 148
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 247 place count 71 transition count 99
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 254 place count 64 transition count 86
Iterating global reduction 3 with 7 rules applied. Total rules applied 261 place count 64 transition count 86
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 268 place count 57 transition count 77
Iterating global reduction 3 with 7 rules applied. Total rules applied 275 place count 57 transition count 77
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 282 place count 50 transition count 64
Iterating global reduction 3 with 7 rules applied. Total rules applied 289 place count 50 transition count 64
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 296 place count 43 transition count 56
Iterating global reduction 3 with 7 rules applied. Total rules applied 303 place count 43 transition count 56
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 309 place count 37 transition count 45
Iterating global reduction 3 with 6 rules applied. Total rules applied 315 place count 37 transition count 45
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 321 place count 31 transition count 38
Iterating global reduction 3 with 6 rules applied. Total rules applied 327 place count 31 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 329 place count 29 transition count 35
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 29 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 332 place count 28 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 333 place count 28 transition count 34
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 335 place count 28 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 27 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 339 place count 26 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 341 place count 24 transition count 29
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 341 place count 24 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 349 place count 20 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 350 place count 19 transition count 24
Applied a total of 350 rules in 25 ms. Remains 19 /196 variables (removed 177) and now considering 24/224 (removed 200) transitions.
[2021-05-09 15:46:06] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 19 cols
[2021-05-09 15:46:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:06] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-09 15:46:06] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 19 cols
[2021-05-09 15:46:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:46:06] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-09 15:46:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:46:06] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 19 cols
[2021-05-09 15:46:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:06] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/196 places, 24/224 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09b-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s17 1)), p1:(EQ s16 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-14 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 224/224 transitions.
Graph (complete) has 370 edges and 196 vertex of which 194 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output 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 193 transition count 186
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 156 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 155 transition count 185
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 77 place count 155 transition count 162
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 123 place count 132 transition count 162
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 132 place count 123 transition count 153
Iterating global reduction 3 with 9 rules applied. Total rules applied 141 place count 123 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 141 place count 123 transition count 152
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 143 place count 122 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 119 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 119 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 117 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 117 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 116 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 116 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 115 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 115 transition count 143
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 253 place count 67 transition count 95
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 261 place count 59 transition count 80
Iterating global reduction 3 with 8 rules applied. Total rules applied 269 place count 59 transition count 80
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 277 place count 51 transition count 70
Iterating global reduction 3 with 8 rules applied. Total rules applied 285 place count 51 transition count 70
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 292 place count 44 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 299 place count 44 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 306 place count 37 transition count 49
Iterating global reduction 3 with 7 rules applied. Total rules applied 313 place count 37 transition count 49
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 320 place count 30 transition count 36
Iterating global reduction 3 with 7 rules applied. Total rules applied 327 place count 30 transition count 36
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 334 place count 23 transition count 28
Iterating global reduction 3 with 7 rules applied. Total rules applied 341 place count 23 transition count 28
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 343 place count 21 transition count 25
Iterating global reduction 3 with 2 rules applied. Total rules applied 345 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 346 place count 20 transition count 24
Iterating global reduction 3 with 1 rules applied. Total rules applied 347 place count 20 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 348 place count 20 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 349 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 351 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 17 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 352 place count 17 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 358 place count 14 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 359 place count 13 transition count 17
Applied a total of 359 rules in 20 ms. Remains 13 /196 variables (removed 183) and now considering 17/224 (removed 207) transitions.
[2021-05-09 15:46:06] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2021-05-09 15:46:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:06] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-09 15:46:06] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2021-05-09 15:46:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:46:06] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-09 15:46:06] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 15:46:06] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2021-05-09 15:46:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:06] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/196 places, 17/224 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-15 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 s10 0) (EQ s7 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 15 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-15 finished in 123 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620575167442

--------------------
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-09b"
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-09b, 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-162048875200292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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