Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478100252.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r103-tall-167814478100252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K Mar 5 18:22 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 1678239105957

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:31:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 01:31:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:31:47] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-08 01:31:47] [INFO ] Transformed 1440 places.
[2023-03-08 01:31:47] [INFO ] Transformed 672 transitions.
[2023-03-08 01:31:47] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1093 places in 7 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 38 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 413
Iterating global reduction 1 with 82 rules applied. Total rules applied 265 place count 244 transition count 413
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 277 place count 244 transition count 401
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 335 place count 186 transition count 343
Iterating global reduction 2 with 58 rules applied. Total rules applied 393 place count 186 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 397 place count 186 transition count 339
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 418 place count 165 transition count 306
Iterating global reduction 3 with 21 rules applied. Total rules applied 439 place count 165 transition count 306
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 462 place count 165 transition count 283
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 465 place count 162 transition count 278
Iterating global reduction 4 with 3 rules applied. Total rules applied 468 place count 162 transition count 278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 472 place count 162 transition count 274
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 473 place count 161 transition count 273
Iterating global reduction 5 with 1 rules applied. Total rules applied 474 place count 161 transition count 273
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 475 place count 160 transition count 272
Iterating global reduction 5 with 1 rules applied. Total rules applied 476 place count 160 transition count 272
Applied a total of 476 rules in 78 ms. Remains 160 /347 variables (removed 187) and now considering 272/672 (removed 400) transitions.
// Phase 1: matrix 272 rows 160 cols
[2023-03-08 01:31:48] [INFO ] Computed 2 place invariants in 24 ms
[2023-03-08 01:31:48] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-08 01:31:48] [INFO ] Invariant cache hit.
[2023-03-08 01:31:48] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-08 01:31:48] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2023-03-08 01:31:48] [INFO ] Invariant cache hit.
[2023-03-08 01:31:48] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 160/347 places, 272/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1023 ms. Remains : 160/347 places, 272/672 transitions.
Support contains 38 out of 160 places after structural reductions.
[2023-03-08 01:31:48] [INFO ] Flatten gal took : 43 ms
[2023-03-08 01:31:48] [INFO ] Flatten gal took : 19 ms
[2023-03-08 01:31:49] [INFO ] Input system was already deterministic with 272 transitions.
Support contains 36 out of 160 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 30) seen :4
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 112 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-08 01:31:49] [INFO ] Invariant cache hit.
[2023-03-08 01:31:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:31:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 01:31:50] [INFO ] After 913ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-08 01:31:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:31:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 01:31:51] [INFO ] After 733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-08 01:31:51] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-08 01:31:52] [INFO ] After 1088ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-08 01:31:54] [INFO ] After 2420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 1041 ms.
[2023-03-08 01:31:55] [INFO ] After 4413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 5 properties in 271 ms.
Support contains 27 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 152 transition count 252
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 152 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 152 transition count 249
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 147 transition count 244
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 147 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 147 transition count 242
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 143 transition count 235
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 143 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 143 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 142 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 142 transition count 232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 141 transition count 231
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 141 transition count 231
Applied a total of 45 rules in 37 ms. Remains 141 /160 variables (removed 19) and now considering 231/272 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 141/160 places, 231/272 transitions.
Incomplete random walk after 10000 steps, including 2343 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 124 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 110 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Finished probabilistic random walk after 12263 steps, run visited all 21 properties in 97 ms. (steps per millisecond=126 )
Probabilistic random walk after 12263 steps, saw 5470 distinct states, run finished after 97 ms. (steps per millisecond=126 ) properties seen :21
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 24 stable transitions
Graph (complete) has 589 edges and 160 vertex of which 159 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 198
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 198
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 135 transition count 193
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 117 transition count 172
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 117 transition count 172
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 98 place count 117 transition count 165
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 112 place count 103 transition count 144
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 103 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 130 place count 103 transition count 140
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 139 place count 94 transition count 125
Iterating global reduction 3 with 9 rules applied. Total rules applied 148 place count 94 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 94 transition count 123
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 155 place count 89 transition count 117
Iterating global reduction 4 with 5 rules applied. Total rules applied 160 place count 89 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 89 transition count 115
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 164 place count 87 transition count 113
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 167 place count 86 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 86 transition count 107
Applied a total of 168 rules in 28 ms. Remains 86 /160 variables (removed 74) and now considering 107/272 (removed 165) transitions.
// Phase 1: matrix 107 rows 86 cols
[2023-03-08 01:31:56] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:31:56] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 01:31:56] [INFO ] Invariant cache hit.
[2023-03-08 01:31:56] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-08 01:31:56] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-08 01:31:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:31:56] [INFO ] Invariant cache hit.
[2023-03-08 01:31:56] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/160 places, 107/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 279 ms. Remains : 86/160 places, 107/272 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-00 finished in 473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 136 transition count 207
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 136 transition count 207
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 136 transition count 201
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 118 transition count 180
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 118 transition count 180
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 99 place count 118 transition count 171
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 113 place count 104 transition count 150
Iterating global reduction 2 with 14 rules applied. Total rules applied 127 place count 104 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 131 place count 104 transition count 146
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 140 place count 95 transition count 131
Iterating global reduction 3 with 9 rules applied. Total rules applied 149 place count 95 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 151 place count 95 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 156 place count 90 transition count 123
Iterating global reduction 4 with 5 rules applied. Total rules applied 161 place count 90 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 163 place count 90 transition count 121
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 165 place count 88 transition count 119
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 88 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 168 place count 87 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 87 transition count 113
Applied a total of 169 rules in 21 ms. Remains 87 /160 variables (removed 73) and now considering 113/272 (removed 159) transitions.
// Phase 1: matrix 113 rows 87 cols
[2023-03-08 01:31:57] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:31:57] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 01:31:57] [INFO ] Invariant cache hit.
[2023-03-08 01:31:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:31:57] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 01:31:57] [INFO ] Invariant cache hit.
[2023-03-08 01:31:57] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/160 places, 113/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 87/160 places, 113/272 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1)), p1:(AND (GEQ s1 1) (GEQ s74 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 1 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 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U !p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 201
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 135 transition count 195
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 73 place count 118 transition count 175
Iterating global reduction 1 with 17 rules applied. Total rules applied 90 place count 118 transition count 175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 97 place count 118 transition count 168
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 105 transition count 148
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 105 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 127 place count 105 transition count 144
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 135 place count 97 transition count 131
Iterating global reduction 3 with 8 rules applied. Total rules applied 143 place count 97 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 145 place count 97 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 150 place count 92 transition count 123
Iterating global reduction 4 with 5 rules applied. Total rules applied 155 place count 92 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 157 place count 92 transition count 121
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 159 place count 90 transition count 119
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 89 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 89 transition count 113
Applied a total of 163 rules in 28 ms. Remains 89 /160 variables (removed 71) and now considering 113/272 (removed 159) transitions.
// Phase 1: matrix 113 rows 89 cols
[2023-03-08 01:31:57] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:31:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 01:31:57] [INFO ] Invariant cache hit.
[2023-03-08 01:31:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 01:31:57] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-08 01:31:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:31:57] [INFO ] Invariant cache hit.
[2023-03-08 01:31:57] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/160 places, 113/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 89/160 places, 113/272 transitions.
Stuttering acceptance computed with spot in 149 ms :[p0, (NOT p0), p0, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22999 reset in 218 ms.
Product exploration explored 100000 steps with 22985 reset in 164 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 302 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, (NOT p0), p0, (NOT p0)]
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17417 steps, run visited all 1 properties in 82 ms. (steps per millisecond=212 )
Probabilistic random walk after 17417 steps, saw 8282 distinct states, run finished after 83 ms. (steps per millisecond=209 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[p0, (NOT p0), p0, (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[p0, (NOT p0), p0, (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 113/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-08 01:31:59] [INFO ] Invariant cache hit.
[2023-03-08 01:31:59] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 01:31:59] [INFO ] Invariant cache hit.
[2023-03-08 01:31:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 01:31:59] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-08 01:31:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 01:31:59] [INFO ] Invariant cache hit.
[2023-03-08 01:31:59] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 89/89 places, 113/113 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 302 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 244 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[p0, (NOT p0), p0, (NOT p0)]
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17417 steps, run visited all 1 properties in 32 ms. (steps per millisecond=544 )
Probabilistic random walk after 17417 steps, saw 8282 distinct states, run finished after 32 ms. (steps per millisecond=544 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[p0, (NOT p0), p0, (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[p0, (NOT p0), p0, (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[p0, (NOT p0), p0, (NOT p0)]
Product exploration explored 100000 steps with 22968 reset in 95 ms.
Product exploration explored 100000 steps with 22963 reset in 104 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-08 01:32:00] [INFO ] Invariant cache hit.
[2023-03-08 01:32:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 01:32:00] [INFO ] Invariant cache hit.
[2023-03-08 01:32:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 01:32:01] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-08 01:32:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 01:32:01] [INFO ] Invariant cache hit.
[2023-03-08 01:32:01] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 89/89 places, 113/113 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-02 finished in 3706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p1)||G(p2))&&p0))))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 137 transition count 202
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 137 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 137 transition count 196
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 68 place count 121 transition count 177
Iterating global reduction 1 with 16 rules applied. Total rules applied 84 place count 121 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 121 transition count 172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 108 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 108 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 108 transition count 150
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 127 place count 99 transition count 135
Iterating global reduction 3 with 9 rules applied. Total rules applied 136 place count 99 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 139 place count 99 transition count 132
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 144 place count 94 transition count 126
Iterating global reduction 4 with 5 rules applied. Total rules applied 149 place count 94 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 151 place count 94 transition count 124
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 153 place count 92 transition count 122
Iterating global reduction 5 with 2 rules applied. Total rules applied 155 place count 92 transition count 122
Applied a total of 155 rules in 6 ms. Remains 92 /160 variables (removed 68) and now considering 122/272 (removed 150) transitions.
// Phase 1: matrix 122 rows 92 cols
[2023-03-08 01:32:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:32:01] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 01:32:01] [INFO ] Invariant cache hit.
[2023-03-08 01:32:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-08 01:32:01] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-08 01:32:01] [INFO ] Invariant cache hit.
[2023-03-08 01:32:01] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/160 places, 122/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 92/160 places, 122/272 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s51 1)), p2:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-03 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 197
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 197
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 135 transition count 191
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 73 place count 118 transition count 171
Iterating global reduction 1 with 17 rules applied. Total rules applied 90 place count 118 transition count 171
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 97 place count 118 transition count 164
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 105 transition count 144
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 105 transition count 144
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 105 transition count 141
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 97 transition count 128
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 97 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 97 transition count 126
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 150 place count 91 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 156 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 158 place count 91 transition count 117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 88 transition count 114
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 88 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 87 transition count 107
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 87 transition count 107
Applied a total of 167 rules in 27 ms. Remains 87 /160 variables (removed 73) and now considering 107/272 (removed 165) transitions.
// Phase 1: matrix 107 rows 87 cols
[2023-03-08 01:32:01] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:32:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 01:32:01] [INFO ] Invariant cache hit.
[2023-03-08 01:32:01] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 01:32:02] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-08 01:32:02] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 01:32:02] [INFO ] Invariant cache hit.
[2023-03-08 01:32:02] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/160 places, 107/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 87/160 places, 107/272 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-04 finished in 329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 136 transition count 205
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 136 transition count 205
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 136 transition count 198
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 118 transition count 177
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 118 transition count 177
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 98 place count 118 transition count 170
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 105 transition count 151
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 105 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 128 place count 105 transition count 147
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 136 place count 97 transition count 134
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 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 145 place count 97 transition count 133
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 151 place count 91 transition count 126
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 91 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 159 place count 91 transition count 124
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 162 place count 88 transition count 121
Iterating global reduction 5 with 3 rules applied. Total rules applied 165 place count 88 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 88 transition count 120
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 167 place count 87 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 87 transition count 114
Applied a total of 168 rules in 14 ms. Remains 87 /160 variables (removed 73) and now considering 114/272 (removed 158) transitions.
// Phase 1: matrix 114 rows 87 cols
[2023-03-08 01:32:02] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:32:02] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 01:32:02] [INFO ] Invariant cache hit.
[2023-03-08 01:32:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 01:32:02] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-08 01:32:02] [INFO ] Invariant cache hit.
[2023-03-08 01:32:02] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/160 places, 114/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 87/160 places, 114/272 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s28 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-05 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((p0||G(p1)))))||G(p2)))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 136 transition count 202
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 136 transition count 202
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 136 transition count 197
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 119 transition count 177
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 119 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 92 place count 119 transition count 172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 106 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 106 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 106 transition count 149
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 99 transition count 138
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 99 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 99 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 143 place count 93 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 149 place count 93 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 151 place count 93 transition count 128
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 154 place count 90 transition count 125
Iterating global reduction 5 with 3 rules applied. Total rules applied 157 place count 90 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 158 place count 90 transition count 124
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 159 place count 89 transition count 118
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 89 transition count 118
Applied a total of 160 rules in 16 ms. Remains 89 /160 variables (removed 71) and now considering 118/272 (removed 154) transitions.
// Phase 1: matrix 118 rows 89 cols
[2023-03-08 01:32:02] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:32:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:32:02] [INFO ] Invariant cache hit.
[2023-03-08 01:32:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 01:32:02] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-08 01:32:02] [INFO ] Invariant cache hit.
[2023-03-08 01:32:02] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/160 places, 118/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 89/160 places, 118/272 transitions.
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 3}], [{ cond=(NOT p2), acceptance={} source=8 dest: 9}, { cond=p2, acceptance={} source=8 dest: 10}], [{ cond=true, acceptance={} source=9 dest: 6}], [{ cond=(NOT p2), acceptance={} source=10 dest: 6}, { cond=p2, acceptance={} source=10 dest: 7}]], initial=8, aps=[p1:(AND (GEQ s1 1) (GEQ s41 1)), p0:(AND (GEQ s1 1) (GEQ s75 1)), p2:(OR (LT s1 1) (LT s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22955 reset in 207 ms.
Product exploration explored 100000 steps with 22945 reset in 231 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 11 states, 23 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (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))]
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 01:32:04] [INFO ] Invariant cache hit.
[2023-03-08 01:32:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:32:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:05] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 01:32:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:32:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:32:05] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 01:32:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 01:32:05] [INFO ] After 140ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-08 01:32:05] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-08 01:32:05] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 118/118 transitions.
Graph (complete) has 279 edges and 89 vertex of which 88 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 88 transition count 115
Applied a total of 4 rules in 5 ms. Remains 88 /89 variables (removed 1) and now considering 115/118 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 88/89 places, 115/118 transitions.
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 115 rows 88 cols
[2023-03-08 01:32:06] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 01:32:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:06] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 01:32:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:06] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 01:32:06] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:32:06] [INFO ] After 81ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 01:32:06] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-08 01:32:06] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/88 places, 115/115 transitions.
Incomplete random walk after 10000 steps, including 2337 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 957675 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 957675 steps, saw 367247 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-08 01:32:10] [INFO ] Invariant cache hit.
[2023-03-08 01:32:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-08 01:32:10] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 01:32:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:10] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:10] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:32:10] [INFO ] After 27ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:10] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 01:32:10] [INFO ] After 180ms 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 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/88 places, 115/115 transitions.
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 875959 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 875959 steps, saw 333408 distinct states, run finished after 3005 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 01:32:13] [INFO ] Invariant cache hit.
[2023-03-08 01:32:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:13] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 01:32:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:13] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:32:13] [INFO ] After 30ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:13] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-08 01:32:13] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/88 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 115/115 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-08 01:32:13] [INFO ] Invariant cache hit.
[2023-03-08 01:32:13] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 01:32:13] [INFO ] Invariant cache hit.
[2023-03-08 01:32:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:32:13] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-08 01:32:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:32:13] [INFO ] Invariant cache hit.
[2023-03-08 01:32:13] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 88/88 places, 115/115 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 88 transition count 106
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 85 transition count 106
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 12 place count 85 transition count 99
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 78 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 77 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 77 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 76 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 76 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 72 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 71 transition count 112
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 71 transition count 112
Applied a total of 43 rules in 30 ms. Remains 71 /88 variables (removed 17) and now considering 112/115 (removed 3) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 112 rows 71 cols
[2023-03-08 01:32:14] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 01:32:14] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-08 01:32:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:32:14] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 01:32:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 01:32:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:14] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:14] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 01:32:14] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), true, (X (X p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p2)), (F p1), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 4 factoid took 330 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (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))]
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (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))]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 89 cols
[2023-03-08 01:32:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:32:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 01:32:15] [INFO ] Invariant cache hit.
[2023-03-08 01:32:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 01:32:15] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-08 01:32:15] [INFO ] Invariant cache hit.
[2023-03-08 01:32:15] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 89/89 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (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))]
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 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 471 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 466 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 01:32:16] [INFO ] Invariant cache hit.
[2023-03-08 01:32:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:32:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:16] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 01:32:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:32:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:32:16] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 01:32:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 01:32:16] [INFO ] After 83ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 01:32:16] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-08 01:32:16] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 118/118 transitions.
Graph (complete) has 279 edges and 89 vertex of which 88 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 88 transition count 115
Applied a total of 4 rules in 3 ms. Remains 88 /89 variables (removed 1) and now considering 115/118 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/89 places, 115/118 transitions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 929722 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 929722 steps, saw 355224 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 115 rows 88 cols
[2023-03-08 01:32:20] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:32:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:20] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 01:32:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:20] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:32:20] [INFO ] After 30ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:20] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 01:32:20] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 88/88 places, 115/115 transitions.
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 89 ms. (steps per millisecond=112 ) 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
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 877713 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 877713 steps, saw 334131 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 01:32:23] [INFO ] Invariant cache hit.
[2023-03-08 01:32:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:23] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 01:32:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:23] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:23] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:32:23] [INFO ] After 28ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:23] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 01:32:23] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 88/88 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-08 01:32:23] [INFO ] Invariant cache hit.
[2023-03-08 01:32:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 01:32:23] [INFO ] Invariant cache hit.
[2023-03-08 01:32:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:32:24] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-08 01:32:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:32:24] [INFO ] Invariant cache hit.
[2023-03-08 01:32:24] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 88/88 places, 115/115 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 88 transition count 106
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 85 transition count 106
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 12 place count 85 transition count 99
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 78 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 77 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 77 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 76 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 76 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 72 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 71 transition count 112
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 71 transition count 112
Applied a total of 43 rules in 16 ms. Remains 71 /88 variables (removed 17) and now considering 112/115 (removed 3) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 112 rows 71 cols
[2023-03-08 01:32:24] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 01:32:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-08 01:32:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:32:24] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 01:32:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 01:32:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:32:24] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 01:32:24] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 01:32:24] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 p2)), (F p1), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (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))]
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (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))]
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (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))]
Product exploration explored 100000 steps with 22932 reset in 103 ms.
Product exploration explored 100000 steps with 22933 reset in 106 ms.
Applying partial POR strategy [true, true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (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))]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-08 01:32:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 118 rows 89 cols
[2023-03-08 01:32:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:32:26] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 89/89 places, 118/118 transitions.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-08 01:32:26] [INFO ] Invariant cache hit.
[2023-03-08 01:32:26] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 01:32:26] [INFO ] Invariant cache hit.
[2023-03-08 01:32:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 01:32:26] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-08 01:32:26] [INFO ] Invariant cache hit.
[2023-03-08 01:32:26] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 89/89 places, 118/118 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-07 finished in 24012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 204
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 204
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 135 transition count 197
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 117 transition count 176
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 117 transition count 176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 101 place count 117 transition count 168
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 115 place count 103 transition count 147
Iterating global reduction 2 with 14 rules applied. Total rules applied 129 place count 103 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 133 place count 103 transition count 143
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 142 place count 94 transition count 128
Iterating global reduction 3 with 9 rules applied. Total rules applied 151 place count 94 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 94 transition count 126
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 159 place count 88 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 165 place count 88 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 167 place count 88 transition count 117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 170 place count 85 transition count 114
Iterating global reduction 5 with 3 rules applied. Total rules applied 173 place count 85 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 85 transition count 113
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 175 place count 84 transition count 107
Iterating global reduction 6 with 1 rules applied. Total rules applied 176 place count 84 transition count 107
Applied a total of 176 rules in 10 ms. Remains 84 /160 variables (removed 76) and now considering 107/272 (removed 165) transitions.
// Phase 1: matrix 107 rows 84 cols
[2023-03-08 01:32:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:32:26] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-08 01:32:26] [INFO ] Invariant cache hit.
[2023-03-08 01:32:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 01:32:27] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2023-03-08 01:32:27] [INFO ] Invariant cache hit.
[2023-03-08 01:32:27] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/160 places, 107/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 84/160 places, 107/272 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23004 reset in 98 ms.
Product exploration explored 100000 steps with 22980 reset in 101 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16909 steps, run visited all 1 properties in 23 ms. (steps per millisecond=735 )
Probabilistic random walk after 16909 steps, saw 8031 distinct states, run finished after 23 ms. (steps per millisecond=735 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 01:32:27] [INFO ] Invariant cache hit.
[2023-03-08 01:32:28] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 01:32:28] [INFO ] Invariant cache hit.
[2023-03-08 01:32:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 01:32:28] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-08 01:32:28] [INFO ] Invariant cache hit.
[2023-03-08 01:32:28] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 84/84 places, 107/107 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16909 steps, run visited all 1 properties in 29 ms. (steps per millisecond=583 )
Probabilistic random walk after 16909 steps, saw 8031 distinct states, run finished after 29 ms. (steps per millisecond=583 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23037 reset in 94 ms.
Product exploration explored 100000 steps with 22901 reset in 103 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 01:32:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:32:29] [INFO ] Invariant cache hit.
[2023-03-08 01:32:29] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 84/84 places, 107/107 transitions.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 01:32:29] [INFO ] Invariant cache hit.
[2023-03-08 01:32:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 01:32:29] [INFO ] Invariant cache hit.
[2023-03-08 01:32:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 01:32:29] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-08 01:32:29] [INFO ] Invariant cache hit.
[2023-03-08 01:32:29] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 84/84 places, 107/107 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-08 finished in 3446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 200
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 200
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 135 transition count 193
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 74 place count 118 transition count 173
Iterating global reduction 1 with 17 rules applied. Total rules applied 91 place count 118 transition count 173
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 98 place count 118 transition count 166
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 105 transition count 147
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 105 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 105 transition count 144
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 135 place count 97 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 143 place count 97 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 146 place count 97 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 92 transition count 121
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 92 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 159 place count 89 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 162 place count 89 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 88 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 88 transition count 111
Applied a total of 165 rules in 8 ms. Remains 88 /160 variables (removed 72) and now considering 111/272 (removed 161) transitions.
// Phase 1: matrix 111 rows 88 cols
[2023-03-08 01:32:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:32:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 01:32:30] [INFO ] Invariant cache hit.
[2023-03-08 01:32:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 01:32:30] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-08 01:32:30] [INFO ] Invariant cache hit.
[2023-03-08 01:32:30] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/160 places, 111/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 88/160 places, 111/272 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-09 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 s83 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 218 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 5 stabilizing places and 12 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 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-09 finished in 857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G((X(p2)&&p1))||G(p0))))))'
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 137 transition count 203
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 137 transition count 203
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 137 transition count 197
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 67 place count 122 transition count 179
Iterating global reduction 1 with 15 rules applied. Total rules applied 82 place count 122 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 86 place count 122 transition count 175
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 98 place count 110 transition count 156
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 110 transition count 156
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 110 transition count 152
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 102 transition count 141
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 102 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 102 transition count 139
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 137 place count 97 transition count 133
Iterating global reduction 4 with 5 rules applied. Total rules applied 142 place count 97 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 97 transition count 131
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 146 place count 95 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 95 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 95 transition count 128
Applied a total of 149 rules in 18 ms. Remains 95 /160 variables (removed 65) and now considering 128/272 (removed 144) transitions.
// Phase 1: matrix 128 rows 95 cols
[2023-03-08 01:32:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:32:31] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 01:32:31] [INFO ] Invariant cache hit.
[2023-03-08 01:32:31] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:32:31] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-08 01:32:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:32:31] [INFO ] Invariant cache hit.
[2023-03-08 01:32:31] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/160 places, 128/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 645 ms. Remains : 95/160 places, 128/272 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s37 1)), p1:(AND (GEQ s1 1) (GEQ s83 1)), p2:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22940 reset in 135 ms.
Product exploration explored 100000 steps with 23012 reset in 198 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 327 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 890 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter insensitive) to 4 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 1063 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 955 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 983 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 01:32:33] [INFO ] Invariant cache hit.
[2023-03-08 01:32:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:32:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:32:33] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-08 01:32:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:32:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:32:33] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-08 01:32:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:32:33] [INFO ] After 47ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-08 01:32:33] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-08 01:32:33] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 128/128 transitions.
Graph (complete) has 301 edges and 95 vertex of which 94 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 94 transition count 126
Applied a total of 3 rules in 5 ms. Remains 94 /95 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 94/95 places, 126/128 transitions.
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 962 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 968 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 968 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7777 steps, run visited all 3 properties in 58 ms. (steps per millisecond=134 )
Probabilistic random walk after 7777 steps, saw 3495 distinct states, run finished after 59 ms. (steps per millisecond=131 ) properties seen :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 21 factoid took 1002 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 95 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 : 95/95 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 01:32:35] [INFO ] Invariant cache hit.
[2023-03-08 01:32:35] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 01:32:35] [INFO ] Invariant cache hit.
[2023-03-08 01:32:35] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:32:35] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-08 01:32:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:32:35] [INFO ] Invariant cache hit.
[2023-03-08 01:32:35] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 95/95 places, 128/128 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 327 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 947 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7777 steps, run visited all 1 properties in 19 ms. (steps per millisecond=409 )
Probabilistic random walk after 7777 steps, saw 3495 distinct states, run finished after 19 ms. (steps per millisecond=409 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22901 reset in 124 ms.
Product exploration explored 100000 steps with 22946 reset in 133 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 128/128 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 93 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 91 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 91 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 91 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 89 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 89 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 88 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 88 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 87 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 86 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 86 transition count 110
Applied a total of 20 rules in 9 ms. Remains 86 /95 variables (removed 9) and now considering 110/128 (removed 18) transitions.
// Phase 1: matrix 110 rows 86 cols
[2023-03-08 01:32:36] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:32:36] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 01:32:36] [INFO ] Invariant cache hit.
[2023-03-08 01:32:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 01:32:36] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-08 01:32:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:32:36] [INFO ] Invariant cache hit.
[2023-03-08 01:32:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/95 places, 110/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 86/95 places, 110/128 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-10 finished in 5827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p0))||G((p1 U p2))))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 137 transition count 200
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 137 transition count 200
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 137 transition count 195
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 121 transition count 179
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 121 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 89 place count 121 transition count 173
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 108 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 108 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 108 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 127 place count 100 transition count 135
Iterating global reduction 3 with 8 rules applied. Total rules applied 135 place count 100 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 100 transition count 134
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 142 place count 94 transition count 127
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 94 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 94 transition count 125
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 153 place count 91 transition count 122
Iterating global reduction 5 with 3 rules applied. Total rules applied 156 place count 91 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 91 transition count 121
Applied a total of 157 rules in 31 ms. Remains 91 /160 variables (removed 69) and now considering 121/272 (removed 151) transitions.
// Phase 1: matrix 121 rows 91 cols
[2023-03-08 01:32:36] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:32:36] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 01:32:36] [INFO ] Invariant cache hit.
[2023-03-08 01:32:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 01:32:37] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-08 01:32:37] [INFO ] Invariant cache hit.
[2023-03-08 01:32:37] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/160 places, 121/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 91/160 places, 121/272 transitions.
Stuttering acceptance computed with spot in 207 ms :[(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-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s86 1)), p2:(AND (GEQ s7 1) (GEQ s35 1)), p1:(AND (GEQ s34 1) (GEQ s59 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 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-11 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)&&F(!p0)))'
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 136 transition count 200
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 136 transition count 200
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 136 transition count 194
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 69 place count 121 transition count 176
Iterating global reduction 1 with 15 rules applied. Total rules applied 84 place count 121 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 91 place count 121 transition count 169
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 103 place count 109 transition count 152
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 109 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 109 transition count 148
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 126 place count 102 transition count 135
Iterating global reduction 3 with 7 rules applied. Total rules applied 133 place count 102 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 102 transition count 133
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 139 place count 98 transition count 129
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 98 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 145 place count 98 transition count 127
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 147 place count 96 transition count 125
Iterating global reduction 5 with 2 rules applied. Total rules applied 149 place count 96 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 150 place count 96 transition count 124
Applied a total of 150 rules in 13 ms. Remains 96 /160 variables (removed 64) and now considering 124/272 (removed 148) transitions.
// Phase 1: matrix 124 rows 96 cols
[2023-03-08 01:32:37] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:32:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 01:32:37] [INFO ] Invariant cache hit.
[2023-03-08 01:32:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 01:32:37] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 01:32:37] [INFO ] Invariant cache hit.
[2023-03-08 01:32:37] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/160 places, 124/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 96/160 places, 124/272 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s63 1)), p1:(OR (AND (GEQ s1 1) (GEQ s61 1)) (LT s17 1) (LT s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-12 finished in 424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (X(p2)&&p1)))))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 136 transition count 203
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 136 transition count 203
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 136 transition count 198
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 119 transition count 178
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 119 transition count 178
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 119 transition count 171
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 106 transition count 151
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 106 transition count 151
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 106 transition count 147
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 132 place count 98 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 140 place count 98 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 142 place count 98 transition count 134
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 147 place count 93 transition count 128
Iterating global reduction 4 with 5 rules applied. Total rules applied 152 place count 93 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 154 place count 93 transition count 126
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 156 place count 91 transition count 124
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 91 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 91 transition count 123
Applied a total of 159 rules in 10 ms. Remains 91 /160 variables (removed 69) and now considering 123/272 (removed 149) transitions.
// Phase 1: matrix 123 rows 91 cols
[2023-03-08 01:32:37] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:32:37] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 01:32:37] [INFO ] Invariant cache hit.
[2023-03-08 01:32:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 01:32:37] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-08 01:32:37] [INFO ] Invariant cache hit.
[2023-03-08 01:32:38] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/160 places, 123/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 91/160 places, 123/272 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(OR (AND (GEQ s1 1) (GEQ s86 1)) (AND (GEQ s1 1) (GEQ s46 1))), p2:(OR (AND (GEQ s1 1) (GEQ s86 1)) (AND (GEQ s1 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-13 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 200
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 200
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 135 transition count 193
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 74 place count 118 transition count 173
Iterating global reduction 1 with 17 rules applied. Total rules applied 91 place count 118 transition count 173
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 98 place count 118 transition count 166
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 105 transition count 147
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 105 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 105 transition count 144
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 135 place count 97 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 143 place count 97 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 146 place count 97 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 92 transition count 121
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 92 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 159 place count 89 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 162 place count 89 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 88 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 88 transition count 111
Applied a total of 165 rules in 10 ms. Remains 88 /160 variables (removed 72) and now considering 111/272 (removed 161) transitions.
// Phase 1: matrix 111 rows 88 cols
[2023-03-08 01:32:38] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:32:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 01:32:38] [INFO ] Invariant cache hit.
[2023-03-08 01:32:38] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 01:32:38] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-08 01:32:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:32:38] [INFO ] Invariant cache hit.
[2023-03-08 01:32:38] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/160 places, 111/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 88/160 places, 111/272 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-14 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(!p0) U p1)||X(X(F(p1))))))'
Support contains 2 out of 160 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 : 160/160 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 136 transition count 201
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 136 transition count 201
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 136 transition count 194
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 71 place count 120 transition count 175
Iterating global reduction 1 with 16 rules applied. Total rules applied 87 place count 120 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 93 place count 120 transition count 169
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 106 place count 107 transition count 150
Iterating global reduction 2 with 13 rules applied. Total rules applied 119 place count 107 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 122 place count 107 transition count 147
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 130 place count 99 transition count 133
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 99 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 141 place count 99 transition count 130
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 146 place count 94 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 94 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 91 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 91 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 91 transition count 120
Applied a total of 158 rules in 21 ms. Remains 91 /160 variables (removed 69) and now considering 120/272 (removed 152) transitions.
// Phase 1: matrix 120 rows 91 cols
[2023-03-08 01:32:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:32:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 01:32:38] [INFO ] Invariant cache hit.
[2023-03-08 01:32:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 01:32:38] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-08 01:32:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:32:38] [INFO ] Invariant cache hit.
[2023-03-08 01:32:38] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/160 places, 120/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 91/160 places, 120/272 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-15 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U !p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((p0||G(p1)))))||G(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m06-LTLFireability-08
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 160/160 places, 272/272 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 204
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 204
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 135 transition count 197
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 117 transition count 176
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 117 transition count 176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 101 place count 117 transition count 168
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 115 place count 103 transition count 147
Iterating global reduction 2 with 14 rules applied. Total rules applied 129 place count 103 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 133 place count 103 transition count 143
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 142 place count 94 transition count 128
Iterating global reduction 3 with 9 rules applied. Total rules applied 151 place count 94 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 94 transition count 126
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 159 place count 88 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 165 place count 88 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 167 place count 88 transition count 117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 170 place count 85 transition count 114
Iterating global reduction 5 with 3 rules applied. Total rules applied 173 place count 85 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 85 transition count 113
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 175 place count 84 transition count 107
Iterating global reduction 6 with 1 rules applied. Total rules applied 176 place count 84 transition count 107
Applied a total of 176 rules in 18 ms. Remains 84 /160 variables (removed 76) and now considering 107/272 (removed 165) transitions.
// Phase 1: matrix 107 rows 84 cols
[2023-03-08 01:32:39] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:32:39] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 01:32:39] [INFO ] Invariant cache hit.
[2023-03-08 01:32:39] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 01:32:39] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-08 01:32:39] [INFO ] Invariant cache hit.
[2023-03-08 01:32:39] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 84/160 places, 107/272 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 277 ms. Remains : 84/160 places, 107/272 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s60 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22910 reset in 101 ms.
Product exploration explored 100000 steps with 22983 reset in 104 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16909 steps, run visited all 1 properties in 23 ms. (steps per millisecond=735 )
Probabilistic random walk after 16909 steps, saw 8031 distinct states, run finished after 23 ms. (steps per millisecond=735 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 01:32:40] [INFO ] Invariant cache hit.
[2023-03-08 01:32:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:32:40] [INFO ] Invariant cache hit.
[2023-03-08 01:32:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 01:32:40] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-08 01:32:40] [INFO ] Invariant cache hit.
[2023-03-08 01:32:40] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 84/84 places, 107/107 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2327 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16909 steps, run visited all 1 properties in 31 ms. (steps per millisecond=545 )
Probabilistic random walk after 16909 steps, saw 8031 distinct states, run finished after 31 ms. (steps per millisecond=545 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22953 reset in 92 ms.
Product exploration explored 100000 steps with 22896 reset in 107 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 01:32:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:32:41] [INFO ] Invariant cache hit.
[2023-03-08 01:32:41] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 84/84 places, 107/107 transitions.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 0 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 01:32:41] [INFO ] Invariant cache hit.
[2023-03-08 01:32:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:32:41] [INFO ] Invariant cache hit.
[2023-03-08 01:32:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 01:32:41] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-08 01:32:41] [INFO ] Invariant cache hit.
[2023-03-08 01:32:41] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 84/84 places, 107/107 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-08 finished in 2910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G((X(p2)&&p1))||G(p0))))))'
[2023-03-08 01:32:42] [INFO ] Flatten gal took : 54 ms
[2023-03-08 01:32:42] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 01:32:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 272 transitions and 1069 arcs took 2 ms.
Total runtime 54803 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d1m06
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA DBSingleClientW-PT-d1m06-LTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d1m06-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d1m06-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d1m06-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678239163422

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 DBSingleClientW-PT-d1m06-LTLFireability-08
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 7 (type EXCL) for DBSingleClientW-PT-d1m06-LTLFireability-08
lola: result : false
lola: markings : 1021
lola: fired transitions : 1861
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 9 DBSingleClientW-PT-d1m06-LTLFireability-10
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for DBSingleClientW-PT-d1m06-LTLFireability-10
lola: result : false
lola: markings : 2674
lola: fired transitions : 9468
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DBSingleClientW-PT-d1m06-LTLFireability-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DBSingleClientW-PT-d1m06-LTLFireability-07
lola: result : false
lola: markings : 783
lola: fired transitions : 1426
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d1m06-LTLFireability-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d1m06-LTLFireability-02
lola: result : false
lola: markings : 1859
lola: fired transitions : 3458
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m06-LTLFireability-02: LTL false LTL model checker
DBSingleClientW-PT-d1m06-LTLFireability-07: LTL false LTL model checker
DBSingleClientW-PT-d1m06-LTLFireability-08: LTL false LTL model checker
DBSingleClientW-PT-d1m06-LTLFireability-10: CONJ false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="lolaxred"
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-5348"
echo " Executing tool lolaxred"
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 r103-tall-167814478100252"
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 ;