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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 8.2K Jun 7 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K 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-d1m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654776654881

Running Version 202205111006
[2022-06-09 12:10:56] [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:10:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:10:56] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2022-06-09 12:10:56] [INFO ] Transformed 1440 places.
[2022-06-09 12:10:56] [INFO ] Transformed 672 transitions.
[2022-06-09 12:10:56] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 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 401
Iterating global reduction 1 with 82 rules applied. Total rules applied 265 place count 244 transition count 401
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 273 place count 244 transition count 393
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 331 place count 186 transition count 335
Iterating global reduction 2 with 58 rules applied. Total rules applied 389 place count 186 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 391 place count 186 transition count 333
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 418 place count 159 transition count 294
Iterating global reduction 3 with 27 rules applied. Total rules applied 445 place count 159 transition count 294
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 471 place count 159 transition count 268
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 475 place count 155 transition count 262
Iterating global reduction 4 with 4 rules applied. Total rules applied 479 place count 155 transition count 262
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 481 place count 153 transition count 260
Iterating global reduction 4 with 2 rules applied. Total rules applied 483 place count 153 transition count 260
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 484 place count 152 transition count 259
Iterating global reduction 4 with 1 rules applied. Total rules applied 485 place count 152 transition count 259
Applied a total of 485 rules in 70 ms. Remains 152 /347 variables (removed 195) and now considering 259/672 (removed 413) transitions.
// Phase 1: matrix 259 rows 152 cols
[2022-06-09 12:10:56] [INFO ] Computed 2 place invariants in 19 ms
[2022-06-09 12:10:56] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 259 rows 152 cols
[2022-06-09 12:10:56] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 12:10:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-06-09 12:10:57] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
// Phase 1: matrix 259 rows 152 cols
[2022-06-09 12:10:57] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 12:10:57] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/347 places, 259/672 transitions.
Finished structural reductions, in 1 iterations. Remains : 152/347 places, 259/672 transitions.
Support contains 41 out of 152 places after structural reductions.
[2022-06-09 12:10:57] [INFO ] Flatten gal took : 47 ms
[2022-06-09 12:10:57] [INFO ] Flatten gal took : 21 ms
[2022-06-09 12:10:57] [INFO ] Input system was already deterministic with 259 transitions.
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 32) seen :12
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 259 rows 152 cols
[2022-06-09 12:10:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:10:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:10:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 38 ms returned sat
[2022-06-09 12:11:00] [INFO ] After 1458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-06-09 12:11:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:11:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 12:11:01] [INFO ] After 768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2022-06-09 12:11:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-06-09 12:11:02] [INFO ] After 1034ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2022-06-09 12:11:03] [INFO ] After 2030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 831 ms.
[2022-06-09 12:11:04] [INFO ] After 3870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 155 ms.
Support contains 26 out of 152 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 152/152 places, 259/259 transitions.
Graph (complete) has 506 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 151 transition count 255
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 146 transition count 237
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 146 transition count 237
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 144 transition count 235
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 144 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 144 transition count 234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 143 transition count 233
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 143 transition count 233
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 142 transition count 231
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 142 transition count 231
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 141 transition count 230
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 141 transition count 230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 140 transition count 229
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 140 transition count 229
Applied a total of 28 rules in 44 ms. Remains 140 /152 variables (removed 12) and now considering 229/259 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/152 places, 229/259 transitions.
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 121 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 113 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Finished probabilistic random walk after 8166 steps, run visited all 20 properties in 150 ms. (steps per millisecond=54 )
Probabilistic random walk after 8166 steps, saw 3559 distinct states, run finished after 150 ms. (steps per millisecond=54 ) properties seen :20
Computed a total of 5 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 132 transition count 199
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 132 transition count 199
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 56 place count 116 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 72 place count 116 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 78 place count 116 transition count 169
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 105 transition count 155
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 105 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 105 transition count 154
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 108 place count 98 transition count 142
Iterating global reduction 2 with 7 rules applied. Total rules applied 115 place count 98 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 98 transition count 137
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 124 place count 94 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 94 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 94 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 92 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 92 transition count 125
Applied a total of 133 rules in 10 ms. Remains 92 /152 variables (removed 60) and now considering 125/259 (removed 134) transitions.
// Phase 1: matrix 125 rows 92 cols
[2022-06-09 12:11:05] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:11:05] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 125 rows 92 cols
[2022-06-09 12:11:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:05] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 12:11:06] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 92 cols
[2022-06-09 12:11:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:11:06] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/152 places, 125/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/152 places, 125/259 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s1 1) (LT s83 1)) (OR (LT s9 1) (LT s65 1)) (OR (LT s1 1) (LT s86 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 13989 steps with 3208 reset in 103 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-00 finished in 1565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((X(p1)||G((F(p3)||p2))))&&p0)))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 131 transition count 195
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 131 transition count 195
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 114 transition count 170
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 114 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 84 place count 114 transition count 162
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 104 transition count 147
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 104 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 104 transition count 145
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 113 place count 97 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 120 place count 97 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 97 transition count 131
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 94 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 93 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 134 place count 93 transition count 120
Applied a total of 134 rules in 21 ms. Remains 93 /152 variables (removed 59) and now considering 120/259 (removed 139) transitions.
// Phase 1: matrix 120 rows 93 cols
[2022-06-09 12:11:06] [INFO ] Computed 2 place invariants in 35 ms
[2022-06-09 12:11:07] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 120 rows 93 cols
[2022-06-09 12:11:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 12:11:07] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
// Phase 1: matrix 120 rows 93 cols
[2022-06-09 12:11:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:07] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/152 places, 120/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/152 places, 120/259 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s76 1)), p2:(OR (LT s1 1) (LT s88 1)), p3:(OR (LT s1 1) (LT s41 1)), p1:(OR (LT s28 1) (LT s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-01 finished in 739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&p1)))'
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 131 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 131 transition count 194
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 114 transition count 169
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 114 transition count 169
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 84 place count 114 transition count 161
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 95 place count 103 transition count 149
Iterating global reduction 1 with 11 rules applied. Total rules applied 106 place count 103 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 103 transition count 148
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 114 place count 96 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 121 place count 96 transition count 135
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 128 place count 96 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 93 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 93 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 91 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 91 transition count 118
Applied a total of 138 rules in 17 ms. Remains 91 /152 variables (removed 61) and now considering 118/259 (removed 141) transitions.
// Phase 1: matrix 118 rows 91 cols
[2022-06-09 12:11:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:07] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 118 rows 91 cols
[2022-06-09 12:11:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:07] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 12:11:07] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 91 cols
[2022-06-09 12:11:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:07] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/152 places, 118/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/152 places, 118/259 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1)), p1:(OR (LT s1 1) (LT s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-04 finished in 481 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 131 transition count 195
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 131 transition count 195
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 114 transition count 170
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 114 transition count 170
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 83 place count 114 transition count 163
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 95 place count 102 transition count 146
Iterating global reduction 1 with 12 rules applied. Total rules applied 107 place count 102 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 109 place count 102 transition count 144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 117 place count 94 transition count 131
Iterating global reduction 2 with 8 rules applied. Total rules applied 125 place count 94 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 129 place count 94 transition count 127
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 134 place count 89 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 89 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 89 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 87 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 87 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 146 place count 87 transition count 112
Applied a total of 146 rules in 9 ms. Remains 87 /152 variables (removed 65) and now considering 112/259 (removed 147) transitions.
// Phase 1: matrix 112 rows 87 cols
[2022-06-09 12:11:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:08] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 112 rows 87 cols
[2022-06-09 12:11:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 12:11:08] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 112 rows 87 cols
[2022-06-09 12:11:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:08] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/152 places, 112/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/152 places, 112/259 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s79 1)), p0:(OR (LT s1 1) (LT s45 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 1108 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-05 finished in 2022 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(F(p1)||F(p2)))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 134 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 134 transition count 205
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 52 place count 118 transition count 181
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 118 transition count 181
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 118 transition count 174
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 107 transition count 159
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 107 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 107 transition count 158
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 105 place count 100 transition count 146
Iterating global reduction 2 with 7 rules applied. Total rules applied 112 place count 100 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 100 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 96 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 96 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 96 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 94 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 94 transition count 130
Applied a total of 129 rules in 12 ms. Remains 94 /152 variables (removed 58) and now considering 130/259 (removed 129) transitions.
// Phase 1: matrix 130 rows 94 cols
[2022-06-09 12:11:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:10] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 130 rows 94 cols
[2022-06-09 12:11:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:10] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 12:11:10] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
// Phase 1: matrix 130 rows 94 cols
[2022-06-09 12:11:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:10] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/152 places, 130/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/152 places, 130/259 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s29 1) (GEQ s36 1)), p2:(OR (LT s1 1) (LT s88 1)), p0:(AND (OR (LT s1 1) (LT s83 1)) (OR (LT s1 1) (LT s41 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6340 steps with 2357 reset in 32 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-06 finished in 462 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((G(X(F(G(p0))))||X(p0)))))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 130 transition count 190
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 130 transition count 190
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 113 transition count 168
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 113 transition count 168
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 86 place count 113 transition count 160
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 98 place count 101 transition count 143
Iterating global reduction 1 with 12 rules applied. Total rules applied 110 place count 101 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 101 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 120 place count 93 transition count 127
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 93 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 131 place count 93 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 136 place count 88 transition count 114
Iterating global reduction 3 with 5 rules applied. Total rules applied 141 place count 88 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 88 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 144 place count 86 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 148 place count 86 transition count 109
Applied a total of 148 rules in 5 ms. Remains 86 /152 variables (removed 66) and now considering 109/259 (removed 150) transitions.
// Phase 1: matrix 109 rows 86 cols
[2022-06-09 12:11:10] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:10] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 109 rows 86 cols
[2022-06-09 12:11:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:10] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 12:11:10] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 86 cols
[2022-06-09 12:11:10] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:10] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/152 places, 109/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/152 places, 109/259 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-07 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 s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Product exploration explored 100000 steps with 50000 reset in 254 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 106 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-07 finished in 1005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(p0))) U p1))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 131 transition count 196
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 131 transition count 196
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 113 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 113 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 86 place count 113 transition count 162
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 98 place count 101 transition count 145
Iterating global reduction 1 with 12 rules applied. Total rules applied 110 place count 101 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 101 transition count 143
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 120 place count 93 transition count 129
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 93 transition count 129
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 132 place count 93 transition count 125
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 137 place count 88 transition count 115
Iterating global reduction 3 with 5 rules applied. Total rules applied 142 place count 88 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 88 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 86 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 149 place count 86 transition count 110
Applied a total of 149 rules in 33 ms. Remains 86 /152 variables (removed 66) and now considering 110/259 (removed 149) transitions.
// Phase 1: matrix 110 rows 86 cols
[2022-06-09 12:11:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:11] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 110 rows 86 cols
[2022-06-09 12:11:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:11:12] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2022-06-09 12:11:12] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 110 rows 86 cols
[2022-06-09 12:11:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:12] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/152 places, 110/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/152 places, 110/259 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s71 1)) (AND (GEQ s11 1) (GEQ s66 1))), p0:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-08 finished in 781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F((G((X(p0)||p1))||F(p2)))))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 133 transition count 197
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 133 transition count 197
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 53 place count 118 transition count 176
Iterating global reduction 0 with 15 rules applied. Total rules applied 68 place count 118 transition count 176
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 74 place count 118 transition count 170
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 107 transition count 154
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 107 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 98 place count 107 transition count 152
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 101 transition count 143
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 101 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 101 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 98 transition count 131
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 98 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 98 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 97 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 97 transition count 129
Applied a total of 123 rules in 11 ms. Remains 97 /152 variables (removed 55) and now considering 129/259 (removed 130) transitions.
// Phase 1: matrix 129 rows 97 cols
[2022-06-09 12:11:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:12] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 129 rows 97 cols
[2022-06-09 12:11:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-09 12:11:12] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 97 cols
[2022-06-09 12:11:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:12] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/152 places, 129/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/152 places, 129/259 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s28 1) (GEQ s58 1)), p2:(AND (GEQ s1 1) (GEQ s92 1)), p0:(AND (GEQ s25 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-09 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0)) U p0) U p1))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 132 transition count 196
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 132 transition count 196
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 56 place count 116 transition count 173
Iterating global reduction 0 with 16 rules applied. Total rules applied 72 place count 116 transition count 173
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 79 place count 116 transition count 166
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 91 place count 104 transition count 149
Iterating global reduction 1 with 12 rules applied. Total rules applied 103 place count 104 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 104 transition count 147
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 112 place count 97 transition count 137
Iterating global reduction 2 with 7 rules applied. Total rules applied 119 place count 97 transition count 137
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 97 transition count 132
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 94 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 94 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 93 transition count 122
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 93 transition count 122
Applied a total of 133 rules in 5 ms. Remains 93 /152 variables (removed 59) and now considering 122/259 (removed 137) transitions.
// Phase 1: matrix 122 rows 93 cols
[2022-06-09 12:11:12] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:11:12] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 122 rows 93 cols
[2022-06-09 12:11:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 12:11:13] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 93 cols
[2022-06-09 12:11:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:13] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/152 places, 122/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/152 places, 122/259 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s36 1) (GEQ s88 1)), p0:(AND (GEQ s26 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-10 finished in 413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F((G(F(F(G(p0))))&&F(p1))))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 131 transition count 191
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 131 transition count 191
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 114 transition count 169
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 114 transition count 169
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 84 place count 114 transition count 161
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 95 place count 103 transition count 145
Iterating global reduction 1 with 11 rules applied. Total rules applied 106 place count 103 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 103 transition count 144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 115 place count 95 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 123 place count 95 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 126 place count 95 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 130 place count 91 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 91 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 91 transition count 122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 137 place count 89 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 89 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 89 transition count 118
Applied a total of 141 rules in 15 ms. Remains 89 /152 variables (removed 63) and now considering 118/259 (removed 141) transitions.
// Phase 1: matrix 118 rows 89 cols
[2022-06-09 12:11:13] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-09 12:11:13] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 118 rows 89 cols
[2022-06-09 12:11:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 12:11:13] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 89 cols
[2022-06-09 12:11:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:13] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/152 places, 118/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/152 places, 118/259 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s45 1)), p0:(OR (LT s33 1) (LT s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22972 reset in 156 ms.
Product exploration explored 100000 steps with 23001 reset in 152 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 362 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 988 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9928 steps, run visited all 1 properties in 29 ms. (steps per millisecond=342 )
Probabilistic random walk after 9928 steps, saw 4450 distinct states, run finished after 29 ms. (steps per millisecond=342 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 89 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 : 89/89 places, 118/118 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 89 cols
[2022-06-09 12:11:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:14] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 118 rows 89 cols
[2022-06-09 12:11:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 12:11:15] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2022-06-09 12:11:15] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 118 rows 89 cols
[2022-06-09 12:11:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:15] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1046 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9928 steps, run visited all 1 properties in 17 ms. (steps per millisecond=584 )
Probabilistic random walk after 9928 steps, saw 4450 distinct states, run finished after 17 ms. (steps per millisecond=584 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22952 reset in 123 ms.
Product exploration explored 100000 steps with 22854 reset in 127 ms.
Built C files in :
/tmp/ltsmin9663315550371745218
[2022-06-09 12:11:15] [INFO ] Computing symmetric may disable matrix : 118 transitions.
[2022-06-09 12:11:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:11:15] [INFO ] Computing symmetric may enable matrix : 118 transitions.
[2022-06-09 12:11:15] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:11:15] [INFO ] Computing Do-Not-Accords matrix : 118 transitions.
[2022-06-09 12:11:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:11:15] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9663315550371745218
Running compilation step : cd /tmp/ltsmin9663315550371745218;'/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 380 ms.
Running link step : cd /tmp/ltsmin9663315550371745218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9663315550371745218;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10920116223819276499.hoa' '--buchi-type=spotba'
LTSmin run took 272 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-11 finished in 3326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(!(X(p1)||F(p2)))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 132 transition count 194
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 132 transition count 194
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 56 place count 116 transition count 170
Iterating global reduction 0 with 16 rules applied. Total rules applied 72 place count 116 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 80 place count 116 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 91 place count 105 transition count 146
Iterating global reduction 1 with 11 rules applied. Total rules applied 102 place count 105 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 103 place count 105 transition count 145
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 111 place count 97 transition count 131
Iterating global reduction 2 with 8 rules applied. Total rules applied 119 place count 97 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 97 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 93 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 93 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 135 place count 91 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 91 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 91 transition count 117
Applied a total of 139 rules in 6 ms. Remains 91 /152 variables (removed 61) and now considering 117/259 (removed 142) transitions.
// Phase 1: matrix 117 rows 91 cols
[2022-06-09 12:11:16] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:11:16] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-09 12:11:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 12:11:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 91 cols
[2022-06-09 12:11:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:11:16] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/152 places, 117/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/152 places, 117/259 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR p2 p1), (OR p1 p2), (OR p1 p2), true, (AND (NOT p2) p1), p2, (AND (NOT p2) p1), p1, p2]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}], [{ cond=p2, acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s56 1)), p2:(AND (GEQ s1 1) (GEQ s57 1)), p1:(OR (AND (GEQ s1 1) (GEQ s61 1)) (AND (GEQ s1 1) (GEQ s56 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 27180 reset in 138 ms.
Product exploration explored 100000 steps with 27195 reset in 146 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 804 ms. Reduced automaton from 9 states, 26 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[true, p2, p2]
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13033 steps, run visited all 1 properties in 20 ms. (steps per millisecond=651 )
Probabilistic random walk after 13033 steps, saw 6121 distinct states, run finished after 20 ms. (steps per millisecond=651 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 17 factoid took 735 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 613 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 65 ms :[true, p2, p2]
Support contains 2 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2022-06-09 12:11:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:19] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-09 12:11:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 12:11:20] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 91 cols
[2022-06-09 12:11:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:20] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/91 places, 117/117 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 : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[true, p2, p2]
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13033 steps, run visited all 1 properties in 20 ms. (steps per millisecond=651 )
Probabilistic random walk after 13033 steps, saw 6121 distinct states, run finished after 20 ms. (steps per millisecond=651 ) properties seen :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), true]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 103 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 59 ms :[true, p2, p2]
Product exploration explored 100000 steps with 23015 reset in 128 ms.
Product exploration explored 100000 steps with 22937 reset in 132 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 69 ms :[true, p2, p2]
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 88 transition count 113
Applied a total of 7 rules in 18 ms. Remains 88 /91 variables (removed 3) and now considering 113/117 (removed 4) transitions.
[2022-06-09 12:11:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 113 rows 88 cols
[2022-06-09 12:11:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:21] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/91 places, 113/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/91 places, 113/117 transitions.
Product exploration explored 100000 steps with 22826 reset in 290 ms.
Product exploration explored 100000 steps with 23093 reset in 237 ms.
Built C files in :
/tmp/ltsmin6493549279781355657
[2022-06-09 12:11:21] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6493549279781355657
Running compilation step : cd /tmp/ltsmin6493549279781355657;'/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 242 ms.
Running link step : cd /tmp/ltsmin6493549279781355657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin6493549279781355657;'/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/stateBased18413787673758410081.hoa' '--buchi-type=spotba'
LTSmin run took 2482 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-12 finished in 8083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||p1)) U (X(X(p2))&&F(X(F(p3))))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 134 transition count 199
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 134 transition count 199
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 119 transition count 177
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 119 transition count 177
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 73 place count 119 transition count 170
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 83 place count 109 transition count 158
Iterating global reduction 1 with 10 rules applied. Total rules applied 93 place count 109 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 109 transition count 156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 104 transition count 148
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 104 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 109 place count 104 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 102 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 102 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 101 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 101 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 101 transition count 134
Applied a total of 117 rules in 8 ms. Remains 101 /152 variables (removed 51) and now considering 134/259 (removed 125) transitions.
// Phase 1: matrix 134 rows 101 cols
[2022-06-09 12:11:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:25] [INFO ] Implicit Places using invariants in 721 ms returned []
// Phase 1: matrix 134 rows 101 cols
[2022-06-09 12:11:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 12:11:25] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
// Phase 1: matrix 134 rows 101 cols
[2022-06-09 12:11:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:25] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/152 places, 134/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/152 places, 134/259 transitions.
Stuttering acceptance computed with spot in 812 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p3), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-13 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=p1, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}, { cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 8}, { cond=p1, acceptance={} source=3 dest: 9}], [{ cond=(NOT p3), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 11}, { cond=p1, acceptance={} source=4 dest: 12}, { cond=(OR p1 p0), acceptance={} source=4 dest: 13}], [{ cond=(NOT p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 15}], [{ cond=(NOT p2), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=12 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=13 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=13 dest: 10}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=13 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={0} source=13 dest: 12}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=13 dest: 13}], [{ cond=(NOT p0), acceptance={} source=14 dest: 7}, { cond=p0, acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=15 dest: 14}, { cond=p1, acceptance={} source=15 dest: 15}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s95 1)), p0:(AND (GEQ s1 1) (GEQ s77 1)), p3:(AND (GEQ s1 1) (GEQ s93 1)), p2:(AND (GEQ s25 1) (GEQ s59 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-13 finished in 1795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((p1 U X(p2))||p0))&&p3)))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 133 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 133 transition count 201
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 53 place count 118 transition count 179
Iterating global reduction 0 with 15 rules applied. Total rules applied 68 place count 118 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 74 place count 118 transition count 173
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 107 transition count 158
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 107 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 98 place count 107 transition count 156
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 101 transition count 146
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 101 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 101 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 117 place count 97 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 97 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 96 transition count 132
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 96 transition count 132
Applied a total of 124 rules in 12 ms. Remains 96 /152 variables (removed 56) and now considering 132/259 (removed 127) transitions.
// Phase 1: matrix 132 rows 96 cols
[2022-06-09 12:11:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:26] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 132 rows 96 cols
[2022-06-09 12:11:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:26] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 12:11:27] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
// Phase 1: matrix 132 rows 96 cols
[2022-06-09 12:11:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:27] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/152 places, 132/259 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/152 places, 132/259 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(OR (LT s26 1) (LT s36 1) (AND (GEQ s1 1) (GEQ s94 1))), p0:(OR (LT s1 1) (LT s86 1)), p1:(AND (GEQ s1 1) (GEQ s55 1)), p2:(AND (GEQ s26 1) (GEQ s36 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22960 reset in 141 ms.
Product exploration explored 100000 steps with 22899 reset in 131 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 p3 p0 (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2))))), (X p3), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p3 p0 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p0) p1))), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p3 p0 (NOT p1) (NOT p2))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X p3)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT p2))), (X (X (AND p3 p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 1444 ms. Reduced automaton from 6 states, 22 edges and 4 AP to 6 states, 22 edges and 4 AP.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 448 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 1009 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 132 rows 96 cols
[2022-06-09 12:11:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:11:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:11:30] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2022-06-09 12:11:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 12:11:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 12:11:30] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2022-06-09 12:11:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 12:11:31] [INFO ] After 172ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2022-06-09 12:11:31] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 191 ms.
[2022-06-09 12:11:31] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 132/132 transitions.
Graph (complete) has 302 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 95 transition count 129
Applied a total of 4 rules in 7 ms. Remains 95 /96 variables (removed 1) and now considering 129/132 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/96 places, 129/132 transitions.
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 993 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 348861 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{0=1, 2=1, 4=1, 6=1, 8=1}
Probabilistic random walk after 348861 steps, saw 138025 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :5
Running SMT prover for 5 properties.
// Phase 1: matrix 129 rows 95 cols
[2022-06-09 12:11:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:11:35] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-09 12:11:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:11:35] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-09 12:11:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 12:11:35] [INFO ] After 108ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-09 12:11:35] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-06-09 12:11:35] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 129/129 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 129/129 transitions.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 336277 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336277 steps, saw 132397 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 129 rows 95 cols
[2022-06-09 12:11:39] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:11:39] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-09 12:11:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 12:11:39] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-09 12:11:39] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 12:11:39] [INFO ] After 91ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-09 12:11:39] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-06-09 12:11:39] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 129/129 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 129/129 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 129/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 95 cols
[2022-06-09 12:11:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:40] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 129 rows 95 cols
[2022-06-09 12:11:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 12:11:40] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2022-06-09 12:11:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 129 rows 95 cols
[2022-06-09 12:11:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:11:40] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 129/129 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 95 transition count 120
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 92 transition count 120
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 12 place count 92 transition count 111
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 30 place count 83 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 82 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 82 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 81 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 81 transition count 109
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 78 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 76 transition count 142
Applied a total of 44 rules in 17 ms. Remains 76 /95 variables (removed 19) and now considering 142/129 (removed -13) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 142 rows 76 cols
[2022-06-09 12:11:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 12:11:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 12:11:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 12:11:40] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-09 12:11:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 12:11:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:11:41] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-09 12:11:41] [INFO ] After 743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-06-09 12:11:41] [INFO ] After 881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-06-09 12:11:41] [INFO ] Flatten gal took : 11 ms
[2022-06-09 12:11:41] [INFO ] Flatten gal took : 17 ms
[2022-06-09 12:11:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8047892774542821341.gal : 16 ms
[2022-06-09 12:11:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality28913515826786773.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10511696039680232933;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8047892774542821341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality28913515826786773.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...317
Loading property file /tmp/ReachabilityCardinality28913515826786773.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :12 after 21
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :21 after 65
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :65 after 88
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :88 after 197
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :197 after 638
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :638 after 1454
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1454 after 4830
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :4830 after 15547
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :15547 after 44264
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,112517,1.68919,55208,2,9587,16,116634,11,0,458,166643,0
Total reachable state count : 112517

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

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,0,1.69182,55208,1,0,16,116634,11,0,464,166643,0
Reachability property apf6 does not hold.
No reachable states exhibit your property : apf6

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,0,1.69792,55208,1,0,16,116634,11,0,468,166643,0
Reachability property apf8 does not hold.
No reachable states exhibit your property : apf8

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf8,0,1.69819,55208,1,0,16,116634,11,0,468,166643,0
Reachability property apf10 does not hold.
No reachable states exhibit your property : apf10

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf10,0,1.70236,55208,1,0,16,116634,11,0,479,166643,0
Reachability property apf15 does not hold.
No reachable states exhibit your property : apf15

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf15,0,1.70269,55208,1,0,16,116634,11,0,479,166643,0
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2))))), (X p3), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p3 p0 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p0) p1))), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p3 p0 (NOT p1) (NOT p2))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X p3)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT p2))), (X (X (AND p3 p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p3)))), (G (NOT (AND p1 (NOT p0) (NOT p2) p3))), (G (NOT (AND p1 (NOT p0) p3))), (G (NOT (OR (AND p1 (NOT p0) (NOT p2)) (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p1) (NOT p0) (NOT p2) p3)), (F p2), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p2) p3))), (F (AND p1 p0 (NOT p2) p3)), (F (NOT p3)), (F (AND p1 p0 (NOT p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND (NOT p1) (NOT p0) p3)), (F (NOT (AND (NOT p1) p0 (NOT p2) p3)))]
Knowledge based reduction with 39 factoid took 2110 ms. Reduced automaton from 6 states, 22 edges and 4 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 96 cols
[2022-06-09 12:11:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:45] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 132 rows 96 cols
[2022-06-09 12:11:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:11:45] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 12:11:46] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
// Phase 1: matrix 132 rows 96 cols
[2022-06-09 12:11:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:46] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 132/132 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 p3 p0 (NOT p2)), (X p3), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p3)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 256 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 96 cols
[2022-06-09 12:11:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:11:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 12:11:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:11:46] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 12:11:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 12:11:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:11:46] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 12:11:46] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 12:11:46] [INFO ] After 102ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 12:11:46] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 116 ms.
[2022-06-09 12:11:47] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 132/132 transitions.
Graph (complete) has 302 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 95 transition count 129
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 93 transition count 123
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 93 transition count 123
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 91 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 90 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 89 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 88 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 88 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 87 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 87 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 87 transition count 113
Applied a total of 22 rules in 21 ms. Remains 87 /96 variables (removed 9) and now considering 113/132 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/96 places, 113/132 transitions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Finished probabilistic random walk after 16733 steps, run visited all 2 properties in 101 ms. (steps per millisecond=165 )
Probabilistic random walk after 16733 steps, saw 7959 distinct states, run finished after 101 ms. (steps per millisecond=165 ) properties seen :2
Knowledge obtained : [(AND p3 p0 (NOT p2)), (X p3), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p3)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 8 factoid took 290 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 22955 reset in 137 ms.
Product exploration explored 100000 steps with 23090 reset in 142 ms.
Built C files in :
/tmp/ltsmin4782640836295638061
[2022-06-09 12:11:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4782640836295638061
Running compilation step : cd /tmp/ltsmin4782640836295638061;'/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 206 ms.
Running link step : cd /tmp/ltsmin4782640836295638061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4782640836295638061;'/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/stateBased14485472072757377542.hoa' '--buchi-type=spotba'
LTSmin run took 941 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-15 finished in 22957 ms.
All properties solved by simple procedures.
Total runtime 53392 ms.

BK_STOP 1654776709540

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

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

Sequence of Actions to be Executed by the VM

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

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

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