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-162048875200293.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875200293
=====================================================================

--------------------
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 1620575149249

Running Version 0
[2021-05-09 15:45:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 15:45:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:45:51] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-09 15:45:51] [INFO ] Transformed 268 places.
[2021-05-09 15:45:51] [INFO ] Transformed 284 transitions.
[2021-05-09 15:45:51] [INFO ] Found NUPN structural information;
[2021-05-09 15:45:51] [INFO ] Parsed PT model containing 268 places and 284 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:45:51] [INFO ] Initial state test concluded for 5 properties.
FORMULA DiscoveryGPU-PT-09b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 284/284 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 250 transition count 284
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 57 place count 211 transition count 245
Iterating global reduction 1 with 39 rules applied. Total rules applied 96 place count 211 transition count 245
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 204 transition count 238
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 204 transition count 238
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 198 transition count 232
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 198 transition count 232
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 195 transition count 229
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 195 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 194 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 194 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 193 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 193 transition count 226
Applied a total of 132 rules in 80 ms. Remains 193 /268 variables (removed 75) and now considering 226/284 (removed 58) transitions.
// Phase 1: matrix 226 rows 193 cols
[2021-05-09 15:45:51] [INFO ] Computed 2 place invariants in 16 ms
[2021-05-09 15:45:51] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 226 rows 193 cols
[2021-05-09 15:45:51] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 15:45:51] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
// Phase 1: matrix 226 rows 193 cols
[2021-05-09 15:45:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:51] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/268 places, 226/284 transitions.
[2021-05-09 15:45:51] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 15:45:51] [INFO ] Flatten gal took : 46 ms
FORMULA DiscoveryGPU-PT-09b-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:45:51] [INFO ] Flatten gal took : 21 ms
[2021-05-09 15:45:51] [INFO ] Input system was already deterministic with 226 transitions.
Incomplete random walk after 100000 steps, including 338 resets, run finished after 336 ms. (steps per millisecond=297 ) properties (out of 24) seen :22
Running SMT prover for 2 properties.
// Phase 1: matrix 226 rows 193 cols
[2021-05-09 15:45:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 15:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:45:52] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
[2021-05-09 15:45:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DiscoveryGPU-PT-09b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 192 transition count 192
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 159 transition count 192
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 66 place count 159 transition count 163
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 124 place count 130 transition count 163
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 132 place count 122 transition count 154
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 122 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 140 place count 122 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 121 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 146 place count 117 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 117 transition count 149
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 114 transition count 144
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 114 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 159 place count 111 transition count 140
Iterating global reduction 2 with 3 rules applied. Total rules applied 162 place count 111 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 110 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 110 transition count 139
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 250 place count 67 transition count 96
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 257 place count 60 transition count 83
Iterating global reduction 2 with 7 rules applied. Total rules applied 264 place count 60 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 271 place count 53 transition count 74
Iterating global reduction 2 with 7 rules applied. Total rules applied 278 place count 53 transition count 74
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 285 place count 46 transition count 61
Iterating global reduction 2 with 7 rules applied. Total rules applied 292 place count 46 transition count 61
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 299 place count 39 transition count 53
Iterating global reduction 2 with 7 rules applied. Total rules applied 306 place count 39 transition count 53
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 313 place count 32 transition count 40
Iterating global reduction 2 with 7 rules applied. Total rules applied 320 place count 32 transition count 40
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 327 place count 25 transition count 32
Iterating global reduction 2 with 7 rules applied. Total rules applied 334 place count 25 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 23 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 22 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 341 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 21 transition count 26
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 350 place count 19 transition count 20
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 356 place count 13 transition count 20
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 368 place count 7 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 370 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 6 transition count 11
Applied a total of 371 rules in 61 ms. Remains 6 /193 variables (removed 187) and now considering 11/226 (removed 215) transitions.
[2021-05-09 15:45:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 15:45:52] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:45:52] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 15:45:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 15:45:52] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:45:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:45:52] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-09 15:45:52] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:45:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 15:45:52] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:45:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/193 places, 11/226 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 54 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-00 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((G(F(p0)) U (F(p0)&&p1))||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 181 transition count 214
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 181 transition count 214
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 174 transition count 206
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 174 transition count 206
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 168 transition count 197
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 168 transition count 197
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 162 transition count 190
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 162 transition count 190
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 157 transition count 184
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 157 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 155 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 155 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 154 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 154 transition count 181
Applied a total of 78 rules in 25 ms. Remains 154 /193 variables (removed 39) and now considering 181/226 (removed 45) transitions.
// Phase 1: matrix 181 rows 154 cols
[2021-05-09 15:45:52] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 15:45:52] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 181 rows 154 cols
[2021-05-09 15:45:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:52] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 181 rows 154 cols
[2021-05-09 15:45:52] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:45:52] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/193 places, 181/226 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Running random walk in product with property : DiscoveryGPU-PT-09b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s53 1) (EQ s150 1)), p0:(EQ s33 1), p2:(EQ s129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15380 reset in 267 ms.
Product exploration explored 100000 steps with 15430 reset in 181 ms.
Graph (complete) has 310 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 15409 reset in 134 ms.
Product exploration explored 100000 steps with 15289 reset in 144 ms.
Applying partial POR strategy [true, true, true, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 4 out of 154 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 154/154 places, 181/181 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 154 transition count 181
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 18 place count 154 transition count 193
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 154 transition count 193
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 70 place count 154 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 153 transition count 201
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 153 transition count 201
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 153 transition count 239
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 97 place count 146 transition count 225
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 104 place count 146 transition count 225
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 124 place count 126 transition count 191
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 144 place count 126 transition count 191
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 162 place count 108 transition count 161
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 180 place count 108 transition count 161
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 186 place count 102 transition count 149
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 192 place count 102 transition count 149
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 203 place count 91 transition count 133
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 214 place count 91 transition count 133
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 234 place count 71 transition count 103
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 254 place count 71 transition count 103
Deduced a syphon composed of 40 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 258 place count 71 transition count 99
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 258 rules in 33 ms. Remains 71 /154 variables (removed 83) and now considering 99/181 (removed 82) transitions.
[2021-05-09 15:45:54] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 15:45:54] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
// Phase 1: matrix 95 rows 71 cols
[2021-05-09 15:45:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:54] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 71/154 places, 99/181 transitions.
Product exploration explored 100000 steps with 15437 reset in 325 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA DiscoveryGPU-PT-09b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-01 finished in 2252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0 U p1)||((X(p3)&&p2) U p4)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 182 transition count 215
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 182 transition count 215
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 175 transition count 206
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 175 transition count 206
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 169 transition count 197
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 169 transition count 197
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 163 transition count 190
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 163 transition count 190
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 159 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 159 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 158 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 158 transition count 185
Applied a total of 70 rules in 20 ms. Remains 158 /193 variables (removed 35) and now considering 185/226 (removed 41) transitions.
// Phase 1: matrix 185 rows 158 cols
[2021-05-09 15:45:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:55] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 185 rows 158 cols
[2021-05-09 15:45:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:55] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 158 cols
[2021-05-09 15:45:55] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 15:45:55] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/193 places, 185/226 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : DiscoveryGPU-PT-09b-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0 p4 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p4) p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) p4 (NOT p3)) (AND (NOT p1) (NOT p0) p2 (NOT p3))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p4) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(OR (AND (NOT p1) p0 p4 (NOT p3)) (AND (NOT p1) p0 p2 (NOT p3))), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND p1 (NOT p4) (NOT p2)) (AND p0 (NOT p4) (NOT p2)) (AND p4 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p4) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p4) p2 p3) (AND p0 (NOT p4) p2 p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) (NOT p0) p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p4) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p1) p0 p4) (AND (NOT p1) p0 p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s28 1) (EQ s154 1)), p0:(EQ s91 1), p4:(EQ s18 1), p2:(AND (EQ s28 1) (EQ s154 1)), p3:(NEQ s129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-03 finished in 457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 181 transition count 214
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 181 transition count 214
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 173 transition count 204
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 173 transition count 204
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 166 transition count 194
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 166 transition count 194
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 159 transition count 186
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 159 transition count 186
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 154 transition count 180
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 152 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 151 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 151 transition count 177
Applied a total of 84 rules in 25 ms. Remains 151 /193 variables (removed 42) and now considering 177/226 (removed 49) transitions.
// Phase 1: matrix 177 rows 151 cols
[2021-05-09 15:45:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:55] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 177 rows 151 cols
[2021-05-09 15:45:55] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:45:55] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 177 rows 151 cols
[2021-05-09 15:45:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:55] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 151/193 places, 177/226 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-05 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s146 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 37 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 312 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 192 transition count 193
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 160 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 159 transition count 192
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 66 place count 159 transition count 163
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 124 place count 130 transition count 163
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 133 place count 121 transition count 153
Iterating global reduction 3 with 9 rules applied. Total rules applied 142 place count 121 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 142 place count 121 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 144 place count 120 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 149 place count 115 transition count 147
Iterating global reduction 3 with 5 rules applied. Total rules applied 154 place count 115 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 111 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 111 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 166 place count 107 transition count 135
Iterating global reduction 3 with 4 rules applied. Total rules applied 170 place count 107 transition count 135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 106 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 106 transition count 134
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 254 place count 65 transition count 93
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 261 place count 58 transition count 80
Iterating global reduction 3 with 7 rules applied. Total rules applied 268 place count 58 transition count 80
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 275 place count 51 transition count 71
Iterating global reduction 3 with 7 rules applied. Total rules applied 282 place count 51 transition count 71
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 289 place count 44 transition count 58
Iterating global reduction 3 with 7 rules applied. Total rules applied 296 place count 44 transition count 58
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 303 place count 37 transition count 50
Iterating global reduction 3 with 7 rules applied. Total rules applied 310 place count 37 transition count 50
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 317 place count 30 transition count 37
Iterating global reduction 3 with 7 rules applied. Total rules applied 324 place count 30 transition count 37
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 331 place count 23 transition count 29
Iterating global reduction 3 with 7 rules applied. Total rules applied 338 place count 23 transition count 29
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 340 place count 21 transition count 26
Iterating global reduction 3 with 2 rules applied. Total rules applied 342 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 343 place count 20 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 344 place count 20 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 345 place count 20 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 346 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 8 rules applied. Total rules applied 354 place count 17 transition count 17
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 360 place count 11 transition count 17
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 370 place count 6 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 371 place count 6 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 372 place count 5 transition count 10
Applied a total of 372 rules in 28 ms. Remains 5 /193 variables (removed 188) and now considering 10/226 (removed 216) transitions.
[2021-05-09 15:45:55] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2021-05-09 15:45:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:45:55] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 15:45:55] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2021-05-09 15:45:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:45:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:45:55] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-09 15:45:55] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:45:55] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2021-05-09 15:45:55] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:45:55] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/193 places, 10/226 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s4 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-09b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-07 finished in 124 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 182 transition count 215
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 182 transition count 215
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 176 transition count 209
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 176 transition count 209
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 171 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 171 transition count 201
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 166 transition count 195
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 166 transition count 195
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 161 transition count 189
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 161 transition count 189
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 159 transition count 187
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 159 transition count 187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 158 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 158 transition count 186
Applied a total of 70 rules in 11 ms. Remains 158 /193 variables (removed 35) and now considering 186/226 (removed 40) transitions.
// Phase 1: matrix 186 rows 158 cols
[2021-05-09 15:45:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:55] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 186 rows 158 cols
[2021-05-09 15:45:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 186 rows 158 cols
[2021-05-09 15:45:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:56] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/193 places, 186/226 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09b-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s79 1), p0:(EQ s33 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 281 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-08 finished in 289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (((!p3&&F(G(p4)))||p2)&&p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 192 transition count 194
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 161 transition count 194
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 62 place count 161 transition count 167
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 116 place count 134 transition count 167
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 123 place count 127 transition count 159
Iterating global reduction 2 with 7 rules applied. Total rules applied 130 place count 127 transition count 159
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 134 place count 123 transition count 155
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 123 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 121 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 121 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 119 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 119 transition count 149
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 232 place count 76 transition count 106
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 238 place count 70 transition count 95
Iterating global reduction 2 with 6 rules applied. Total rules applied 244 place count 70 transition count 95
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 250 place count 64 transition count 87
Iterating global reduction 2 with 6 rules applied. Total rules applied 256 place count 64 transition count 87
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 262 place count 58 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 268 place count 58 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 273 place count 53 transition count 70
Iterating global reduction 2 with 5 rules applied. Total rules applied 278 place count 53 transition count 70
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 283 place count 48 transition count 61
Iterating global reduction 2 with 5 rules applied. Total rules applied 288 place count 48 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 293 place count 43 transition count 55
Iterating global reduction 2 with 5 rules applied. Total rules applied 298 place count 43 transition count 55
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 300 place count 41 transition count 52
Iterating global reduction 2 with 2 rules applied. Total rules applied 302 place count 41 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 40 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 40 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 305 place count 39 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 306 place count 38 transition count 49
Applied a total of 306 rules in 28 ms. Remains 38 /193 variables (removed 155) and now considering 49/226 (removed 177) transitions.
[2021-05-09 15:45:56] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 38 cols
[2021-05-09 15:45:56] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:56] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 15:45:56] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 38 cols
[2021-05-09 15:45:56] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:45:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-09 15:45:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:45:56] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 38 cols
[2021-05-09 15:45:56] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/193 places, 49/226 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true, (NOT p4), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p4)))]
Running random walk in product with property : DiscoveryGPU-PT-09b-10 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p3 p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) p3 (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p4), acceptance={0} source=2 dest: 2}, { cond=p4, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p4) p0) (AND (NOT p2) (NOT p4) p0)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p1) p4 p0) (AND (NOT p2) p4 p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s27 1) (EQ s35 1)), p0:(EQ s17 0), p2:(OR (EQ s9 0) (EQ s37 0)), p3:(NEQ s17 1), p4:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-10 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 192 transition count 193
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 160 transition count 193
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 64 place count 160 transition count 164
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 122 place count 131 transition count 164
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 131 place count 122 transition count 154
Iterating global reduction 2 with 9 rules applied. Total rules applied 140 place count 122 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 140 place count 122 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 121 transition count 153
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 147 place count 116 transition count 148
Iterating global reduction 2 with 5 rules applied. Total rules applied 152 place count 116 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 156 place count 112 transition count 141
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 112 transition count 141
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 108 transition count 136
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 108 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 107 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 107 transition count 135
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 252 place count 66 transition count 94
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 260 place count 58 transition count 79
Iterating global reduction 2 with 8 rules applied. Total rules applied 268 place count 58 transition count 79
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 276 place count 50 transition count 69
Iterating global reduction 2 with 8 rules applied. Total rules applied 284 place count 50 transition count 69
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 292 place count 42 transition count 54
Iterating global reduction 2 with 8 rules applied. Total rules applied 300 place count 42 transition count 54
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 308 place count 34 transition count 45
Iterating global reduction 2 with 8 rules applied. Total rules applied 316 place count 34 transition count 45
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 323 place count 27 transition count 32
Iterating global reduction 2 with 7 rules applied. Total rules applied 330 place count 27 transition count 32
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 337 place count 20 transition count 24
Iterating global reduction 2 with 7 rules applied. Total rules applied 344 place count 20 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 346 place count 18 transition count 21
Iterating global reduction 2 with 2 rules applied. Total rules applied 348 place count 18 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 349 place count 17 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 350 place count 17 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 17 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 352 place count 17 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 16 transition count 18
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 359 place count 14 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 363 place count 10 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 363 place count 10 transition count 13
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 365 place count 9 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 369 place count 7 transition count 11
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 371 place count 6 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 373 place count 5 transition count 9
Applied a total of 373 rules in 18 ms. Remains 5 /193 variables (removed 188) and now considering 9/226 (removed 217) transitions.
[2021-05-09 15:45:56] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:45:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:45:56] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 15:45:56] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:45:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:45:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:45:56] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-09 15:45:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:45:56] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:45:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:45:56] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/193 places, 9/226 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-11 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:(NEQ s3 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 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-11 finished in 86 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 180 transition count 213
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 180 transition count 213
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 173 transition count 204
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 173 transition count 204
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 166 transition count 194
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 166 transition count 194
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 159 transition count 186
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 159 transition count 186
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 154 transition count 180
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 152 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 151 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 151 transition count 177
Applied a total of 84 rules in 11 ms. Remains 151 /193 variables (removed 42) and now considering 177/226 (removed 49) transitions.
// Phase 1: matrix 177 rows 151 cols
[2021-05-09 15:45:56] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:56] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 177 rows 151 cols
[2021-05-09 15:45:56] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:45:56] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 177 rows 151 cols
[2021-05-09 15:45:56] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:45:56] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 151/193 places, 177/226 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s147 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]]
Product exploration explored 100000 steps with 12542 reset in 127 ms.
Product exploration explored 100000 steps with 12599 reset in 148 ms.
Graph (complete) has 304 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12557 reset in 152 ms.
Product exploration explored 100000 steps with 12517 reset in 119 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 151 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 151/151 places, 177/177 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 151 transition count 177
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 151 transition count 261
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 49 place count 151 transition count 261
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 151 transition count 261
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 89 place count 151 transition count 355
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 97 place count 143 transition count 323
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 105 place count 143 transition count 323
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 129 place count 119 transition count 259
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 153 place count 119 transition count 259
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 177 place count 95 transition count 203
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 201 place count 95 transition count 203
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 209 place count 87 transition count 187
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 217 place count 87 transition count 187
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 233 place count 71 transition count 147
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 249 place count 71 transition count 147
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 281 place count 39 transition count 67
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 313 place count 39 transition count 67
Deduced a syphon composed of 25 places in 0 ms
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 323 place count 39 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 324 place count 38 transition count 55
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 325 place count 38 transition count 55
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 325 rules in 18 ms. Remains 38 /151 variables (removed 113) and now considering 55/177 (removed 122) transitions.
[2021-05-09 15:45:57] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 15:45:57] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
// Phase 1: matrix 53 rows 38 cols
[2021-05-09 15:45:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:45:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/151 places, 55/177 transitions.
Product exploration explored 100000 steps with 18620 reset in 308 ms.
Product exploration explored 100000 steps with 18611 reset in 303 ms.
[2021-05-09 15:45:58] [INFO ] Flatten gal took : 9 ms
[2021-05-09 15:45:58] [INFO ] Flatten gal took : 9 ms
[2021-05-09 15:45:58] [INFO ] Time to serialize gal into /tmp/LTL16310418762741875230.gal : 5 ms
[2021-05-09 15:45:58] [INFO ] Time to serialize properties into /tmp/LTL3993296127410742128.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/LTL16310418762741875230.gal, -t, CGAL, -LTL, /tmp/LTL3993296127410742128.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/LTL16310418762741875230.gal -t CGAL -LTL /tmp/LTL3993296127410742128.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p261==1)")))))
Formula 0 simplified : !XXF"(p261==1)"
Detected timeout of ITS tools.
[2021-05-09 15:46:13] [INFO ] Flatten gal took : 9 ms
[2021-05-09 15:46:13] [INFO ] Applying decomposition
[2021-05-09 15:46:13] [INFO ] Flatten gal took : 9 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/graph6829618159836863143.txt, -o, /tmp/graph6829618159836863143.bin, -w, /tmp/graph6829618159836863143.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/graph6829618159836863143.bin, -l, -1, -v, -w, /tmp/graph6829618159836863143.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:46:13] [INFO ] Decomposing Gal with order
[2021-05-09 15:46:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:46:13] [INFO ] Removed a total of 69 redundant transitions.
[2021-05-09 15:46:13] [INFO ] Flatten gal took : 112 ms
[2021-05-09 15:46:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 5 ms.
[2021-05-09 15:46:13] [INFO ] Time to serialize gal into /tmp/LTL1960861548938106481.gal : 15 ms
[2021-05-09 15:46:13] [INFO ] Time to serialize properties into /tmp/LTL16231370716806263210.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1960861548938106481.gal, -t, CGAL, -LTL, /tmp/LTL16231370716806263210.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/LTL1960861548938106481.gal -t CGAL -LTL /tmp/LTL16231370716806263210.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i16.u52.p261==1)")))))
Formula 0 simplified : !XXF"(i16.u52.p261==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2066852181000647296
[2021-05-09 15:46:28] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2066852181000647296
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/ltsmin2066852181000647296]
Compilation finished in 852 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2066852181000647296]
Link finished in 47 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(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2066852181000647296]
LTSmin run took 1875 ms.
FORMULA DiscoveryGPU-PT-09b-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-09b-12 finished in 35029 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 192 transition count 194
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 161 transition count 194
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 62 place count 161 transition count 164
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 122 place count 131 transition count 164
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 123 transition count 155
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 123 transition count 155
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 143 place count 118 transition count 150
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 118 transition count 150
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 152 place count 114 transition count 143
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 114 transition count 143
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 160 place count 110 transition count 138
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 110 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 109 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 109 transition count 137
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 252 place count 66 transition count 94
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 260 place count 58 transition count 79
Iterating global reduction 2 with 8 rules applied. Total rules applied 268 place count 58 transition count 79
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 276 place count 50 transition count 69
Iterating global reduction 2 with 8 rules applied. Total rules applied 284 place count 50 transition count 69
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 292 place count 42 transition count 54
Iterating global reduction 2 with 8 rules applied. Total rules applied 300 place count 42 transition count 54
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 308 place count 34 transition count 45
Iterating global reduction 2 with 8 rules applied. Total rules applied 316 place count 34 transition count 45
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 324 place count 26 transition count 30
Iterating global reduction 2 with 8 rules applied. Total rules applied 332 place count 26 transition count 30
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 340 place count 18 transition count 21
Iterating global reduction 2 with 8 rules applied. Total rules applied 348 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 350 place count 16 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 352 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 353 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 354 place count 15 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 15 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 356 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 358 place count 13 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 359 place count 12 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 359 place count 12 transition count 12
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 363 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 364 place count 9 transition count 11
Applied a total of 364 rules in 20 ms. Remains 9 /193 variables (removed 184) and now considering 11/226 (removed 215) transitions.
[2021-05-09 15:46:31] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 15:46:31] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-09 15:46:31] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 15:46:31] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 15:46:31] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-09 15:46:31] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 15:46:31] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 15:46:31] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:31] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/193 places, 11/226 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1821 reset in 98 ms.
Product exploration explored 100000 steps with 1819 reset in 114 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1828 reset in 102 ms.
Product exploration explored 100000 steps with 1824 reset in 89 ms.
[2021-05-09 15:46:32] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:46:32] [INFO ] Flatten gal took : 0 ms
[2021-05-09 15:46:32] [INFO ] Time to serialize gal into /tmp/LTL15922701152647731742.gal : 0 ms
[2021-05-09 15:46:32] [INFO ] Time to serialize properties into /tmp/LTL8388138543488924675.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/LTL15922701152647731742.gal, -t, CGAL, -LTL, /tmp/LTL8388138543488924675.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/LTL15922701152647731742.gal -t CGAL -LTL /tmp/LTL8388138543488924675.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p260!=1)"))))
Formula 0 simplified : !FG"(p260!=1)"
Reverse transition relation is NOT exact ! Due to transitions t6, t3.t160.t146.t3.t172.t148.t2.t217.t224.t9.t10, t3.t161.t218.t141.t224.t9.t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/8/3/11
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.073434,18248,1,0,167,10186,50,178,282,15685,384
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09b-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-09b-14 finished in 680 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 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 226/226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 192 transition count 193
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 160 transition count 193
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 64 place count 160 transition count 165
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 120 place count 132 transition count 165
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 129 place count 123 transition count 155
Iterating global reduction 2 with 9 rules applied. Total rules applied 138 place count 123 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 138 place count 123 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 122 transition count 154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 117 transition count 149
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 117 transition count 149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 154 place count 113 transition count 142
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 113 transition count 142
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 162 place count 109 transition count 137
Iterating global reduction 2 with 4 rules applied. Total rules applied 166 place count 109 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 108 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 108 transition count 136
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 252 place count 66 transition count 94
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 260 place count 58 transition count 79
Iterating global reduction 2 with 8 rules applied. Total rules applied 268 place count 58 transition count 79
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 276 place count 50 transition count 69
Iterating global reduction 2 with 8 rules applied. Total rules applied 284 place count 50 transition count 69
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 292 place count 42 transition count 54
Iterating global reduction 2 with 8 rules applied. Total rules applied 300 place count 42 transition count 54
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 307 place count 35 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 314 place count 35 transition count 46
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 321 place count 28 transition count 33
Iterating global reduction 2 with 7 rules applied. Total rules applied 328 place count 28 transition count 33
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 335 place count 21 transition count 25
Iterating global reduction 2 with 7 rules applied. Total rules applied 342 place count 21 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 344 place count 19 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 346 place count 19 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 347 place count 18 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 18 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 351 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 15 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 358 place count 12 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 360 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 361 place count 10 transition count 15
Applied a total of 361 rules in 22 ms. Remains 10 /193 variables (removed 183) and now considering 15/226 (removed 211) transitions.
[2021-05-09 15:46:32] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 15:46:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:32] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 15:46:32] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 15:46:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:46:32] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-09 15:46:32] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:46:32] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 15:46:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:46:32] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/193 places, 15/226 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s9 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-09b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-15 finished in 121 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620575193102

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-09b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-09b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875200293"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;