Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 7 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 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 DBSingleClientW-PT-d1m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654778808136

Running Version 202205111006
[2022-06-09 12:46:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 12:46:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:46:49] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2022-06-09 12:46:49] [INFO ] Transformed 1440 places.
[2022-06-09 12:46:49] [INFO ] Transformed 672 transitions.
[2022-06-09 12:46:49] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1093 places in 11 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 186 place count 241 transition count 398
Iterating global reduction 1 with 85 rules applied. Total rules applied 271 place count 241 transition count 398
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 283 place count 241 transition count 386
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 343 place count 181 transition count 326
Iterating global reduction 2 with 60 rules applied. Total rules applied 403 place count 181 transition count 326
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 408 place count 181 transition count 321
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 436 place count 153 transition count 281
Iterating global reduction 3 with 28 rules applied. Total rules applied 464 place count 153 transition count 281
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 498 place count 153 transition count 247
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 500 place count 151 transition count 244
Iterating global reduction 4 with 2 rules applied. Total rules applied 502 place count 151 transition count 244
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 503 place count 150 transition count 243
Iterating global reduction 4 with 1 rules applied. Total rules applied 504 place count 150 transition count 243
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 505 place count 149 transition count 242
Iterating global reduction 4 with 1 rules applied. Total rules applied 506 place count 149 transition count 242
Applied a total of 506 rules in 74 ms. Remains 149 /347 variables (removed 198) and now considering 242/672 (removed 430) transitions.
// Phase 1: matrix 242 rows 149 cols
[2022-06-09 12:46:49] [INFO ] Computed 2 place invariants in 19 ms
[2022-06-09 12:46:50] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 242 rows 149 cols
[2022-06-09 12:46:50] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 12:46:50] [INFO ] State equation strengthened by 107 read => feed constraints.
[2022-06-09 12:46:50] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 149 cols
[2022-06-09 12:46:50] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 12:46:50] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/347 places, 242/672 transitions.
Finished structural reductions, in 1 iterations. Remains : 149/347 places, 242/672 transitions.
Support contains 32 out of 149 places after structural reductions.
[2022-06-09 12:46:50] [INFO ] Flatten gal took : 46 ms
[2022-06-09 12:46:50] [INFO ] Flatten gal took : 20 ms
[2022-06-09 12:46:50] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 27) seen :3
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 242 rows 149 cols
[2022-06-09 12:46:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:46:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:46:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:46:51] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-06-09 12:46:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:46:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:46:52] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-06-09 12:46:52] [INFO ] State equation strengthened by 107 read => feed constraints.
[2022-06-09 12:46:53] [INFO ] After 811ms SMT Verify possible using 107 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2022-06-09 12:46:54] [INFO ] After 1763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 1593 ms.
[2022-06-09 12:46:56] [INFO ] After 4132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 1 properties in 372 ms.
Support contains 28 out of 149 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 149/149 places, 242/242 transitions.
Graph (complete) has 488 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 148 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 147 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 147 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 147 transition count 235
Applied a total of 8 rules in 31 ms. Remains 147 /149 variables (removed 2) and now considering 235/242 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 147/149 places, 235/242 transitions.
Incomplete random walk after 10000 steps, including 2339 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Finished probabilistic random walk after 8319 steps, run visited all 21 properties in 120 ms. (steps per millisecond=69 )
Probabilistic random walk after 8319 steps, saw 3727 distinct states, run finished after 120 ms. (steps per millisecond=69 ) properties seen :21
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(p0)||X(p2)||p1)))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 133 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 133 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 133 transition count 197
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 49 place count 118 transition count 175
Iterating global reduction 1 with 15 rules applied. Total rules applied 64 place count 118 transition count 175
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 118 transition count 171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 109 transition count 156
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 109 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 109 transition count 155
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 95 place count 101 transition count 141
Iterating global reduction 3 with 8 rules applied. Total rules applied 103 place count 101 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 101 transition count 138
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 112 place count 95 transition count 132
Iterating global reduction 4 with 6 rules applied. Total rules applied 118 place count 95 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 95 transition count 130
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 125 place count 90 transition count 120
Iterating global reduction 5 with 5 rules applied. Total rules applied 130 place count 90 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 131 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 89 transition count 117
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 89 transition count 117
Applied a total of 133 rules in 19 ms. Remains 89 /149 variables (removed 60) and now considering 117/242 (removed 125) transitions.
// Phase 1: matrix 117 rows 89 cols
[2022-06-09 12:46:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:46:57] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 117 rows 89 cols
[2022-06-09 12:46:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:46:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 12:46:57] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 89 cols
[2022-06-09 12:46:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:46:57] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/149 places, 117/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/149 places, 117/242 transitions.
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(OR (AND (GEQ s3 1) (GEQ s34 1)) (AND (GEQ s1 1) (GEQ s62 1))), p2:(AND (GEQ s1 1) (GEQ s84 1) (NOT (AND (GEQ s3 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-00 finished in 663 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U ((G(F(X(p1))) U (X(p0)||p2))||X(p3)))))'
Support contains 6 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 134 transition count 195
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 134 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 134 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 46 place count 120 transition count 174
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 120 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 120 transition count 170
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 113 transition count 160
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 113 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 113 transition count 159
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 85 place count 107 transition count 147
Iterating global reduction 3 with 6 rules applied. Total rules applied 91 place count 107 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 107 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 98 place count 103 transition count 140
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 103 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 106 place count 99 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 99 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 99 transition count 135
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 112 place count 98 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 98 transition count 133
Applied a total of 113 rules in 18 ms. Remains 98 /149 variables (removed 51) and now considering 133/242 (removed 109) transitions.
// Phase 1: matrix 133 rows 98 cols
[2022-06-09 12:46:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:46:58] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 133 rows 98 cols
[2022-06-09 12:46:58] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:46:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 12:46:58] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
// Phase 1: matrix 133 rows 98 cols
[2022-06-09 12:46:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:46:58] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/149 places, 133/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/149 places, 133/242 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s37 1) (GEQ s64 1)), p0:(AND (GEQ s17 1) (GEQ s77 1)), p3:(AND (GEQ s8 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-01 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 132 transition count 196
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 132 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 132 transition count 194
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 52 place count 116 transition count 171
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 116 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 116 transition count 167
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 106 transition count 150
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 106 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 106 transition count 148
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 103 place count 97 transition count 133
Iterating global reduction 3 with 9 rules applied. Total rules applied 112 place count 97 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 97 transition count 131
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 121 place count 90 transition count 124
Iterating global reduction 4 with 7 rules applied. Total rules applied 128 place count 90 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 132 place count 90 transition count 120
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 137 place count 85 transition count 110
Iterating global reduction 5 with 5 rules applied. Total rules applied 142 place count 85 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 143 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 144 place count 84 transition count 107
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 84 transition count 107
Applied a total of 145 rules in 19 ms. Remains 84 /149 variables (removed 65) and now considering 107/242 (removed 135) transitions.
// Phase 1: matrix 107 rows 84 cols
[2022-06-09 12:46:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:46:58] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 107 rows 84 cols
[2022-06-09 12:46:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:46:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 12:46:58] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 84 cols
[2022-06-09 12:46:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:46:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/149 places, 107/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/149 places, 107/242 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-02 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 133 transition count 191
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 133 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 133 transition count 190
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 120 transition count 171
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 120 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 120 transition count 168
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 111 transition count 154
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 111 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 111 transition count 152
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 90 place count 103 transition count 138
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 103 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 103 transition count 136
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 106 place count 97 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 112 place count 97 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 116 place count 97 transition count 126
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 120 place count 93 transition count 117
Iterating global reduction 5 with 4 rules applied. Total rules applied 124 place count 93 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 125 place count 93 transition count 116
Applied a total of 125 rules in 34 ms. Remains 93 /149 variables (removed 56) and now considering 116/242 (removed 126) transitions.
// Phase 1: matrix 116 rows 93 cols
[2022-06-09 12:46:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:46:58] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 116 rows 93 cols
[2022-06-09 12:46:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:46:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:46:58] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2022-06-09 12:46:58] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 116 rows 93 cols
[2022-06-09 12:46:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:46:58] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/149 places, 116/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/149 places, 116/242 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s60 1)), p1:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-04 finished in 653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((G(p1)||F(p2)||p0))))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 134 transition count 197
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 134 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 134 transition count 196
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 120 transition count 175
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 120 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 120 transition count 172
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 112 transition count 159
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 112 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 112 transition count 157
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 87 place count 105 transition count 145
Iterating global reduction 3 with 7 rules applied. Total rules applied 94 place count 105 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 105 transition count 143
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 101 place count 100 transition count 138
Iterating global reduction 4 with 5 rules applied. Total rules applied 106 place count 100 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 110 place count 100 transition count 134
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 113 place count 97 transition count 126
Iterating global reduction 5 with 3 rules applied. Total rules applied 116 place count 97 transition count 126
Applied a total of 116 rules in 34 ms. Remains 97 /149 variables (removed 52) and now considering 126/242 (removed 116) transitions.
// Phase 1: matrix 126 rows 97 cols
[2022-06-09 12:46:59] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:46:59] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 126 rows 97 cols
[2022-06-09 12:46:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:46:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 12:46:59] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-06-09 12:46:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 126 rows 97 cols
[2022-06-09 12:46:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:46:59] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/149 places, 126/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/149 places, 126/242 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s95 1)), p2:(OR (LT s1 1) (LT s60 1)), p0:(OR (LT s1 1) (LT s81 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22837 reset in 221 ms.
Product exploration explored 100000 steps with 22921 reset in 166 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 456 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 512 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 902805 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 902805 steps, saw 346828 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 126 rows 97 cols
[2022-06-09 12:47:04] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:47:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 12:47:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 12:47:04] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 12:47:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:47:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:04] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 12:47:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 12:47:04] [INFO ] After 33ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 12:47:04] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-09 12:47:04] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 97/97 places, 126/126 transitions.
Graph (complete) has 302 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 96 transition count 124
Applied a total of 3 rules in 6 ms. Remains 96 /97 variables (removed 1) and now considering 124/126 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/97 places, 124/126 transitions.
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 720596 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :{}
Probabilistic random walk after 720596 steps, saw 281614 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 124 rows 96 cols
[2022-06-09 12:47:07] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:47:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:07] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 12:47:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:07] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 12:47:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 12:47:07] [INFO ] After 38ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 12:47:07] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-09 12:47:07] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 124/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 124/124 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 124/124 transitions.
Applied a total of 0 rules in 10 ms. Remains 96 /96 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 96 cols
[2022-06-09 12:47:07] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:47:07] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 124 rows 96 cols
[2022-06-09 12:47:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 12:47:08] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-06-09 12:47:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 124 rows 96 cols
[2022-06-09 12:47:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:08] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 124/124 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 96 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 94 transition count 116
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 94 transition count 107
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 28 place count 85 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 84 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 84 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 83 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 83 transition count 105
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 79 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 77 transition count 137
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 77 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 76 transition count 136
Applied a total of 46 rules in 23 ms. Remains 76 /96 variables (removed 20) and now considering 136/124 (removed -12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 136 rows 76 cols
[2022-06-09 12:47:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 12:47:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 12:47:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:08] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 12:47:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 12:47:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:08] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 12:47:08] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-09 12:47:08] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-09 12:47:08] [INFO ] Flatten gal took : 9 ms
[2022-06-09 12:47:08] [INFO ] Flatten gal took : 8 ms
[2022-06-09 12:47:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5706774060082186751.gal : 4 ms
[2022-06-09 12:47:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11914379744438900316.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2519530597986930832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5706774060082186751.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11914379744438900316.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11914379744438900316.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 34
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 59
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :59 after 78
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :78 after 122
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :122 after 213
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :213 after 594
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :594 after 1375
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1375 after 5113
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5113 after 15792
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :15792 after 71262
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :71262 after 227136
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :227136 after 798895
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.67952e+06,7.7305,205348,2,30560,19,470217,8,0,445,797595,0
Total reachable state count : 2679520

Verifying 2 reachability properties.
Reachability property apf2 does not hold.
No reachable states exhibit your property : apf2

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,0,7.74091,205348,1,0,19,470217,8,0,452,797595,0
Reachability property apf4 does not hold.
No reachable states exhibit your property : apf4

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,0,7.74486,205348,1,0,19,470217,8,0,457,797595,0
ITS tools runner thread asked to quit. Dying gracefully.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 (NOT p1) (NOT p2))))
Knowledge based reduction with 11 factoid took 296 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-05 finished in 17141 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U ((p0 U p1)&&G(F(X(p2))))))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 132 transition count 190
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 132 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 132 transition count 188
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 117 transition count 169
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 117 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 69 place count 117 transition count 166
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 77 place count 109 transition count 154
Iterating global reduction 2 with 8 rules applied. Total rules applied 85 place count 109 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 109 transition count 152
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 94 place count 102 transition count 139
Iterating global reduction 3 with 7 rules applied. Total rules applied 101 place count 102 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 102 transition count 138
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 108 place count 96 transition count 132
Iterating global reduction 4 with 6 rules applied. Total rules applied 114 place count 96 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 96 transition count 130
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 121 place count 91 transition count 120
Iterating global reduction 5 with 5 rules applied. Total rules applied 126 place count 91 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 91 transition count 119
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 128 place count 90 transition count 117
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 90 transition count 117
Applied a total of 129 rules in 13 ms. Remains 90 /149 variables (removed 59) and now considering 117/242 (removed 125) transitions.
// Phase 1: matrix 117 rows 90 cols
[2022-06-09 12:47:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:16] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 117 rows 90 cols
[2022-06-09 12:47:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:16] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 12:47:16] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 90 cols
[2022-06-09 12:47:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:16] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/149 places, 117/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/149 places, 117/242 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p1), (NOT p2), (NOT p2), p0, true, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s74 1)), p0:(AND (GEQ s31 1) (GEQ s57 1)), p2:(OR (AND (GEQ s1 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s89 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-06 finished in 568 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 132 transition count 191
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 132 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 132 transition count 189
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 117 transition count 168
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 117 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 117 transition count 166
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 107 transition count 149
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 107 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 107 transition count 147
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 99 place count 98 transition count 132
Iterating global reduction 3 with 9 rules applied. Total rules applied 108 place count 98 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 98 transition count 130
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 117 place count 91 transition count 123
Iterating global reduction 4 with 7 rules applied. Total rules applied 124 place count 91 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 128 place count 91 transition count 119
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 133 place count 86 transition count 109
Iterating global reduction 5 with 5 rules applied. Total rules applied 138 place count 86 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 139 place count 86 transition count 108
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 85 transition count 106
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 85 transition count 106
Applied a total of 141 rules in 27 ms. Remains 85 /149 variables (removed 64) and now considering 106/242 (removed 136) transitions.
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 12:47:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:47:17] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 12:47:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:47:17] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 12:47:17] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2022-06-09 12:47:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 12:47:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:47:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/149 places, 106/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/149 places, 106/242 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s77 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 22943 reset in 255 ms.
Product exploration explored 100000 steps with 22997 reset in 143 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 514 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16108 steps, run visited all 1 properties in 21 ms. (steps per millisecond=767 )
Probabilistic random walk after 16108 steps, saw 7679 distinct states, run finished after 21 ms. (steps per millisecond=767 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 12:47:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:47:18] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 12:47:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:47:18] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 12:47:18] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-06-09 12:47:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 12:47:18] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 12:47:18] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 106/106 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16108 steps, run visited all 1 properties in 21 ms. (steps per millisecond=767 )
Probabilistic random walk after 16108 steps, saw 7679 distinct states, run finished after 21 ms. (steps per millisecond=767 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22968 reset in 100 ms.
Product exploration explored 100000 steps with 22900 reset in 113 ms.
Built C files in :
/tmp/ltsmin1793913755423041149
[2022-06-09 12:47:18] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2022-06-09 12:47:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:47:18] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2022-06-09 12:47:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:47:18] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2022-06-09 12:47:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:47:18] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1793913755423041149
Running compilation step : cd /tmp/ltsmin1793913755423041149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 379 ms.
Running link step : cd /tmp/ltsmin1793913755423041149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1793913755423041149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16246543550362566953.hoa' '--buchi-type=spotba'
LTSmin run took 81 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-08 finished in 2458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!X(F(!p0)) U p1))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 133 transition count 198
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 133 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 133 transition count 196
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 48 place count 119 transition count 175
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 119 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 119 transition count 172
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 111 transition count 158
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 111 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 111 transition count 157
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 89 place count 104 transition count 145
Iterating global reduction 3 with 7 rules applied. Total rules applied 96 place count 104 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 104 transition count 144
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 103 place count 98 transition count 138
Iterating global reduction 4 with 6 rules applied. Total rules applied 109 place count 98 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 111 place count 98 transition count 136
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 116 place count 93 transition count 126
Iterating global reduction 5 with 5 rules applied. Total rules applied 121 place count 93 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 122 place count 93 transition count 125
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 123 place count 92 transition count 123
Iterating global reduction 6 with 1 rules applied. Total rules applied 124 place count 92 transition count 123
Applied a total of 124 rules in 13 ms. Remains 92 /149 variables (removed 57) and now considering 123/242 (removed 119) transitions.
// Phase 1: matrix 123 rows 92 cols
[2022-06-09 12:47:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:47:19] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 123 rows 92 cols
[2022-06-09 12:47:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:19] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 12:47:19] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 92 cols
[2022-06-09 12:47:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:19] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/149 places, 123/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/149 places, 123/242 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, p0, p1, (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s1 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-10 finished in 1010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(X(p0)))||(X(p1)&&p2)))))'
Support contains 6 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 133 transition count 195
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 133 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 133 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 48 place count 119 transition count 172
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 119 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 119 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 110 transition count 154
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 110 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 110 transition count 152
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 102 transition count 141
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 102 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 102 transition count 139
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 108 place count 96 transition count 133
Iterating global reduction 4 with 6 rules applied. Total rules applied 114 place count 96 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 118 place count 96 transition count 129
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 121 place count 93 transition count 126
Iterating global reduction 5 with 3 rules applied. Total rules applied 124 place count 93 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 125 place count 93 transition count 125
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 126 place count 92 transition count 123
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 92 transition count 123
Applied a total of 127 rules in 14 ms. Remains 92 /149 variables (removed 57) and now considering 123/242 (removed 119) transitions.
// Phase 1: matrix 123 rows 92 cols
[2022-06-09 12:47:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:20] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 123 rows 92 cols
[2022-06-09 12:47:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 12:47:20] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 92 cols
[2022-06-09 12:47:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:20] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/149 places, 123/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/149 places, 123/242 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p2:(OR (LT s13 1) (LT s35 1)), p1:(AND (GEQ s18 1) (GEQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-11 finished in 396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(X((G(p1)&&p0))) U p2)))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 242/242 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 134 transition count 200
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 134 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 134 transition count 198
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 122 transition count 179
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 122 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 122 transition count 176
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 66 place count 115 transition count 165
Iterating global reduction 2 with 7 rules applied. Total rules applied 73 place count 115 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 115 transition count 163
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 109 transition count 155
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 109 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 109 transition count 153
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 93 place count 105 transition count 149
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 105 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 105 transition count 147
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 102 place count 102 transition count 139
Iterating global reduction 5 with 3 rules applied. Total rules applied 105 place count 102 transition count 139
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 106 place count 101 transition count 137
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 101 transition count 137
Applied a total of 107 rules in 12 ms. Remains 101 /149 variables (removed 48) and now considering 137/242 (removed 105) transitions.
// Phase 1: matrix 137 rows 101 cols
[2022-06-09 12:47:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:20] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 137 rows 101 cols
[2022-06-09 12:47:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:47:21] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-09 12:47:21] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 101 cols
[2022-06-09 12:47:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:21] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/149 places, 137/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/149 places, 137/242 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, p1, (AND p1 p0), p2, p2, (AND p1 p0 p2), (AND p1 p0 p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=(AND p2 p0 p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s97 1)), p0:(AND (GEQ s1 1) (GEQ s92 1)), p2:(AND (NOT (AND (GEQ s1 1) (GEQ s92 1))) (GEQ s1 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28532 reset in 142 ms.
Product exploration explored 100000 steps with 28598 reset in 157 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 7 states, 10 edges and 3 AP to 6 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 217 ms :[p1, (AND p1 p0), (AND p1 p0 p2), (AND p1 p0 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2360403 steps, run timeout after 3001 ms. (steps per millisecond=786 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 2360403 steps, saw 882224 distinct states, run finished after 3001 ms. (steps per millisecond=786 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 137 rows 101 cols
[2022-06-09 12:47:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:47:25] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), true, (G (NOT (AND p1 p0 p2)))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F p1), (F (AND p1 p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 p0 p2)))
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 6 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-14 finished in 4691 ms.
All properties solved by simple procedures.
Total runtime 36297 ms.

BK_STOP 1654778845655

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m08"
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 DBSingleClientW-PT-d1m08, 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 r312-tall-165472281900220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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