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-165472282000284.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-d2m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282000284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Jun 7 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 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 1.6M 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-d2m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654787893909

Running Version 202205111006
[2022-06-09 15:18:15] [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 15:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 15:18:15] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2022-06-09 15:18:15] [INFO ] Transformed 4763 places.
[2022-06-09 15:18:15] [INFO ] Transformed 2478 transitions.
[2022-06-09 15:18:15] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 367 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 378 places :
Symmetric choice reduction at 1 with 378 rule applications. Total rules 623 place count 759 transition count 1434
Iterating global reduction 1 with 378 rules applied. Total rules applied 1001 place count 759 transition count 1434
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1046 place count 759 transition count 1389
Discarding 299 places :
Symmetric choice reduction at 2 with 299 rule applications. Total rules 1345 place count 460 transition count 1090
Iterating global reduction 2 with 299 rules applied. Total rules applied 1644 place count 460 transition count 1090
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1654 place count 460 transition count 1080
Discarding 221 places :
Symmetric choice reduction at 3 with 221 rule applications. Total rules 1875 place count 239 transition count 777
Iterating global reduction 3 with 221 rules applied. Total rules applied 2096 place count 239 transition count 777
Ensure Unique test removed 285 transitions
Reduce isomorphic transitions removed 285 transitions.
Iterating post reduction 3 with 285 rules applied. Total rules applied 2381 place count 239 transition count 492
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 2395 place count 225 transition count 469
Iterating global reduction 4 with 14 rules applied. Total rules applied 2409 place count 225 transition count 469
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2429 place count 225 transition count 449
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 2434 place count 220 transition count 444
Iterating global reduction 5 with 5 rules applied. Total rules applied 2439 place count 220 transition count 444
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 2444 place count 215 transition count 439
Iterating global reduction 5 with 5 rules applied. Total rules applied 2449 place count 215 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2453 place count 215 transition count 435
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2454 place count 214 transition count 433
Iterating global reduction 6 with 1 rules applied. Total rules applied 2455 place count 214 transition count 433
Applied a total of 2455 rules in 195 ms. Remains 214 /1183 variables (removed 969) and now considering 433/2478 (removed 2045) transitions.
// Phase 1: matrix 433 rows 214 cols
[2022-06-09 15:18:15] [INFO ] Computed 2 place invariants in 24 ms
[2022-06-09 15:18:16] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 433 rows 214 cols
[2022-06-09 15:18:16] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:18:16] [INFO ] State equation strengthened by 222 read => feed constraints.
[2022-06-09 15:18:16] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
// Phase 1: matrix 433 rows 214 cols
[2022-06-09 15:18:16] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 15:18:16] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 214/1183 places, 433/2478 transitions.
Finished structural reductions, in 1 iterations. Remains : 214/1183 places, 433/2478 transitions.
Support contains 35 out of 214 places after structural reductions.
[2022-06-09 15:18:17] [INFO ] Flatten gal took : 58 ms
[2022-06-09 15:18:17] [INFO ] Flatten gal took : 30 ms
[2022-06-09 15:18:17] [INFO ] Input system was already deterministic with 433 transitions.
Support contains 34 out of 214 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2349 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 29) 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 29) 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 29) seen :0
Interrupted probabilistic random walk after 578533 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{0=1, 1=1, 2=1, 4=1, 5=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1}
Probabilistic random walk after 578533 steps, saw 234402 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :27
Running SMT prover for 2 properties.
// Phase 1: matrix 433 rows 214 cols
[2022-06-09 15:18:21] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 15:18:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 15:18:21] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((G(F(p0))&&F((X(G(p2))&&p1))))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 190 transition count 334
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 190 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 190 transition count 331
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 172 transition count 305
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 172 transition count 305
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 97 place count 172 transition count 295
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 159 transition count 277
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 159 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 129 place count 159 transition count 271
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 141 place count 147 transition count 236
Iterating global reduction 3 with 12 rules applied. Total rules applied 153 place count 147 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 156 place count 147 transition count 233
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 163 place count 140 transition count 226
Iterating global reduction 4 with 7 rules applied. Total rules applied 170 place count 140 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 174 place count 140 transition count 222
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 177 place count 137 transition count 218
Iterating global reduction 5 with 3 rules applied. Total rules applied 180 place count 137 transition count 218
Applied a total of 180 rules in 60 ms. Remains 137 /214 variables (removed 77) and now considering 218/433 (removed 215) transitions.
// Phase 1: matrix 218 rows 137 cols
[2022-06-09 15:18:21] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:21] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 218 rows 137 cols
[2022-06-09 15:18:21] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:18:22] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-06-09 15:18:22] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2022-06-09 15:18:22] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 218 rows 137 cols
[2022-06-09 15:18:22] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 15:18:22] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/214 places, 218/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/214 places, 218/433 transitions.
Stuttering acceptance computed with spot in 2540 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s136 1)), p1:(AND (GEQ s16 1) (GEQ s55 1)), p2:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-00 finished in 3420 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 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 188 transition count 325
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 188 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 188 transition count 322
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 75 place count 168 transition count 294
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 168 transition count 294
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 106 place count 168 transition count 283
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 154 transition count 264
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 154 transition count 264
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 139 place count 154 transition count 259
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 150 place count 143 transition count 238
Iterating global reduction 3 with 11 rules applied. Total rules applied 161 place count 143 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 167 place count 143 transition count 232
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 177 place count 133 transition count 205
Iterating global reduction 4 with 10 rules applied. Total rules applied 187 place count 133 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 133 transition count 201
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 194 place count 130 transition count 197
Iterating global reduction 5 with 3 rules applied. Total rules applied 197 place count 130 transition count 197
Applied a total of 197 rules in 42 ms. Remains 130 /214 variables (removed 84) and now considering 197/433 (removed 236) transitions.
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 15:18:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:25] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 15:18:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:25] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-06-09 15:18:25] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2022-06-09 15:18:25] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 15:18:25] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:25] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/214 places, 197/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/214 places, 197/433 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-03 finished in 690 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 188 transition count 334
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 188 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 188 transition count 330
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 77 place count 167 transition count 301
Iterating global reduction 1 with 21 rules applied. Total rules applied 98 place count 167 transition count 301
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 109 place count 167 transition count 290
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 124 place count 152 transition count 270
Iterating global reduction 2 with 15 rules applied. Total rules applied 139 place count 152 transition count 270
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 147 place count 152 transition count 262
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 161 place count 138 transition count 221
Iterating global reduction 3 with 14 rules applied. Total rules applied 175 place count 138 transition count 221
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 182 place count 138 transition count 214
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 192 place count 128 transition count 187
Iterating global reduction 4 with 10 rules applied. Total rules applied 202 place count 128 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 206 place count 128 transition count 183
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 209 place count 125 transition count 179
Iterating global reduction 5 with 3 rules applied. Total rules applied 212 place count 125 transition count 179
Applied a total of 212 rules in 37 ms. Remains 125 /214 variables (removed 89) and now considering 179/433 (removed 254) transitions.
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:18:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:25] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:18:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-09 15:18:26] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2022-06-09 15:18:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:18:26] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:26] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/214 places, 179/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/214 places, 179/433 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-04 finished in 532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||X(p1)))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 190 transition count 342
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 190 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 190 transition count 339
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 171 transition count 315
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 171 transition count 315
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 100 place count 171 transition count 304
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 113 place count 158 transition count 286
Iterating global reduction 2 with 13 rules applied. Total rules applied 126 place count 158 transition count 286
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 135 place count 158 transition count 277
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 147 place count 146 transition count 239
Iterating global reduction 3 with 12 rules applied. Total rules applied 159 place count 146 transition count 239
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 164 place count 146 transition count 234
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 173 place count 137 transition count 208
Iterating global reduction 4 with 9 rules applied. Total rules applied 182 place count 137 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 186 place count 137 transition count 204
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 188 place count 135 transition count 202
Iterating global reduction 5 with 2 rules applied. Total rules applied 190 place count 135 transition count 202
Applied a total of 190 rules in 13 ms. Remains 135 /214 variables (removed 79) and now considering 202/433 (removed 231) transitions.
// Phase 1: matrix 202 rows 135 cols
[2022-06-09 15:18:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:26] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 202 rows 135 cols
[2022-06-09 15:18:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 15:18:26] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 135 cols
[2022-06-09 15:18:26] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:18:26] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/214 places, 202/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/214 places, 202/433 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s123 1)), p1:(AND (OR (LT s16 1) (LT s110 1)) (OR (LT s1 1) (LT s98 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Product exploration explored 100000 steps with 50000 reset in 264 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) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-05 finished in 1285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((G(F(X(G(p0))))&&X(p1)) U p0)))'
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 189 transition count 332
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 189 transition count 332
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 189 transition count 330
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 169 transition count 302
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 169 transition count 302
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 103 place count 169 transition count 291
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 117 place count 155 transition count 272
Iterating global reduction 2 with 14 rules applied. Total rules applied 131 place count 155 transition count 272
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 139 place count 155 transition count 264
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 151 place count 143 transition count 236
Iterating global reduction 3 with 12 rules applied. Total rules applied 163 place count 143 transition count 236
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 169 place count 143 transition count 230
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 178 place count 134 transition count 204
Iterating global reduction 4 with 9 rules applied. Total rules applied 187 place count 134 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 134 transition count 200
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 193 place count 132 transition count 197
Iterating global reduction 5 with 2 rules applied. Total rules applied 195 place count 132 transition count 197
Applied a total of 195 rules in 11 ms. Remains 132 /214 variables (removed 82) and now considering 197/433 (removed 236) transitions.
// Phase 1: matrix 197 rows 132 cols
[2022-06-09 15:18:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:27] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 197 rows 132 cols
[2022-06-09 15:18:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:27] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-06-09 15:18:27] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 132 cols
[2022-06-09 15:18:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:28] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/214 places, 197/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/214 places, 197/433 transitions.
Stuttering acceptance computed with spot in 938 ms :[p0, p0, true, (AND p0 p1), p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s126 1)), p1:(AND (GEQ s1 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 185 ms.
Product exploration explored 100000 steps with 33333 reset in 192 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 p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-06 finished in 1937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 188 transition count 325
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 188 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 188 transition count 322
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 75 place count 168 transition count 294
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 168 transition count 294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 103 place count 168 transition count 286
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 153 transition count 266
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 153 transition count 266
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 141 place count 153 transition count 258
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 152 place count 142 transition count 237
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 142 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 169 place count 142 transition count 231
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 179 place count 132 transition count 204
Iterating global reduction 4 with 10 rules applied. Total rules applied 189 place count 132 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 193 place count 132 transition count 200
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 196 place count 129 transition count 196
Iterating global reduction 5 with 3 rules applied. Total rules applied 199 place count 129 transition count 196
Applied a total of 199 rules in 34 ms. Remains 129 /214 variables (removed 85) and now considering 196/433 (removed 237) transitions.
// Phase 1: matrix 196 rows 129 cols
[2022-06-09 15:18:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:29] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 196 rows 129 cols
[2022-06-09 15:18:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 15:18:29] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2022-06-09 15:18:29] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 196 rows 129 cols
[2022-06-09 15:18:29] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:30] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/214 places, 196/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/214 places, 196/433 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s26 1) (GEQ s53 1)), p1:(AND (GEQ s26 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-07 finished in 592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G(p1) U X(X(p2))))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 188 transition count 329
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 188 transition count 329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 188 transition count 326
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 75 place count 168 transition count 298
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 168 transition count 298
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 106 place count 168 transition count 287
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 154 transition count 269
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 154 transition count 269
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 142 place count 154 transition count 261
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 154 place count 142 transition count 228
Iterating global reduction 3 with 12 rules applied. Total rules applied 166 place count 142 transition count 228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 174 place count 142 transition count 220
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 183 place count 133 transition count 194
Iterating global reduction 4 with 9 rules applied. Total rules applied 192 place count 133 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 194 place count 133 transition count 192
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 197 place count 130 transition count 188
Iterating global reduction 5 with 3 rules applied. Total rules applied 200 place count 130 transition count 188
Applied a total of 200 rules in 18 ms. Remains 130 /214 variables (removed 84) and now considering 188/433 (removed 245) transitions.
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 15:18:30] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:30] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 15:18:30] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:18:30] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 15:18:30] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 15:18:30] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:30] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/214 places, 188/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/214 places, 188/433 transitions.
Stuttering acceptance computed with spot in 573 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 11}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 11}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 15}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 16}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 11}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 16}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 11}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 11}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 15}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND p1 p0), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={} source=7 dest: 13}], [{ cond=(NOT p0), acceptance={} source=8 dest: 13}, { cond=p0, acceptance={} source=8 dest: 14}], [{ cond=p1, acceptance={} source=9 dest: 4}, { cond=(NOT p1), acceptance={} source=9 dest: 13}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 4}, { cond=(AND p1 p0), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 13}, { cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 14}], [{ cond=true, acceptance={0} source=11 dest: 11}], [{ cond=true, acceptance={} source=12 dest: 6}], [{ cond=(NOT p2), acceptance={} source=13 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND p0 (NOT p2)), acceptance={} source=14 dest: 15}], [{ cond=(NOT p0), acceptance={0} source=15 dest: 11}, { cond=(AND p0 (NOT p2)), acceptance={0} source=15 dest: 15}, { cond=(AND p0 p2), acceptance={0} source=15 dest: 16}], [{ cond=(NOT p0), acceptance={} source=16 dest: 11}, { cond=p0, acceptance={} source=16 dest: 16}]], initial=12, aps=[p1:(AND (GEQ s1 1) (GEQ s94 1)), p2:(AND (GEQ s1 1) (GEQ s124 1)), p0:(AND (GEQ s1 1) (GEQ s85 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, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-08 finished in 1015 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(p0)))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 188 transition count 325
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 188 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 188 transition count 322
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 75 place count 168 transition count 298
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 168 transition count 298
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 106 place count 168 transition count 287
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 154 transition count 268
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 154 transition count 268
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 142 place count 154 transition count 260
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 155 place count 141 transition count 220
Iterating global reduction 3 with 13 rules applied. Total rules applied 168 place count 141 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 173 place count 141 transition count 215
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 183 place count 131 transition count 188
Iterating global reduction 4 with 10 rules applied. Total rules applied 193 place count 131 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 197 place count 131 transition count 184
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 200 place count 128 transition count 180
Iterating global reduction 5 with 3 rules applied. Total rules applied 203 place count 128 transition count 180
Applied a total of 203 rules in 11 ms. Remains 128 /214 variables (removed 86) and now considering 180/433 (removed 253) transitions.
// Phase 1: matrix 180 rows 128 cols
[2022-06-09 15:18:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:31] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 180 rows 128 cols
[2022-06-09 15:18:31] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:31] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-09 15:18:31] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 128 cols
[2022-06-09 15:18:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:31] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/214 places, 180/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/214 places, 180/433 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s53 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-09 finished in 507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!(!G(F(p1))&&p0) U X(p2))||F(p3)))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 189 transition count 333
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 189 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 189 transition count 331
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 169 transition count 303
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 169 transition count 303
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 103 place count 169 transition count 292
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 117 place count 155 transition count 273
Iterating global reduction 2 with 14 rules applied. Total rules applied 131 place count 155 transition count 273
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 139 place count 155 transition count 265
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 151 place count 143 transition count 234
Iterating global reduction 3 with 12 rules applied. Total rules applied 163 place count 143 transition count 234
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 169 place count 143 transition count 228
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 177 place count 135 transition count 210
Iterating global reduction 4 with 8 rules applied. Total rules applied 185 place count 135 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 189 place count 135 transition count 206
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 191 place count 133 transition count 203
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 133 transition count 203
Applied a total of 193 rules in 15 ms. Remains 133 /214 variables (removed 81) and now considering 203/433 (removed 230) transitions.
// Phase 1: matrix 203 rows 133 cols
[2022-06-09 15:18:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:31] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 203 rows 133 cols
[2022-06-09 15:18:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 15:18:32] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 133 cols
[2022-06-09 15:18:32] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 15:18:32] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/214 places, 203/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/214 places, 203/433 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p3) p2 p1), (NOT p3), (AND (NOT p3) p2 p1), (AND (NOT p3) p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p3:(AND (GEQ s1 1) (GEQ s71 1)), p2:(AND (GEQ s1 1) (GEQ s98 1)), p1:(AND (GEQ s1 1) (GEQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 37329 reset in 219 ms.
Product exploration explored 100000 steps with 37317 reset in 257 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 p3) (NOT p2) (NOT p1)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p3) p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 788 ms. Reduced automaton from 6 states, 10 edges and 4 AP to 6 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 198 ms :[(AND p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p3) p2 p1), (NOT p3), (AND (NOT p3) p2 p1), (AND (NOT p3) p1)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 433 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 419 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1593001 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 1593001 steps, saw 623960 distinct states, run finished after 3001 ms. (steps per millisecond=530 ) properties seen :5
Running SMT prover for 1 properties.
// Phase 1: matrix 203 rows 133 cols
[2022-06-09 15:18:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:37] [INFO ] After 48ms 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 p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p3) p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p3) p2)))), (G (NOT (AND p0 (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p2 (NOT p3))), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p3)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 943 ms. Reduced automaton from 6 states, 10 edges and 4 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p3), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p3), (AND (NOT p3) p2)]
Support contains 3 out of 133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 133 cols
[2022-06-09 15:18:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:38] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 203 rows 133 cols
[2022-06-09 15:18:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 15:18:38] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2022-06-09 15:18:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 203 rows 133 cols
[2022-06-09 15:18:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:39] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 203/203 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 : [(AND (NOT p3) (NOT p2)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p3), (AND (NOT p3) p2)]
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Finished probabilistic random walk after 26938 steps, run visited all 3 properties in 108 ms. (steps per millisecond=249 )
Probabilistic random walk after 26938 steps, saw 12754 distinct states, run finished after 108 ms. (steps per millisecond=249 ) properties seen :3
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F p3), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p3), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p3), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p3), (AND (NOT p3) p2)]
Product exploration explored 100000 steps with 22943 reset in 175 ms.
Product exploration explored 100000 steps with 23011 reset in 157 ms.
Built C files in :
/tmp/ltsmin12866246159106868769
[2022-06-09 15:18:40] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2022-06-09 15:18:40] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:18:40] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2022-06-09 15:18:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:18:40] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2022-06-09 15:18:40] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:18:40] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12866246159106868769
Running compilation step : cd /tmp/ltsmin12866246159106868769;'/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 479 ms.
Running link step : cd /tmp/ltsmin12866246159106868769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12866246159106868769;'/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/stateBased10186957590246859544.hoa' '--buchi-type=spotba'
LTSmin run took 701 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-10 finished in 10380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(p0))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 188 transition count 329
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 188 transition count 329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 188 transition count 326
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 75 place count 168 transition count 298
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 168 transition count 298
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 106 place count 168 transition count 287
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 154 transition count 269
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 154 transition count 269
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 141 place count 154 transition count 262
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 154 place count 141 transition count 222
Iterating global reduction 3 with 13 rules applied. Total rules applied 167 place count 141 transition count 222
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 175 place count 141 transition count 214
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 184 place count 132 transition count 188
Iterating global reduction 4 with 9 rules applied. Total rules applied 193 place count 132 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 195 place count 132 transition count 186
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 198 place count 129 transition count 182
Iterating global reduction 5 with 3 rules applied. Total rules applied 201 place count 129 transition count 182
Applied a total of 201 rules in 15 ms. Remains 129 /214 variables (removed 85) and now considering 182/433 (removed 251) transitions.
// Phase 1: matrix 182 rows 129 cols
[2022-06-09 15:18:42] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:18:42] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 182 rows 129 cols
[2022-06-09 15:18:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 15:18:42] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
// Phase 1: matrix 182 rows 129 cols
[2022-06-09 15:18:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:42] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/214 places, 182/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/214 places, 182/433 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23031 reset in 243 ms.
Product exploration explored 100000 steps with 23002 reset in 136 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 1042 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 443 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7825 steps, run visited all 1 properties in 17 ms. (steps per millisecond=460 )
Probabilistic random walk after 7825 steps, saw 3650 distinct states, run finished after 17 ms. (steps per millisecond=460 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 129 cols
[2022-06-09 15:18:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:44] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 182 rows 129 cols
[2022-06-09 15:18:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 15:18:44] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
// Phase 1: matrix 182 rows 129 cols
[2022-06-09 15:18:44] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:18:44] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 182/182 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7825 steps, run visited all 1 properties in 16 ms. (steps per millisecond=489 )
Probabilistic random walk after 7825 steps, saw 3650 distinct states, run finished after 16 ms. (steps per millisecond=489 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22899 reset in 141 ms.
Product exploration explored 100000 steps with 22926 reset in 137 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 12 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2022-06-09 15:18:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 182 rows 129 cols
[2022-06-09 15:18:46] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:18:46] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 182/182 transitions.
Product exploration explored 100000 steps with 23119 reset in 284 ms.
Product exploration explored 100000 steps with 22900 reset in 273 ms.
Built C files in :
/tmp/ltsmin10779180225134559424
[2022-06-09 15:18:46] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10779180225134559424
Running compilation step : cd /tmp/ltsmin10779180225134559424;'/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 278 ms.
Running link step : cd /tmp/ltsmin10779180225134559424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10779180225134559424;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13220526409433962043.hoa' '--buchi-type=spotba'
LTSmin run took 280 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-11 finished in 5264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(F((!p0 U p1)))||!G(p0)))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 189 transition count 327
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 189 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 189 transition count 325
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 169 transition count 297
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 169 transition count 297
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 102 place count 169 transition count 287
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 117 place count 154 transition count 267
Iterating global reduction 2 with 15 rules applied. Total rules applied 132 place count 154 transition count 267
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 140 place count 154 transition count 259
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 153 place count 141 transition count 225
Iterating global reduction 3 with 13 rules applied. Total rules applied 166 place count 141 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 141 transition count 219
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 181 place count 132 transition count 199
Iterating global reduction 4 with 9 rules applied. Total rules applied 190 place count 132 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 194 place count 132 transition count 195
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 197 place count 129 transition count 191
Iterating global reduction 5 with 3 rules applied. Total rules applied 200 place count 129 transition count 191
Applied a total of 200 rules in 19 ms. Remains 129 /214 variables (removed 85) and now considering 191/433 (removed 242) transitions.
// Phase 1: matrix 191 rows 129 cols
[2022-06-09 15:18:47] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:18:47] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 191 rows 129 cols
[2022-06-09 15:18:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-09 15:18:47] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
// Phase 1: matrix 191 rows 129 cols
[2022-06-09 15:18:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:47] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/214 places, 191/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/214 places, 191/433 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(AND (GEQ s7 1) (GEQ s53 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]]
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 206 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 p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 913 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-13 finished in 1850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(p1)||p2))))'
Support contains 7 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 191 transition count 338
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 191 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 191 transition count 335
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 174 transition count 311
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 174 transition count 311
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 92 place count 174 transition count 302
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 161 transition count 285
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 161 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 161 transition count 278
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 151 transition count 252
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 151 transition count 252
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 153 place count 151 transition count 244
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 160 place count 144 transition count 220
Iterating global reduction 4 with 7 rules applied. Total rules applied 167 place count 144 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 168 place count 144 transition count 219
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 170 place count 142 transition count 216
Iterating global reduction 5 with 2 rules applied. Total rules applied 172 place count 142 transition count 216
Applied a total of 172 rules in 22 ms. Remains 142 /214 variables (removed 72) and now considering 216/433 (removed 217) transitions.
// Phase 1: matrix 216 rows 142 cols
[2022-06-09 15:18:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:49] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 216 rows 142 cols
[2022-06-09 15:18:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-06-09 15:18:49] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 142 cols
[2022-06-09 15:18:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:49] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/214 places, 216/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/214 places, 216/433 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s133 1)), p2:(AND (OR (LT s48 1) (LT s87 1)) (OR (LT s1 1) (LT s136 1))), p1:(OR (LT s16 1) (LT s59 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 233 ms.
Product exploration explored 100000 steps with 50000 reset in 234 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) p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 4 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-14 finished in 1181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||X(X(X(p1))))))'
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 433/433 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 189 transition count 332
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 189 transition count 332
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 189 transition count 329
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 72 place count 170 transition count 302
Iterating global reduction 1 with 19 rules applied. Total rules applied 91 place count 170 transition count 302
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 100 place count 170 transition count 293
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 114 place count 156 transition count 274
Iterating global reduction 2 with 14 rules applied. Total rules applied 128 place count 156 transition count 274
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 136 place count 156 transition count 266
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 149 place count 143 transition count 227
Iterating global reduction 3 with 13 rules applied. Total rules applied 162 place count 143 transition count 227
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 167 place count 143 transition count 222
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 177 place count 133 transition count 195
Iterating global reduction 4 with 10 rules applied. Total rules applied 187 place count 133 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 133 transition count 191
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 194 place count 130 transition count 187
Iterating global reduction 5 with 3 rules applied. Total rules applied 197 place count 130 transition count 187
Applied a total of 197 rules in 15 ms. Remains 130 /214 variables (removed 84) and now considering 187/433 (removed 246) transitions.
// Phase 1: matrix 187 rows 130 cols
[2022-06-09 15:18:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:50] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 187 rows 130 cols
[2022-06-09 15:18:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:18:50] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 15:18:50] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
// Phase 1: matrix 187 rows 130 cols
[2022-06-09 15:18:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:18:50] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/214 places, 187/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/214 places, 187/433 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s114 1)), p1:(AND (GEQ s1 1) (GEQ s119 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]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-15 finished in 596 ms.
All properties solved by simple procedures.
Total runtime 35871 ms.

BK_STOP 1654787930977

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

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