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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.2K Jun 7 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Jun 7 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 7 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654776430699

Running Version 202205111006
[2022-06-09 12:07:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 12:07:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:07:12] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-06-09 12:07:12] [INFO ] Transformed 1440 places.
[2022-06-09 12:07:12] [INFO ] Transformed 672 transitions.
[2022-06-09 12:07:12] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 183 place count 244 transition count 396
Iterating global reduction 1 with 82 rules applied. Total rules applied 265 place count 244 transition count 396
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 277 place count 244 transition count 384
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 338 place count 183 transition count 323
Iterating global reduction 2 with 61 rules applied. Total rules applied 399 place count 183 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 402 place count 183 transition count 320
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 430 place count 155 transition count 281
Iterating global reduction 3 with 28 rules applied. Total rules applied 458 place count 155 transition count 281
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 481 place count 155 transition count 258
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 484 place count 152 transition count 254
Iterating global reduction 4 with 3 rules applied. Total rules applied 487 place count 152 transition count 254
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 489 place count 150 transition count 252
Iterating global reduction 4 with 2 rules applied. Total rules applied 491 place count 150 transition count 252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 492 place count 149 transition count 251
Iterating global reduction 4 with 1 rules applied. Total rules applied 493 place count 149 transition count 251
Applied a total of 493 rules in 75 ms. Remains 149 /347 variables (removed 198) and now considering 251/672 (removed 421) transitions.
// Phase 1: matrix 251 rows 149 cols
[2022-06-09 12:07:12] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-09 12:07:12] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 251 rows 149 cols
[2022-06-09 12:07:12] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 12:07:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-09 12:07:12] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
// Phase 1: matrix 251 rows 149 cols
[2022-06-09 12:07:12] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:07:13] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/347 places, 251/672 transitions.
Finished structural reductions, in 1 iterations. Remains : 149/347 places, 251/672 transitions.
Support contains 35 out of 149 places after structural reductions.
[2022-06-09 12:07:13] [INFO ] Flatten gal took : 48 ms
[2022-06-09 12:07:13] [INFO ] Flatten gal took : 19 ms
[2022-06-09 12:07:13] [INFO ] Input system was already deterministic with 251 transitions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 125 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 251 rows 149 cols
[2022-06-09 12:07:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:07:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:07:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:07:14] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-06-09 12:07:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:07:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 12:07:15] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-06-09 12:07:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-09 12:07:16] [INFO ] After 860ms SMT Verify possible using 111 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2022-06-09 12:07:17] [INFO ] After 1698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 728 ms.
[2022-06-09 12:07:17] [INFO ] After 3161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 218 ms.
Support contains 29 out of 149 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 147 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 147 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 146 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 146 transition count 247
Applied a total of 6 rules in 30 ms. Remains 146 /149 variables (removed 3) and now considering 247/251 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/149 places, 247/251 transitions.
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 112 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Finished probabilistic random walk after 19212 steps, run visited all 22 properties in 305 ms. (steps per millisecond=62 )
Probabilistic random walk after 19212 steps, saw 8481 distinct states, run finished after 305 ms. (steps per millisecond=62 ) properties seen :22
Computed a total of 6 stabilizing places and 6 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F((F(p1)&&p0)) U p1)||X(!(X(p2) U X(p3)))))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 200
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 130 transition count 198
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 116 transition count 175
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 116 transition count 175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 75 place count 116 transition count 168
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 107 transition count 153
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 107 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 107 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 102 place count 100 transition count 139
Iterating global reduction 3 with 7 rules applied. Total rules applied 109 place count 100 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 112 place count 100 transition count 136
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 116 place count 96 transition count 132
Iterating global reduction 4 with 4 rules applied. Total rules applied 120 place count 96 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 96 transition count 131
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 123 place count 94 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 94 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 93 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 93 transition count 123
Applied a total of 127 rules in 13 ms. Remains 93 /149 variables (removed 56) and now considering 123/251 (removed 128) transitions.
// Phase 1: matrix 123 rows 93 cols
[2022-06-09 12:07:19] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:07:19] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 123 rows 93 cols
[2022-06-09 12:07:19] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:07:19] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 12:07:19] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 93 cols
[2022-06-09 12:07:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:19] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/149 places, 123/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/149 places, 123/251 transitions.
Stuttering acceptance computed with spot in 2820 ms :[true, (AND p1 p3), p3, (AND p0 p1 p3), (AND p1 p3), (AND p1 p3), (AND p1 p3), (AND p0 p1 p3), p1, p1, (AND p1 p0), p3, (AND p0 p1 p3), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 11}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND p0 p1), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 12}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 12}], [{ cond=(AND p1 p3), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 8}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 11}], [{ cond=(AND p1 p3), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=6 dest: 9}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 13}], [{ cond=(AND p0 p1 p3), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 10}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=7 dest: 11}], [{ cond=p1, acceptance={} source=8 dest: 0}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=p1, acceptance={} source=9 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 13}], [{ cond=(AND p0 p1), acceptance={} source=10 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 8}, { cond=(NOT p0), acceptance={} source=10 dest: 10}], [{ cond=p3, acceptance={} source=11 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=11 dest: 11}], [{ cond=(AND p0 p1 p3), acceptance={} source=12 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=12 dest: 7}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=12 dest: 10}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=12 dest: 13}], [{ cond=(AND p0 p1), acceptance={} source=13 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=13 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=13 dest: 13}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s48 1)), p0:(AND (GEQ s1 1) (GEQ s48 1)), p3:(AND (GEQ s1 1) (GEQ s90 1)), p2:(AND (GEQ s35 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[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]]
Product exploration explored 100000 steps with 33333 reset in 386 ms.
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))
Knowledge based reduction with 20 factoid took 634 ms. Reduced automaton from 14 states, 50 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-00 finished in 4414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((F((G(p0)||p1))||G(p2))))))'
Support contains 6 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 196
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 130 transition count 194
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 116 transition count 172
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 116 transition count 172
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 74 place count 116 transition count 166
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 106 transition count 150
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 106 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 106 transition count 148
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 98 transition count 134
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 98 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 116 place count 98 transition count 130
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 121 place count 93 transition count 125
Iterating global reduction 4 with 5 rules applied. Total rules applied 126 place count 93 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 127 place count 93 transition count 124
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 130 place count 90 transition count 121
Iterating global reduction 5 with 3 rules applied. Total rules applied 133 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 135 place count 90 transition count 119
Applied a total of 135 rules in 39 ms. Remains 90 /149 variables (removed 59) and now considering 119/251 (removed 132) transitions.
// Phase 1: matrix 119 rows 90 cols
[2022-06-09 12:07:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:23] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 119 rows 90 cols
[2022-06-09 12:07:23] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:07:23] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 12:07:23] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-06-09 12:07:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 119 rows 90 cols
[2022-06-09 12:07:24] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 12:07:24] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/149 places, 119/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/149 places, 119/251 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s7 1) (GEQ s35 1)) (AND (GEQ s34 1) (GEQ s52 1))), p1:(AND (GEQ s7 1) (GEQ s35 1)), p0:(AND (GEQ s1 1) (GEQ s80 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-01 finished in 366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 129 transition count 199
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 129 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 129 transition count 197
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 114 transition count 170
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 114 transition count 170
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 114 transition count 164
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 148
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 104 transition count 146
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 108 place count 96 transition count 133
Iterating global reduction 3 with 8 rules applied. Total rules applied 116 place count 96 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 120 place count 96 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 125 place count 91 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 130 place count 91 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 131 place count 91 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 134 place count 88 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 137 place count 88 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 139 place count 88 transition count 118
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 87 transition count 112
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 87 transition count 112
Applied a total of 141 rules in 38 ms. Remains 87 /149 variables (removed 62) and now considering 112/251 (removed 139) transitions.
// Phase 1: matrix 112 rows 87 cols
[2022-06-09 12:07:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:24] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 112 rows 87 cols
[2022-06-09 12:07:24] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 12:07:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 12:07:24] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-06-09 12:07:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 112 rows 87 cols
[2022-06-09 12:07:24] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:07:24] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/149 places, 112/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/149 places, 112/251 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-02 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)&&((X(!p2) U p3)||G(p2))) U X(p3)))'
Support contains 6 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 131 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 131 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 131 transition count 202
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 119 transition count 180
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 119 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 119 transition count 177
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 110 transition count 164
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 110 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 110 transition count 163
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 92 place count 103 transition count 151
Iterating global reduction 3 with 7 rules applied. Total rules applied 99 place count 103 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 104 place count 103 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 108 place count 99 transition count 142
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 99 transition count 142
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 115 place count 96 transition count 139
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 96 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 96 transition count 137
Applied a total of 120 rules in 18 ms. Remains 96 /149 variables (removed 53) and now considering 137/251 (removed 114) transitions.
// Phase 1: matrix 137 rows 96 cols
[2022-06-09 12:07:24] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 12:07:24] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 137 rows 96 cols
[2022-06-09 12:07:24] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 12:07:24] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-09 12:07:24] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 96 cols
[2022-06-09 12:07:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:24] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/149 places, 137/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/149 places, 137/251 transitions.
Stuttering acceptance computed with spot in 1084 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), true, (NOT p1), (OR (NOT p3) p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}], [{ cond=p2, acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s26 1) (GEQ s57 1)), p3:(AND (GEQ s1 1) (GEQ s48 1)), p2:(AND (GEQ s1 1) (GEQ s90 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-03 finished in 1414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((F(p2)&&p1))&&X(G(p3))&&p0))))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 196
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 130 transition count 194
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 115 transition count 168
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 115 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 115 transition count 162
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 105 transition count 147
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 105 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 105 transition count 145
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 106 place count 97 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 114 place count 97 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 97 transition count 128
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 123 place count 92 transition count 123
Iterating global reduction 4 with 5 rules applied. Total rules applied 128 place count 92 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 92 transition count 122
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 132 place count 89 transition count 119
Iterating global reduction 5 with 3 rules applied. Total rules applied 135 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 137 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 88 transition count 111
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 88 transition count 111
Applied a total of 139 rules in 12 ms. Remains 88 /149 variables (removed 61) and now considering 111/251 (removed 140) transitions.
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 12:07:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:25] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 12:07:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 12:07:26] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 12:07:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:26] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/149 places, 111/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/149 places, 111/251 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p3), (OR (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 6}], [{ cond=(AND p0 p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND p2 p3), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 6}], [{ cond=(AND p1 p2 p3), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={0} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p3:(AND (GEQ s28 1) (GEQ s33 1)), p0:(AND (GEQ s1 1) (GEQ s40 1)), p1:(AND (GEQ s1 1) (GEQ s40 1)), p2:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-04 finished in 757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(p0))||G(p1)))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 200
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 130 transition count 198
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 116 transition count 172
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 116 transition count 172
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 116 transition count 167
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 107 transition count 155
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 107 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 107 transition count 153
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 100 place count 100 transition count 141
Iterating global reduction 3 with 7 rules applied. Total rules applied 107 place count 100 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 111 place count 100 transition count 137
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 115 place count 96 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 119 place count 96 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 96 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 122 place count 94 transition count 130
Iterating global reduction 5 with 2 rules applied. Total rules applied 124 place count 94 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 126 place count 94 transition count 128
Applied a total of 126 rules in 10 ms. Remains 94 /149 variables (removed 55) and now considering 128/251 (removed 123) transitions.
// Phase 1: matrix 128 rows 94 cols
[2022-06-09 12:07:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:26] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 128 rows 94 cols
[2022-06-09 12:07:26] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:07:26] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-09 12:07:26] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 94 cols
[2022-06-09 12:07:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:26] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/149 places, 128/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/149 places, 128/251 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (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-d1m05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s85 1)), p1:(OR (LT s1 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28596 reset in 213 ms.
Product exploration explored 100000 steps with 28600 reset in 170 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 p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Finished probabilistic random walk after 30673 steps, run visited all 3 properties in 159 ms. (steps per millisecond=192 )
Probabilistic random walk after 30673 steps, saw 13745 distinct states, run finished after 159 ms. (steps per millisecond=192 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 94 cols
[2022-06-09 12:07:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:28] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 128 rows 94 cols
[2022-06-09 12:07:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:28] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-09 12:07:28] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 94 cols
[2022-06-09 12:07:28] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 12:07:28] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 128/128 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 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Finished probabilistic random walk after 30673 steps, run visited all 3 properties in 135 ms. (steps per millisecond=227 )
Probabilistic random walk after 30673 steps, saw 13745 distinct states, run finished after 135 ms. (steps per millisecond=227 ) properties seen :3
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 28573 reset in 118 ms.
Product exploration explored 100000 steps with 28564 reset in 117 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Applied a total of 0 rules in 9 ms. Remains 94 /94 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2022-06-09 12:07:32] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 128 rows 94 cols
[2022-06-09 12:07:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:32] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 128/128 transitions.
Product exploration explored 100000 steps with 28589 reset in 223 ms.
Product exploration explored 100000 steps with 28576 reset in 241 ms.
Built C files in :
/tmp/ltsmin8536810174534663186
[2022-06-09 12:07:32] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8536810174534663186
Running compilation step : cd /tmp/ltsmin8536810174534663186;'/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 317 ms.
Running link step : cd /tmp/ltsmin8536810174534663186;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8536810174534663186;'/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/stateBased13715605489827344507.hoa' '--buchi-type=spotba'
LTSmin run took 241 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-05 finished in 6689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 129 transition count 195
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 129 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 129 transition count 194
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 114 transition count 168
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 114 transition count 168
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 78 place count 114 transition count 161
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 103 transition count 144
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 103 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 103 transition count 142
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 111 place count 94 transition count 127
Iterating global reduction 3 with 9 rules applied. Total rules applied 120 place count 94 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 125 place count 94 transition count 122
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 130 place count 89 transition count 117
Iterating global reduction 4 with 5 rules applied. Total rules applied 135 place count 89 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 89 transition count 116
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 139 place count 86 transition count 113
Iterating global reduction 5 with 3 rules applied. Total rules applied 142 place count 86 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 144 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 145 place count 85 transition count 105
Iterating global reduction 6 with 1 rules applied. Total rules applied 146 place count 85 transition count 105
Applied a total of 146 rules in 11 ms. Remains 85 /149 variables (removed 64) and now considering 105/251 (removed 146) transitions.
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:07:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:33] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:07:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:33] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 12:07:33] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:07:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:33] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/149 places, 105/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/149 places, 105/251 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-06 finished in 722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(X(X(X(X(p0))))))&&!p0))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 129 transition count 199
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 129 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 129 transition count 196
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 114 transition count 169
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 114 transition count 169
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 114 transition count 162
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 104 transition count 147
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 104 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 104 transition count 146
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 109 place count 96 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 117 place count 96 transition count 132
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 124 place count 96 transition count 125
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 92 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 92 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 135 place count 89 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 89 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 88 transition count 110
Applied a total of 142 rules in 12 ms. Remains 88 /149 variables (removed 61) and now considering 110/251 (removed 141) transitions.
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:07:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:34] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:07:34] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 12:07:34] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 12:07:34] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:07:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:34] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/149 places, 110/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/149 places, 110/251 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, true, (NOT p0), p0]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-07 finished in 375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 128 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 128 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 128 transition count 192
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 112 transition count 164
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 112 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 112 transition count 157
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 101 transition count 140
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 101 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 101 transition count 138
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 116 place count 92 transition count 123
Iterating global reduction 3 with 9 rules applied. Total rules applied 125 place count 92 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 130 place count 92 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 135 place count 87 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 87 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 87 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 144 place count 84 transition count 109
Iterating global reduction 5 with 3 rules applied. Total rules applied 147 place count 84 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 149 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 83 transition count 101
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 83 transition count 101
Applied a total of 151 rules in 32 ms. Remains 83 /149 variables (removed 66) and now considering 101/251 (removed 150) transitions.
// Phase 1: matrix 101 rows 83 cols
[2022-06-09 12:07:34] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:07:34] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 101 rows 83 cols
[2022-06-09 12:07:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 12:07:34] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-06-09 12:07:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 101 rows 83 cols
[2022-06-09 12:07:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:34] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/149 places, 101/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/149 places, 101/251 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-08 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U F(((F(p1) U G(p0))||G((X(p3)&&p2))))))'
Support contains 5 out of 149 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 : 149/149 places, 251/251 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 131 transition count 202
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 131 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 131 transition count 201
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 117 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 117 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 70 place count 117 transition count 171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 108 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 108 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 108 transition count 155
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 102 transition count 145
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 102 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 105 place count 102 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 109 place count 98 transition count 138
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 98 transition count 138
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 116 place count 95 transition count 135
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 95 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 95 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 94 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 94 transition count 127
Applied a total of 123 rules in 30 ms. Remains 94 /149 variables (removed 55) and now considering 127/251 (removed 124) transitions.
// Phase 1: matrix 127 rows 94 cols
[2022-06-09 12:07:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:34] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 127 rows 94 cols
[2022-06-09 12:07:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:34] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-09 12:07:34] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2022-06-09 12:07:35] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 127 rows 94 cols
[2022-06-09 12:07:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:35] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/149 places, 127/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/149 places, 127/251 transitions.
Stuttering acceptance computed with spot in 44 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p3), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s50 1)), p2:(AND (GEQ s1 1) (GEQ s92 1)), p3:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-09 finished in 365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 129 transition count 195
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 129 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 129 transition count 193
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 114 transition count 167
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 114 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 79 place count 114 transition count 160
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 103 transition count 143
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 103 transition count 141
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 112 place count 94 transition count 126
Iterating global reduction 3 with 9 rules applied. Total rules applied 121 place count 94 transition count 126
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 126 place count 94 transition count 121
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 131 place count 89 transition count 116
Iterating global reduction 4 with 5 rules applied. Total rules applied 136 place count 89 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 89 transition count 115
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 140 place count 86 transition count 112
Iterating global reduction 5 with 3 rules applied. Total rules applied 143 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 146 place count 85 transition count 104
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 85 transition count 104
Applied a total of 147 rules in 19 ms. Remains 85 /149 variables (removed 64) and now considering 104/251 (removed 147) transitions.
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 12:07:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:07:35] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 12:07:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:07:35] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 12:07:35] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2022-06-09 12:07:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 12:07:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:35] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/149 places, 104/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/149 places, 104/251 transitions.
Stuttering acceptance computed with spot in 443 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-10 finished in 690 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F((G(X(p0)) U p1))))&&X(p1)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 207
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 130 transition count 204
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 115 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 115 transition count 177
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 115 transition count 168
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 105 transition count 153
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 105 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 105 transition count 151
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 97 transition count 137
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 97 transition count 137
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 125 place count 97 transition count 130
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 129 place count 93 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 133 place count 93 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 134 place count 93 transition count 125
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 137 place count 90 transition count 122
Iterating global reduction 5 with 3 rules applied. Total rules applied 140 place count 90 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 89 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 89 transition count 116
Applied a total of 142 rules in 13 ms. Remains 89 /149 variables (removed 60) and now considering 116/251 (removed 135) transitions.
// Phase 1: matrix 116 rows 89 cols
[2022-06-09 12:07:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:35] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 116 rows 89 cols
[2022-06-09 12:07:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:07:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 12:07:36] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 89 cols
[2022-06-09 12:07:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:36] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/149 places, 116/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/149 places, 116/251 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-11 finished in 419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G((F(G(p0)) U p1)) U p2))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 131 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 131 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 131 transition count 202
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 118 transition count 178
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 118 transition count 178
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 118 transition count 172
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 110 transition count 159
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 110 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 110 transition count 158
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 95 place count 103 transition count 148
Iterating global reduction 3 with 7 rules applied. Total rules applied 102 place count 103 transition count 148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 109 place count 103 transition count 141
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 112 place count 100 transition count 138
Iterating global reduction 4 with 3 rules applied. Total rules applied 115 place count 100 transition count 138
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 98 transition count 136
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 98 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 98 transition count 134
Applied a total of 121 rules in 16 ms. Remains 98 /149 variables (removed 51) and now considering 134/251 (removed 117) transitions.
// Phase 1: matrix 134 rows 98 cols
[2022-06-09 12:07:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:36] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 134 rows 98 cols
[2022-06-09 12:07:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:07:36] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 12:07:36] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-06-09 12:07:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 134 rows 98 cols
[2022-06-09 12:07:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:36] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/149 places, 134/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/149 places, 134/251 transitions.
Stuttering acceptance computed with spot in 227 ms :[p2, true, (AND p2 p1 p0), (AND p1 p2), (AND p1 p0), (AND p1 p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s90 1)), p1:(AND (GEQ s7 1) (GEQ s38 1)), p0:(OR (AND (GEQ s1 1) (GEQ s93 1)) (AND (GEQ s1 1) (GEQ s90 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 22964 reset in 126 ms.
Product exploration explored 100000 steps with 22911 reset in 130 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 680 ms. Reduced automaton from 7 states, 17 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2327 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Probably explored full state space saw : 120875 states, properties seen :2
Probabilistic random walk after 317592 steps, saw 120875 distinct states, run finished after 1490 ms. (steps per millisecond=213 ) properties seen :2
Explored full state space saw : 121187 states, properties seen :0
Exhaustive walk after 318327 steps, saw 121187 distinct states, run finished after 1427 ms. (steps per millisecond=223 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1))), (G (NOT (AND p2 p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p2)]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 p1)))
Knowledge based reduction with 19 factoid took 629 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-12 finished in 5630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 251/251 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 129 transition count 195
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 129 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 129 transition count 193
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 114 transition count 167
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 114 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 114 transition count 161
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 103 transition count 144
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 103 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 103 transition count 142
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 111 place count 94 transition count 127
Iterating global reduction 3 with 9 rules applied. Total rules applied 120 place count 94 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 125 place count 94 transition count 122
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 129 place count 90 transition count 118
Iterating global reduction 4 with 4 rules applied. Total rules applied 133 place count 90 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 134 place count 90 transition count 117
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 136 place count 88 transition count 115
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 87 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 87 transition count 109
Applied a total of 140 rules in 19 ms. Remains 87 /149 variables (removed 62) and now considering 109/251 (removed 142) transitions.
// Phase 1: matrix 109 rows 87 cols
[2022-06-09 12:07:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:41] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 109 rows 87 cols
[2022-06-09 12:07:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:07:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 12:07:42] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-06-09 12:07:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 109 rows 87 cols
[2022-06-09 12:07:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:07:42] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/149 places, 109/251 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/149 places, 109/251 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-13 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 s26 1) (GEQ s49 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-13 finished in 285 ms.
All properties solved by simple procedures.
Total runtime 30348 ms.

BK_STOP 1654776462268

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-d1m05"
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-d1m05, 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-165472281900196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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